Brownian excursions, critical random graphs and the multiplicative coalescent

From MaRDI portal

Publication:1356369

Jump to:navigation, search

DOI10.1214/aop/1024404421zbMath0877.60010OpenAlexW2056513564MaRDI QIDQ1356369

David J. Aldous

Publication date: 7 December 1997

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1024404421

zbMATH Keywords

Brownian excursions critical random graphs multiplicative coalescent breadth-first walk largest components

Mathematics Subject Classification ID

Brownian motion (60J65) Combinatorial probability (60C05) Boundary theory for Markov processes (60J50)

Related Items

Convergence of blanket times for sequences of random walks on critical random graphs, The distribution of the number of automorphisms of random trees, The scaling limit of a critical random directed graph, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, The birth of the strong components, Stable graphs: distributions and line-breaking construction, Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Eternal additive coalescents and certain bridges with exchangeable increments, A classification of coalescent processes for haploid exchangeable population models, A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0, Large deviations for power-law thinned Lévy processes, Exceptional times of the critical dynamical Erdős-Rényi graph, The critical window in random digraphs, Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems, A representation of exchangeable hierarchies by sampling from random real trees, Rare event asymptotics for exploration processes for random graphs, Mesoscopic scales in hierarchical configuration models, Depth first exploration of a configuration model, A new encoding of coalescent processes: applications to the additive and multiplicative cases, The structure of typical clusters in large sparse random configurations, Spatial epidemics: Critical behavior in one dimension, Critical percolation on scale-free random graphs: new universality class for the configuration model, Scale-free percolation, Random graph asymptotics on high-dimensional tori, Universality for critical heavy-tailed network models: metric structure of maximal components, The convergence of the exploration process for critical percolation on the \(k\)-out graph, A probabilistic approach to the leader problem in random graphs, The giant component after percolation of product graphs, A large‐deviations principle for all the cluster sizes of a sparse Erdős–Rényi graph, Cycle structure of percolation on high-dimensional tori, Heavy-Traffic Analysis Through Uniform Acceleration of Queues with Diminishing Populations, The continuum limit of critical random graphs, Sparse Graphs Using Exchangeable Random Measures, On some stochastic coalescents, Burning cars in a parking lot, Scaling limit for the random walk on the largest connected component of the critical random graph, Noise sensitivity of critical random graphs, Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time, Parabolic Anderson model on critical Galton-Watson trees in a Pareto environment, A phase transition for measure-valued SIR epidemic processes, Unlacing hypercube percolation: a survey, Phase transitions in graphs on orientable surfaces, Feller property of the multiplicative coalescent with linear deletion, The weak convergence of regenerative processes using some excursion path decompositions, The component sizes of a critical random graph with given degree sequence, Scaling Limits of Random Trees and Random Graphs, Big Jobs Arrive Early: From Critical Queues to Random Graphs, Heavy-tailed configuration models at criticality, Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs, Network models: structure and function. Abstracts from the workshop held December 10--16, 2017, The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs, A new combinatorial representation of the additive coalescent, Critical random graphs: Diameter and mixing time, Critical random graphs and the differential equations technique, The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs, A moment-generating formula for Erdős-Rényi component sizes, On the critical probability in percolation, Continuum limit of critical inhomogeneous random graphs, Hypercube percolation, Finite size scaling for the core of large random hypergraphs, Cluster tails for critical power-law inhomogeneous random graphs, Asymptotics of trees with a prescribed degree sequence and applications, The size of the giant component in random hypergraphs: a short proof, Novel scaling limits for critical inhomogeneous random graphs, Exploring hypergraphs with martingales, Aggregation models with limited choice and the multiplicative coalescent, Spatial epidemics and local times for critical branching random walks in dimensions 2 and 3, Critical random forests, The critical random graph, with martingales, Stochastic processes in random graphs, Critical scaling for the SIS stochastic epidemic, Critical random graphs and the structure of a minimum spanning tree, Critical percolation on random regular graphs, A phase transition in the random transposition random walk, Finite-pool queueing with heavy-tailed services, Survey of Scalings for the Largest Connected Component in Inhomogeneous Random Graphs, Anatomy of the giant component: the strictly supercritical regime, Stochastic coalescence with homogeneous-like interaction rates, Geometry of the minimal spanning tree of a random 3-regular graph, A new approach to the giant component problem, Critical epidemics, random graphs, and Brownian motion with a parabolic drift, Stochastic block model in a new critical regime and the interacting multiplicative coalescent, Susceptibility in subcritical random graphs, The probability of unusually large components in the near-critical Erdős–Rényi graph, Speeding up non-Markovian first-passage percolation with a few extra edges, Expansion of Percolation Critical Points for Hamming Graphs, A geometric representation of fragmentation processes on stable trees, Anatomy of a young giant component in the random graph, Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems, Asymptotic normality of the size of the giant component via a random walk, Coalescent random forests, Component structure of the configuration model: Barely supercritical case, Critical behavior in inhomogeneous random graphs, Bounded-Size Rules: The Barely Subcritical Regime, The eternal multiplicative coalescent encoding via excursions of Lévy-type processes, Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs, Critical random hypergraphs: the emergence of a giant set of identifiable vertices, A conversation with David J. Aldous, On the largest component of the random graph at a nearcritical stage, The standard additive coalescent, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1., Anomalous Behavior of Random Walks on Disordered Media, Asymptotic normality of the size of the giant component in a random hypergraph, A queueing model with independent arrivals, and its fluid and diffusion limits, Universal finite-size scaling for percolation theory in high dimensions

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1356369&oldid=13494987"