Critical behavior in inhomogeneous random graphs
From MaRDI portal
Publication:2841680
DOI10.1002/rsa.20450zbMath1269.05101arXiv0902.0216MaRDI QIDQ2841680
Publication date: 26 July 2013
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.0216
critical behavior; scaling window; power-law degree sequences; novel scaling behavior; rank-1 inhomogeneous random graphs
05C80: Random graphs (graph-theoretic aspects)
Related Items
Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees, An elementary approach to component sizes in critical random graphs, A PROBABILISTIC FRIENDSHIP NETWORK MODEL, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, The Phase Transition in Multitype Binomial Random Graphs, The Interpolation Method for Random Graphs with Prescribed Degrees, Using the bootstrap for statistical inference on random graphs, A large-deviations principle for all the components in a sparse inhomogeneous random graph, A probabilistic approach to the leader problem in random graphs, Stable graphs: distributions and line-breaking construction, The densest subgraph problem in sparse random graphs, Scale-free property for degrees and weights in an \(N\)-interactions random graph model, Scale-free percolation, The component sizes of a critical random graph with given degree sequence, Large deviation principles for empirical measures of colored random graphs, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Continuum limit of critical inhomogeneous random graphs, Novel scaling limits for critical inhomogeneous random graphs, On the instability of matching queues, The degree analysis of an inhomogeneous growing network with two types of vertices, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, Evolution of a modified binomial random graph by agglomeration, Cluster tails for critical power-law inhomogeneous random graphs, Number of edges in inhomogeneous random graphs, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Limitations of Chung Lu random graph generation, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Universality for critical heavy-tailed network models: metric structure of maximal components, Viral processes by random walks on random regular graphs, Eigenvalues outside the bulk of inhomogeneous Erdős-Rényi random graphs, Some Introductory Notes on Random Graphs
Cites Work
- Unnamed Item
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- Generating simple random graphs with prescribed degree distribution
- Random graph asymptotics on high-dimensional tori
- The largest component in a subcritical random graph with a power law degree distribution
- Brownian excursions, critical random graphs and the multiplicative coalescent
- On the largest component of the random graph at a nearcritical stage
- Connected components in random graphs with given expected degree sequences
- Random subgraphs of the 2D Hamming graph: The supercritical phase
- The Phase Transition in the Configuration Model
- Asymptotic equivalence and contiguity of some random graphs
- The Largest Component in Subcritical Inhomogeneous Random Graphs
- An Elementary Proof of the Hitting Time Theorem
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- A new approach to the giant component problem
- The Evolution of Random Graphs
- The Structure of a Random Graph at the Point of the Phase Transition
- The Average Distance in a Random Graph with Given Expected Degrees
- A critical point for random graphs with a given degree sequence
- The birth of the giant component
- The phase transition in inhomogeneous random graphs
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- The Critical Phase for Random Graphs with a Given Degree Sequence
- On a conditionally Poissonian graph process
- The total progeny in a branching process and a related random walk
- The Multiplicative Process