The phase transition in inhomogeneous random graphs

DOI10.1002/rsa.20168zbMath1123.05083arXivmath/0504589OpenAlexW2950850272WikidataQ105583236 ScholiaQ105583236MaRDI QIDQ5310264

Oliver Riordan, Svante Janson, Béla Bollobás

Publication date: 21 September 2007

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionbranching processgiant componentsparse inhomogeneous random graphs

Mathematics Subject Classification ID

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

Related Items (only showing first 100 items - show all)

Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions ⋮ Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph ⋮ An elementary approach to component sizes in critical random graphs ⋮ Strong couplings for static locally tree-like random graphs ⋮ Assortativity and bidegree distributions on Bernoulli random graph superpositions ⋮ Random Simplicial Complexes: Models and Phenomena ⋮ Large deviation analysis for layered percolation problems on the complete graph ⋮ Inhomogeneous Financial Networks and Contagious Links ⋮ The scaling window for a random graph with a given degree sequence ⋮ Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks ⋮ The structure of typical clusters in large sparse random configurations ⋮ The evolution of subcritical Achlioptas processes ⋮ Cooperative epidemics spreading under resource control ⋮ Generating hierarchial scale-free graphs from fractals ⋮ The mixing time of the giant component of a random graph ⋮ Connectivity of inhomogeneous random graphs ⋮ Large deviations for empirical measures of generalized random graphs ⋮ Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs ⋮ Nonparametric statistics of dynamic networks with distinguishable nodes ⋮ A Dynamic Contagion Risk Model with Recovery Features ⋮ Continuous spin models on annealed generalized random graphs ⋮ Sombor index and degree-related properties of simplicial networks ⋮ Asymptotics for cliques in scale-free random graphs ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ Perfect matchings in inhomogeneous random bipartite graphs in random environment ⋮ Poisson approximation of subgraph counts in stochastic block models and a graphon model ⋮ Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ Unnamed Item ⋮ Continuum limit of the nonlocal p-Laplacian evolution problem on random inhomogeneous graphs ⋮ Thresholds for virus spread on networks ⋮ A nonparametric view of network models and Newman–Girvan and other modularities ⋮ Spectral redemption in clustering sparse networks ⋮ Dismantling Sparse Random Graphs ⋮ Systemic cascades on inhomogeneous random financial networks ⋮ Sparse Graphs Using Exchangeable Random Measures ⋮ Mean-field BSDEs with jumps and dual representation for global risk measures ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Subcritical Random Hypergraphs, High-Order Components, and Hypertrees ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ Limit laws in the generalized random graphs with random vertex weights ⋮ Epidemics on random intersection graphs ⋮ Big Jobs Arrive Early: From Critical Queues to Random Graphs ⋮ Sparse random graphs with clustering ⋮ Maximizing the Size of the Giant ⋮ Line-of-Sight Percolation ⋮ Unnamed Item ⋮ Diameters in Supercritical Random Graphs Via First Passage Percolation ⋮ The Diameter of Sparse Random Graphs ⋮ Bounding basic characteristics of spatial epidemics with a new percolation model ⋮ Sparse exchangeable graphs and their limits via graphon processes ⋮ Community Detection and Stochastic Block Models ⋮ Statistical inference on random dot product graphs: a survey ⋮ Aggregation models with limited choice and the multiplicative coalescent ⋮ Clique percolation ⋮ Asymptotic equivalence and contiguity of some random graphs ⋮ Merging percolation onZdand classical random graphs: Phase transition ⋮ Giant Component in Random Multipartite Graphs with Given Degree Sequences ⋮ Small-world graphs: characterization and alternative constructions ⋮ Phase transition in random distance graphs on the torus ⋮ Inhomogeneous random graphs, isolated vertices, and Poisson approximation ⋮ Sparse graphs: Metrics and random models ⋮ Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs ⋮ Large Cliques in a Power-Law Random Graph ⋮ Random Networks with Preferential Growth and Vertex Death ⋮ Ramsey games with giants ⋮ The Largest Component in Subcritical Inhomogeneous Random Graphs ⋮ Evolution of social networks ⋮ A new approach to the giant component problem ⋮ SIR epidemics on a scale-free spatial nested modular network ⋮ Universality for distances in power-law random graphs ⋮ Spectral bounds in random graphs applied to spreading phenomena and percolation ⋮ Generalized quasirandom properties of expanding graph sequences ⋮ Managing Default Contagion in Inhomogeneous Financial Networks ⋮ Birds of a feather or opposites attract - effects in network modelling ⋮ Typical distances in a geometric model for complex networks ⋮ The shortest distance in random multi-type intersection graphs ⋮ Duality in inhomogeneous random graphs, and the cut metric ⋮ Optimal graphon estimation in cut distance ⋮ RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING ⋮ Bootstrap percolation in directed inhomogeneous random graphs ⋮ Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities ⋮ Analysis of spectral clustering algorithms for community detection: the general bipartite setting ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs ⋮ Ruin probabilities for risk processes in a bipartite network ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models ⋮ A Dynamic Network in a Dynamic Population: Asymptotic Properties ⋮ Random Popular Matchings with Incomplete Preference Lists ⋮ Critical behavior in inhomogeneous random graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Large dicliques in a directed inhomogeneous random graph ⋮ Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs ⋮ The diameter of weighted random graphs ⋮ Analytic description of the phase transition of inhomogeneous multigraphs ⋮ Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1. ⋮ Linear embeddings of graphs and graph limits ⋮ An old approach to the giant component problem ⋮ Joint Vertex Degrees in the Inhomogeneous Random Graph Model ℊ(n,{p_ij})

Cites Work

• Limits of dense graph sequences
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Analyticity in infinite dimensional spaces
• Continuity of the percolation threshold in randomly grown graphs.
• Two phase transitions for the contact process on small worlds
• A Random Graph Model for Power Law Graphs
• Coupling Scale-Free and Classical Random Graphs
• Robustness and Vulnerability of Scale-Free Random Graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The phase transition in inhomogeneous random graphs