A review of two network curvature measures
From MaRDI portal
Publication:1982207
DOI10.1007/978-3-030-61732-5_3zbMath1477.28002OpenAlexW3134402815MaRDI QIDQ1982207
Réka Albert, Tanima Chatterjee, Bhaskar Das Gupta
Publication date: 7 September 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-61732-5_3
curvaturegeometric measuregeometric embeddingGromov-hyperbolic curvature measurehigher-dimensional complexeshigher-dimensional geometric shapes
Geometric measure and integration theory, integral and normal currents in optimization (49Q15) Length, area, volume, other geometric measure theory (28A75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. I. Excluding a forest
- Expanders are not hyperbolic
- Bochner's method for cell complexes and combinatorial Ricci curvature
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- On the complexity of Newman's community finding approach for biological and social networks
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- Scaled Gromov four-point condition for network graph curvature computation
- Forman-Ricci flow for change detection in large dynamic data sets
- Computing the Gromov hyperbolicity of a discrete metric space
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks
- Statistical mechanics of complex networks
- Geodesics and almost geodesic cycles in random regular graphs
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Packing and Covering δ-Hyperbolic Spaces by Balls
- A Panoramic View of Riemannian Geometry
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze
- Sequential change‐point detection based on direct density‐ratio estimation
- Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
- Multiplying matrices faster than coppersmith-winograd
- Scaled Gromov hyperbolic graphs
- Algorithms and Computation
- Networks
This page was built for publication: A review of two network curvature measures
