Generating simple random graphs with prescribed degree distribution

DOI10.1007/s10955-006-9168-xzbMath1106.05086arXiv1509.06985OpenAlexW2083750870MaRDI QIDQ858034

Tom Britton, Maria Deijfen, Anders Martin-Löf

Publication date: 5 January 2007

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

probability distributionconfiguration modelgenerating algorithms

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items

Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs, Phase transition in random intersection graphs with communities, Phase transitions in a power-law uniform hypergraph, Stochastic recursions on directed random graphs, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, The calculation and simulation of the price of anarchy for network formation games, Unnamed Item, Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks, Large deviations for power-law thinned Lévy processes, Affiliation weighted networks with a differentially private degree sequence, Exactly scale-free scale-free networks, Strong couplings for static locally tree-like random graphs, Large deviations in generalized random graphs with node weights, The tail does not determine the size of the giant, A preferential attachment model with random initial degrees, Random Simplicial Complexes: Models and Phenomena, Minimum vertex cover in generalized random graphs with power law degree distribution, Scale-free network clustering in hyperbolic and other random graphs, Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence, The structure of typical clusters in large sparse random configurations, Central limit type theorems in the generalized random graphs with random vertex weights, Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence, Asymptotic in the ordered networks with a noisy degree sequence, MAX \(\kappa\)-cut and the inhomogeneous Potts spin Glass, Asymptotic in undirected random graph models with a noisy degree sequence, Large deviations for empirical measures of generalized random graphs, Scale-free percolation, Model hierarchies in edge-based compartmental modeling for infectious disease spread, Local weak convergence for PageRank, Universality for critical heavy-tailed network models: metric structure of maximal components, Asymptotics for cliques in scale-free random graphs, Inhomogeneous long-range percolation on the hierarchical lattice, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, Systemic cascades on inhomogeneous random financial networks, The configuration model for partially directed graphs, A new coupled disease-awareness spreading model with mass media on multiplex networks, Sparse Graphs Using Exchangeable Random Measures, Respondent-driven sampling on directed networks, Random graphs with given vertex degrees and switchings, A novel fault diagnosis mechanism for wireless sensor networks, Asymptotic normality in random graphs with given vertex degrees, Constructing and sampling directed graphs with given degree sequences, The component sizes of a critical random graph with given degree sequence, Ising critical exponents on random trees and graphs, Limit laws in the generalized random graphs with random vertex weights, Modelling sexually transmitted infections: the effect of partnership activity and number of partners on \(R_0\), Diffusion in Random Networks: Impact of Degree Distribution, The largest component in a subcritical random graph with a power law degree distribution, Asymptotic distributions in affiliation networks with an increasing sequence, Exact sampling of graphs with prescribed degree correlations, PageRank on inhomogeneous random digraphs, Optimal subgraph structures in scale-free configuration models, PageRank's behavior under degree correlations, Evolution of a modified binomial random graph by agglomeration, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Continuum limit of critical inhomogeneous random graphs, Recent advances in percolation theory and its applications, Bounding basic characteristics of spatial epidemics with a new percolation model, Cluster tails for critical power-law inhomogeneous random graphs, A note on dynamical models on random graphs and Fokker-Planck equations, Networks, epidemics and vaccination through contact tracing, General results on preferential attachment and clustering coefficient, Universality for the distance in finite variance random graphs, Triadic closure in configuration models with unbounded degree fluctuations, Large deviations for the annealed Ising model on inhomogeneous random graphs: spins and degrees, Spectral based hypothesis testing for community detection in complex networks, Counting cliques and cycles in scale-free inhomogeneous random graphs, Percolation in invariant Poisson graphs with i.i.d. degrees, A note on the derivation of epidemic final sizes, Novel scaling limits for critical inhomogeneous random graphs, Non-Hyperbolicity of Random Graphs with Given Expected Degrees, Asymptotic equivalence and contiguity of some random graphs, Graphs with specified degree distributions, simple epidemics, and local vaccination strategies, Cliques in rank-1 random graphs: the role of inhomogeneity, Coupling of Two SIR Epidemic Models with Variable Susceptibilities and Infectivities, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Modelling the spread of diseases in clustered networks, Large Cliques in a Power-Law Random Graph, Subgraphs in preferential attachment models, The Largest Component in Subcritical Inhomogeneous Random Graphs, Number of edges in inhomogeneous random graphs, Detecting a planted community in an inhomogeneous random graph, A new approach to the giant component problem, Universality for distances in power-law random graphs, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, Birds of a feather or opposites attract - effects in network modelling, Limit laws for the number of triangles in the generalized random graphs with random node weights, Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees, RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?, Structural sparsity of complex networks: bounded expansion in random models and real-world graphs, Degree correlations in scale-free random graph models, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Component structure of the configuration model: Barely supercritical case, Critical behavior in inhomogeneous random graphs, Directed random graphs with given degree distributions, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Counting triangles in power-law uniform random graphs, Limitations of Chung Lu random graph generation, Limit theorems for assortativity and clustering in null models for scale-free networks, Limit laws for self-loops and multiple edges in the configuration model, Global Clustering Coefficient in Scale-Free Weighted and Unweighted Networks, The Phase Transition in Multitype Binomial Random Graphs, Random intersection graphs with communities, Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs, First Passage Percolation on Inhomogeneous Random Graphs, Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• Connected components in random graphs with given expected degree sequences
• Emergence of Scaling in Random Networks
• Uniform generation of random regular graphs of moderate degree
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• The average distances in random graphs with given expected degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item