Sampling Geometric Inhomogeneous Random Graphs in Linear Time
From MaRDI portal
Publication:5111706
DOI10.4230/LIPICS.ESA.2017.20zbMATH Open1442.05204OpenAlexW2963760219MaRDI QIDQ5111706FDOQ5111706
Johannes Lengler, Karl Bringmann, Ralph Keusch
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#BringmannKL17
random graph modelsreal-world networkssampling algorithmscompression algorithmshyperbolic random graphs
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random Geometric Graphs
- Emergence of Scaling in Random Networks
- The phase transition in inhomogeneous random graphs
- Connected components in random graphs with given expected degree sequences
- The Average Distance in a Random Graph with Given Expected Degrees
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Scale-free percolation
- The Structure of Geographical Threshold Graphs
- On the Diameter of Hyperbolic Random Graphs
- A Bound for the Diameter of Random Hyperbolic Graphs
- The Geometric Protean Model for On-Line Social Networks
- A Spatial Web Graph Model with Local Influence Regions
- Clustering and the Hyperbolic Geometry of Complex Networks
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- Cliques in hyperbolic random graphs
- Bootstrap percolation and the geometry of complex networks
- Typical distances in a geometric model for complex networks
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- Generating Random Hyperbolic Graphs in Subquadratic Time
- Spectral gap of random hyperbolic graphs and related parameters
- Bootstrap percolation on geometric inhomogeneous random graphs
- When is a scale-free graph ultra-small?
- Structures in supercritical scale-free percolation
- A Spatial Preferential Attachment Model with Local Clustering
- Efficient Generation of Networks with Given Expected Degrees
- Hyperbolic Random Graphs: Separators and Treewidth
- Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
- Models for the Compressible Web
- Exact and Efficient Generation of Geometric Random Variates and Random Graphs
- Greedy Routing and the Algorithmic Small-World Phenomenon
Cited In (20)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- On the largest component of subcritical random hyperbolic graphs
- Scaling of the clustering function in spatial inhomogeneous random graphs
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning random points from geometric graphs or orderings
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Sampling Eulerian orientations of triangular lattice graphs
- On the Complexity of Sampling Vertices Uniformly from a Graph
- Uniform random sampling of planar graphs in linear time
- Greedy routing and the algorithmic small-world phenomenon
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- Not all interventions are equal for the height of the second peak
- Penalising transmission to hubs in scale-free spatial random graphs
- Degree correlations in scale-free random graph models
- Local limits of spatial inhomogeneous random graphs
- Greed is good for deterministic scale-free networks
Uses Software
This page was built for publication: Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111706)
