Geometric inhomogeneous random graphs

DOI10.1016/j.tcs.2018.08.014zbMath1414.05264arXiv1511.00576OpenAlexW2964263237MaRDI QIDQ1713405

Karl Bringmann, Johannes Lengler, Ralph Keusch

Publication date: 25 January 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

compression algorithmsclustering coefficientrandom graph modelsreal-world networkssampling algorithmshyperbolic random graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (29)

Graph distances in scale-free percolation: the logarithmic case ⋮ Not all interventions are equal for the height of the second peak ⋮ Transience Versus Recurrence for Scale-Free Spatial Networks ⋮ Recurrence versus transience for weight-dependent random connection models ⋮ Spectral gap of random hyperbolic graphs and related parameters ⋮ Ollivier curvature of random geometric graphs converges to Ricci curvature of their Riemannian manifolds ⋮ The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects ⋮ A random graph model for clustering graphs ⋮ The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Local limits of spatial inhomogeneous random graphs ⋮ On the distances within cliques in a soft random geometric graph ⋮ Scaling of the clustering function in spatial inhomogeneous random graphs ⋮ Scale-free percolation mixing time ⋮ Scale-free graphs with many edges ⋮ Greed is good for deterministic scale-free networks ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Popularity-similarity random SAT formulas ⋮ The contact process on random hyperbolic graphs: metastability and critical exponents ⋮ Unnamed Item ⋮ Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ⋮ Scale-free percolation in continuous space: quenched degree and clustering coefficient ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Phase transitions and percolation at criticality in enhanced random connection models ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ Detecting a botnet in a network ⋮ On the Second Largest Component of Random Hyperbolic Graphs ⋮ Networks of random trees as a model of neuronal connectivity

Uses Software

• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scale-free percolation
• Cliques in hyperbolic random graphs
• Bootstrap percolation and the geometry of complex networks
• Grid methods in simulation and random variate generation
• Structures in supercritical scale-free percolation
• Connected components in random graphs with given expected degree sequences
• An approximation theorem for the Poisson binomial distribution
• A Spatial Preferential Attachment Model with Local Clustering
• Clustering and the Hyperbolic Geometry of Complex Networks
• Efficient Generation of Networks with Given Expected Degrees
• The Geometric Protean Model for On-Line Social Networks
• The Structure of Geographical Threshold Graphs
• A Spatial Web Graph Model with Local Influence Regions
• Emergence of Scaling in Random Networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• Typical distances in a geometric model for complex networks
• On the Diameter of Hyperbolic Random Graphs
• Generating Random Hyperbolic Graphs in Subquadratic Time
• Random Geometric Graphs
• Bootstrap percolation on geometric inhomogeneous random graphs
• Hyperbolic Random Graphs: Separators and Treewidth
• Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
• On a geometrization of the Chung–Lu model for complex networks
• Models for the Compressible Web
• A Bound for the Diameter of Random Hyperbolic Graphs
• The phase transition in inhomogeneous random graphs
• Exact and Efficient Generation of Geometric Random Variates and Random Graphs
• Greedy Routing and the Algorithmic Small-World Phenomenon
• The average distances in random graphs with given expected degrees
• On a conditionally Poissonian graph process

This page was built for publication: Geometric inhomogeneous random graphs