A review of two network curvature measures
DOI10.1007/978-3-030-61732-5_3zbMATH Open1477.28002OpenAlexW3134402815MaRDI QIDQ1982207FDOQ1982207
Authors: Tanima Chatterjee, Réka Albert, Bhaskar Dasgupta
Publication date: 7 September 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-61732-5_3
Recommendations
- Systematic evaluation of a new combinatorial curvature for complex networks
- Discrete curvatures and network analysis
- Forman curvature for complex networks
- The curl of graphs and networks
- The curl of a weighted network
- On the classification of networks self-similarly moving by curvature
- scientific article; zbMATH DE number 3843460
- Algorithms for motion of networks by weighted mean curvature
curvaturegeometric measuregeometric embeddingGromov-hyperbolic curvature measurehigher-dimensional complexeshigher-dimensional geometric shapes
Length, area, volume, other geometric measure theory (28A75) Geometric measure and integration theory, integral and normal currents in optimization (49Q15)
Cites Work
- Statistical mechanics of complex networks
- Introduction to algorithms
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Networks. An introduction.
- Title not available (Why is that?)
- Euclidean versus hyperbolic congestion in idealized versus experimental networks
- A Panoramic View of Riemannian Geometry
- Multiplying matrices faster than coppersmith-winograd
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Title not available (Why is that?)
- Graph minors. I. Excluding a forest
- Title not available (Why is that?)
- Expanders are not hyperbolic
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Title not available (Why is that?)
- Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze
- Title not available (Why is that?)
- Scaled Gromov hyperbolic graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- Bochner's method for cell complexes and combinatorial Ricci curvature
- Geodesics and almost geodesic cycles in random regular graphs
- Algorithms and Computation
- On the complexity of Newman's community finding approach for biological and social networks
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Title not available (Why is that?)
- Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random Graphs
- Scaled Gromov four-point condition for network graph curvature computation
- Title not available (Why is that?)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- Forman-Ricci flow for change detection in large dynamic data sets
- Sequential change‐point detection based on direct density‐ratio estimation
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
Cited In (1)
This page was built for publication: A review of two network curvature measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1982207)