Curvature of an Arbitrary Surface for Discrete Gravity and for $d=2$ Pure Simplicial Complexes

Abstract

We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the surface in question to its four closest neighbors, forming quads. We then focus on the simplices of $d=2$, or triangles embedded in these quads, which make up a pure simplicial complex with $d=2$. This allows us to numerically compute the local metric along with zweibeins, which subsequently leads to a derivation of discrete curvature defined at every triangle or face. We provide an efficient algorithm with $\mathcal{O}(N\log N)$ complexity that first orients two-dimensional surfaces, solves the nonlinear system of equations of the spin-connections resulting from the torsion condition, and returns the value of curvature at each face.

References in corpus (18)

• Hyperbolic Geometry of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Self-similarity of complex networks and hidden metric spaces
• Network Cosmology
• Topological implications of negative curvature for biological and social networks
• Ollivier-Ricci curvature convergence in random geometric graphs
• Discrete curvature on graphs from the effective resistance
• Self-Assembly of Geometric Space from Random Graphs
• Emergence of the Circle in a Statistical Model of Random Cubic Graphs
• Statistical mechanics of graph models and their implications for emergent spacetime manifolds
• Discrete Gravity
• Space as a low-temperature regime of graphs
• Convergence of Combinatorial Gravity
• Ollivier curvature of random geometric graphs converges to Ricci curvature of their Riemannian manifolds
• Greedy routing optimisation in hyperbolic networks
• Scalar Curvature in Discrete Gravity
• Curvature Tensor in Discrete Gravity
• Black Hole in Discrete Gravity