A new approach to the giant component problem
From MaRDI portal
Publication:3619612
DOI10.1002/rsa.20231zbMath1177.05110arXiv0707.1786OpenAlexW2951845073MaRDI QIDQ3619612
Svante Janson, Malwina J. Luczak
Publication date: 8 April 2009
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.1786
Related Items
Rare event asymptotics for exploration processes for random graphs, Depth first exploration of a configuration model, The tail does not determine the size of the giant, A functional central limit theorem for SI processes on configuration model graphs, The scaling window for a random graph with a given degree sequence, Chase-escape on the configuration model, The structure of typical clusters in large sparse random configurations, Critical percolation on scale-free random graphs: new universality class for the configuration model, Universality for critical heavy-tailed network models: metric structure of maximal components, When is a scale-free graph ultra-small?, Phase transition in random intersection graphs with communities, Locality of random digraphs on expanders, Metastability of the Potts ferromagnet on random regular graphs, Largest component of subcritical random graphs with given degree sequence, Diffusion and cascading behavior in random networks, Critical Window for Connectivity in the Configuration Model, Random graphs with given vertex degrees and switchings, First passage percolation on random graphs with finite mean degrees, Asymptotic normality in random graphs with given vertex degrees, Unnamed Item, The component sizes of a critical random graph with given degree sequence, Ising critical exponents on random trees and graphs, A weighted configuration model and inhomogeneous epidemics, Percolation on complex networks: theory and application, The largest component in a subcritical random graph with a power law degree distribution, Preferential attachment without vertex growth: emergence of the giant component, Critical random graphs and the differential equations technique, How to determine if a random graph with a fixed degree sequence has a giant component, Near-critical SIR epidemic on a random graph with given degrees, Weighted distances in scale-free configuration models, Giant Component in Random Multipartite Graphs with Given Degree Sequences, Nonuniversality of weighted random graphs with infinite variance degree, Number of edges in inhomogeneous random graphs, Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs, Birds of a feather or opposites attract - effects in network modelling, First passage percolation on sparse random graphs with boundary weights, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, Component structure of the configuration model: Barely supercritical case, Critical behavior in inhomogeneous random graphs, Global lower mass-bound for critical configuration models in the heavy-tailed regime, The front of the epidemic spread and first passage percolation, A general critical condition for the emergence of a giant component in random graphs with given degrees, Critical window for the vacant set left by random walk on random regular graphs, Law of large numbers for the SIR epidemic on a random graph with given degrees, The diameter of weighted random graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, An old approach to the giant component problem, Percolation on Random Graphs with a Fixed Degree Sequence, On local weak limit and subgraph counts for sparse random graphs
Cites Work
- Unnamed Item
- Generating simple random graphs with prescribed degree distribution
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
- Asymptotic normality of the \(k\)-core in random graphs
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Logarithmic combinatorial structures: A probabilistic approach
- Random subgraphs of the 2D Hamming graph: The supercritical phase
- On the Fluctuations of the Giant Component
- Critical percolation on random regular graphs
- Random graphs with forbidden vertex degrees
- A simple solution to the k‐core problem
- Local Limit Theorems for the Giant Component of Random Hypergraphs
- On tree census and the giant component in sparse random graphs
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- Probability: A Graduate Course
- A critical point for random graphs with a given degree sequence
- The birth of the giant component
- The phase transition in inhomogeneous random graphs
- Graphs with specified degree distributions, simple epidemics, and local vaccination strategies
- The Critical Phase for Random Graphs with a Given Degree Sequence
