Embedding Graphs in Lorentzian Spacetime
arXiv:1602.03103 · doi:10.1371/journal.pone.0187301
Abstract
Geometric approaches to network analysis combine simply defined models with great descriptive power. In this work we provide a method for embedding directed acyclic graphs into Minkowski spacetime using Multidimensional scaling (MDS). First we generalise the classical MDS algorithm, defined only for metrics with a Euclidean signature, to manifolds of any metric signature. We then use this general method to develop an algorithm to be used on networks which have causal structure allowing them to be embedded in Lorentzian manifolds. The method is demonstrated by calculating embeddings for both causal sets and citation networks in Minkowski spacetime. We finally suggest a number of applications in citation analysis such as paper recommendation, identifying missing citations and fitting citation models to data using this geometric approach.
arXiv comment15 pages, 6 figure, 2 page appendix
References in corpus (22)
- The structure and function of complex networks
- Hyperbolic Geometry of Complex Networks
- Popularity versus Similarity in Growing Networks
- Random Geometric Graphs
- The spatial structure of networks
- Uncovering space-independent communities in spatial networks
- Curvature and temperature of complex networks
- Network Cosmology
- Interdisciplinary and physics challenges of Network Theory
- Emergent Complex Network Geometry
- Emergence of Soft Communities from Geometric Preferential Attachment
- Clustering implies geometry in networks
- Transitive Reduction of Citation Networks
- Spacelike distance from discrete causal order
- Manifold dimension of a causal set: Tests in conformally flat spacetimes
- Quantum Gravity Phenomenology
- What is the dimension of citation space?
- On the Degree Sequence of Random Geometric Digraphs
- Scale-invariant geometric random graphs
- Connectivity Scaling Laws in Wireless Networks
- Discrete spacetime and its applications
- Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm
Cited by in corpus (15)
- Synchronization in Network Geometries with Finite Spectral Dimension
- Ultrahyperbolic Knowledge Graph Embeddings
- Hyperbolic Disk Embeddings for Directed Acyclic Graphs
- Convexity in complex networks
- Zoo Guide to Network Embedding
- Longest Path in the Price Model
- Order in Innovation
- Navigability of Random Geometric Graphs in the Universe and Other Spacetimes
- Inference of Boundaries in Causal Sets
- Directed Graph Embeddings in Pseudo-Riemannian Manifolds
- HEAT: Hyperbolic Embedding of Attributed Networks
- Embedding Causal Sets into Minkowski Spacetime
- High Performance Algorithms for Quantum Gravity and Cosmology
- Symmetry-driven embedding of networks in hyperbolic space
- Simpler embeddings of causal sets into Minkowski spacetime