Clustering in a hyperbolic model of complex networks

DOI10.1214/21-EJP583zbMath1468.05276arXiv2003.05525OpenAlexW3121391808WikidataQ115517660 ScholiaQ115517660MaRDI QIDQ2042742

Nikolaos Fountoulakis, Markus Schepers, Tobias Müller, Pim Van der Hoorn

Publication date: 21 July 2021

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.05525

zbMATH Keywords

clusteringrandom graphshyperbolic random graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)

Related Items

Assortativity and bidegree distributions on Bernoulli random graph superpositions, Sub-tree counts on hyperbolic random geometric graphs, Beta-star polytopes and hyperbolic stochastic geometry, Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry, Local limits of spatial inhomogeneous random graphs, Clustering and percolation on superpositions of Bernoulli random graphs, Intersections of Poisson \(k\)-flats in constant curvature spaces, The directed spanning forest in the hyperbolic space, Scaling of the clustering function in spatial inhomogeneous random graphs, Large nearest neighbour balls in hyperbolic stochastic geometry, On the largest component of subcritical random hyperbolic graphs

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the largest component of a hyperbolic model of complex networks
• Cliques in hyperbolic random graphs
• Bootstrap percolation and the geometry of complex networks
• Spectral gap of random hyperbolic graphs and related parameters
• Law of large numbers for the largest component in a hyperbolic model of complex networks
• The probability of connectivity in a hyperbolic model of complex networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• Note on Stirling's Formula
• Typical distances in a geometric model for complex networks
• Random Geometric Graphs
• On the Diameter of Hyperbolic Random Graphs
• On a geometrization of the Chung–Lu model for complex networks
• An Elementary Proof of Stirling's Formula
• Poincaré and the early history of 3-manifolds
• Scale-free network clustering in hyperbolic and other random graphs
• A Bound for the Diameter of Random Hyperbolic Graphs
• The diameter of KPKVB random graphs
• On the Second Largest Component of Random Hyperbolic Graphs
• Lectures on the Poisson Process
• Stirling’s Formula and Its Extension for the Gamma Function
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations