The Structure of a Random Graph at the Point of the Phase Transition
From MaRDI portal
Publication:4286806
DOI10.2307/2154580zbMath0807.05065OpenAlexW4245939262MaRDI QIDQ4286806
Tomasz Łuczak, John C. Wierman, Boris G. Pittel
Publication date: 2 March 1995
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2154580
phase transitionlimiting distributionplanar graphrandom graphthreshold functionplanarity probabilities
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
The critical window in random digraphs, Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, The critical mean-field Chayes–Machta dynamics, An elementary approach to component sizes in critical random graphs, Phase transition phenomena in random discrete structures, The scaling window for a random graph with a given degree sequence, Brownian excursions, critical random graphs and the multiplicative coalescent, The number of connected sparsely edged uniform hypergraphs, The random-cluster model on the complete graph, The genus of the Erd\H{o}s-R\'enyi random graph and the fragile genus property, Random graph asymptotics on high-dimensional tori, Concentration of maximum degree in random planar graphs, The convergence of the exploration process for critical percolation on the \(k\)-out graph, Prime and primary ideals in semirings., A probabilistic approach to the leader problem in random graphs, Longest and shortest cycles in random planar graphs, Cycle structure of percolation on high-dimensional tori, Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, The continuum limit of critical random graphs, Parking on Cayley trees and frozen Erdős-Rényi, Noise sensitivity of critical random graphs, Unlacing hypercube percolation: a survey, Phase transitions in graphs on orientable surfaces, Characterisations and examples of graph classes with bounded expansion, Critical random graphs: Diameter and mixing time, Edge percolation on a random regular graph of low degree, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, Continuum limit of critical inhomogeneous random graphs, Hypercube percolation, Cluster tails for critical power-law inhomogeneous random graphs, The critical random graph, with martingales, The critical behavior of random digraphs, Critical random graphs and the structure of a minimum spanning tree, Minors in random regular graphs, A phase transition in the random transposition random walk, Anatomy of the giant component: the strictly supercritical regime, Critical epidemics, random graphs, and Brownian motion with a parabolic drift, The probability of unusually large components in the near-critical Erdős–Rényi graph, Expansion of Percolation Critical Points for Hamming Graphs, Small Subgraphs in Random Distance Graphs, Anatomy of a young giant component in the random graph, The order of the largest complete minor in a random graph, Component structure of the configuration model: Barely supercritical case, Two critical periods in the evolution of random planar graphs, Critical behavior in inhomogeneous random graphs, On the probability of planarity of a random graph near the critical point, On a random graph evolving by degrees, Tree and forest weights and their application to nonuniform random graphs, On the largest component of the random graph at a nearcritical stage, A Tipping Point for the Planarity of Small and Medium Sized Graphs, Critical percolation on random regular graphs
