Sparse random graphs with clustering
From MaRDI portal
Publication:2998890
DOI10.1002/rsa.20322zbMath1220.05117arXiv0807.2040OpenAlexW3103002333MaRDI QIDQ2998890
Béla Bollobás, Svante Janson, Oliver Riordan
Publication date: 11 May 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.2040
Related Items
Networks beyond pairwise interactions: structure and dynamics, Random subcube intersection graphs. I: Cliques and covering, Unnamed Item, SIR epidemics and vaccination on random graphs with clustering, Clustering and percolation on superpositions of Bernoulli random graphs, Exactly solvable random graph ensemble with extensively many short cycles, Differential calculus on the space of countable labelled graphs, Epidemics on random intersection graphs, COMPOUND POISSON APPROXIMATION OF THE NUMBER DISTRIBUTION FOR MONOTONE STRINGS OF FIXED LENGTH IN A RANDOM SEQUENCE, Dynamic random networks in dynamic populations, Clustering and the Hyperbolic Geometry of Complex Networks, Phase transition of random non-uniform hypergraphs, Contagions in random networks with overlapping communities, The cut metric, random graphs, and branching processes, Bootstrapping on undirected binary networks via statistical mechanics, A Dynamic Network in a Dynamic Population: Asymptotic Properties, Spatial preferential attachment networks: power laws and clustering coefficients, On local weak limit and subgraph counts for sparse random graphs
Cites Work
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Standard representation of multivariate functions on a general probability space
- Quick approximation to matrices and applications
- Recurrence of distributional limits of finite planar graphs
- The diameter of a scale-free random graph
- Percolation on dense graph sequences
- Processes on unimodular random networks
- Asymptotic equivalence and contiguity of some random graphs
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Graph limits and exchangeable random graphs
- Robustness and Vulnerability of Scale-Free Random Graphs
- A general model of web graphs
- The phase transition in inhomogeneous random graphs
- Collective dynamics of ‘small-world’ networks
- Spread‐out percolation in ℝd
- The Small Giant Component in Scale-Free Random Graphs
- The cut metric, random graphs, and branching processes
