Search papers, labs, and topics across Lattice.
This paper compares Euclidean and hyperbolic Graph Neural Networks (GNNs) for node classification on a large Bitcoin transaction graph, focusing on the interaction between neighborhood aggregation depth and embedding geometry. The authors vary the neighborhood size while keeping the model architecture fixed to analyze differences in the two embedding spaces. They find that the joint selection of learning rate and curvature is crucial for stabilizing high-dimensional hyperbolic embeddings, providing insights for deploying hyperbolic GNNs in computational social systems.
Hyperbolic GNNs on Bitcoin transaction networks need careful tuning of learning rate and curvature to stabilize high-dimensional embeddings, a factor often overlooked.
Bitcoin transaction networks are large scale socio- technical systems in which activities are represented through multi-hop interaction patterns. Graph Neural Networks(GNNs) have become a widely adopted tool for analyzing such systems, supporting tasks such as entity detection and transaction classification. Large-scale datasets like Elliptic have allowed for a rise in the analysis of these systems and in tasks such as fraud detection. In these settings, the amount of transactional context available to each node is determined by the neighborhood aggregation and sampling strategies, yet the interaction between these receptive fields and embedding geometry has received limited attention. In this work, we conduct a controlled comparison of Euclidean and tangent-space hyperbolic GNNs for node classification on a large Bitcoin transaction graph. By explicitly varying the neighborhood while keeping the model architecture and dimensionality fixed, we analyze the differences in two embedding spaces. We further examine optimization behavior and observe that joint selection of learning rate and curvature plays a critical role in stabilizing high-dimensional hyperbolic embeddings. Overall, our findings provide practical insights into the role of embedding geometry and neighborhood depth when modeling large-scale transaction networks, informing the deployment of hyperbolic GNNs for computational social systems.
