A review of two network curvature measures
From MaRDI portal
Publication:1982207
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
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1334601 (Why is no real title available?)
- scientific article; zbMATH DE number 1354819 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 862499 (Why is no real title available?)
- scientific article; zbMATH DE number 918572 (Why is no real title available?)
- A Panoramic View of Riemannian Geometry
- A visual introduction to Riemannian curvatures and some discrete generalizations
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Algorithms and Computation
- Bochner's method for cell complexes and combinatorial Ricci curvature
- Community structure in social and biological networks
- Computing the Gromov hyperbolicity of a discrete metric space
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- Euclidean versus hyperbolic congestion in idealized versus experimental networks
- Expanders are not hyperbolic
- Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths
- Fast approximation and exact computation of negative curvature parameters of graphs
- Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze
- Forman-Ricci flow for change detection in large dynamic data sets
- Geodesics and almost geodesic cycles in random regular graphs
- Graph minors. I. Excluding a forest
- Introduction to algorithms
- Lack of hyperbolicity in asymptotic Erdős-Renyi sparse random graphs
- Multiplying matrices faster than coppersmith-winograd
- Networks. An introduction.
- On the complexity of Newman's community finding approach for biological and social networks
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Scaled Gromov four-point condition for network graph curvature computation
- Scaled Gromov hyperbolic graphs
- Sequential change‐point detection based on direct density‐ratio estimation
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
Cited in
(4)
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)