Publication:4450065

Publication date: 15 February 2004

local weak convergence; objective method; geometric random graphs; Poisson weighted infinite tree; probabilistic combinatorial optimization; random tees with random edge weights

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

05C35: Extremal problems in graph theory

60C05: Combinatorial probability

60-02: Research exposition (monographs, survey articles) pertaining to probability theory

Related Items

Lévy-Khintchine random matrices and the Poisson weighted infinite skeleton tree, Random Simplicial Complexes: Around the Phase Transition, Renewal sequences and record chains related to multiple zeta sums, A stochastic complex network model, Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests, The minimum perfect matching in pseudo-dimension 0 < q < 1, Random intersection graphs with communities, Tree convolution for probability distributions with unbounded support, The densest subgraph problem in sparse random graphs, The number of accessible paths in the hypercube, Distributionally robust mixed integer linear programs: persistency models with applications, Random infinite squarings of rectangles, The limiting distributions of large heavy Wigner and arbitrary random matrices, On the phase transition in random simplicial complexes, Interacting particle systems as stochastic social dynamics, Matchings on infinite graphs, Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results, Around the circular law, Replica symmetry of the minimum matching, Invasion percolation on the Poisson-weighted infinite tree, Cutting down trees with a Markov chainsaw, Belief propagation for optimal edge cover in the random complete graph, Invariance, quasi-invariance, and unimodularity for random graphs, Explosion and linear transit times in infinite trees, The rank of diluted random graphs, Endogeny for the logistic recursive distributional equation, A survey of max-type recursive distributional equations, Ising models on power-law random graphs, The mean field traveling salesman and related problems, Spectrum of non-Hermitian heavy tailed random matrices, On the limit of large girth graph sequences, Majority dynamics on trees and the dynamic cavity method, On the connectivity threshold for general uniform metric spaces, The weak limit of Ising models on locally tree-like graphs, The functional equation of the smoothing transform, Spectra of large random trees, Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph, Local convergence of random graph colorings, The measurable Kesten theorem, Near-minimal spanning trees: A scaling exponent in probability models, Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs, Planar stochastic hyperbolic triangulations, The set of solutions of random XORSAT formulae, Large deviations of empirical neighborhood distribution in sparse random graphs, Minimal spanning forests, Extinction window of mean field branching annihilating random walk, Ising models on locally tree-like graphs, Gibbs measures and phase transitions on sparse random graphs, The scaling limits of the minimal spanning tree and invasion percolation in the plane, Local neighbourhoods for first-passage percolation on the configuration model, Load balancing in hypergraphs, Limiting properties of random graph models with vertex and edge weights, Heavy subtrees of Galton-Watson trees with an application to Apollonian networks, Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality, A framework for imperfectly observed networks, Gaussian limits for random measures in geometric probability, Scaling limits for width two partially ordered sets: the incomparability window, Recurrence of planar graph limits, Poisson-Dirichlet branching random walks, Weak disorder in the stochastic mean-field model of distance. II, Dynamic space efficient hashing, Optimal stationary markings, Eigenvector statistics of Lévy matrices, Emergence of extended states at zero in the spectrum of sparse random graphs, Frozen percolation on the binary tree is nonendogenous, The planted matching problem: phase transitions and exact results, Unimodular Hausdorff and Minkowski dimensions, Spectrum of heavy-tailed elliptic random matrices, Pagerank asymptotics on directed preferential attachment networks, A conversation with David J. Aldous, On the speed and spectrum of mean-field random walks among random conductances, Stable matchings in high dimensions via the Poisson-weighted infinite tree, Local weak convergence for PageRank, Interacting diffusions on sparse graphs: hydrodynamics from local weak limits, Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics, Parking on a random rooted plane tree, Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs, Maxima and near-maxima of a Gaussian random assignment field, Local picture and level-set percolation of the Gaussian free field on a large discrete torus, Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\), On the expected total number of infections for virus spread on a finite network, Percolations on random maps. I: Half-plane models, Degree distribution of shortest path trees and bias of network sampling algorithms, Maximum independent sets on random regular graphs, Navigation on a Poisson point process, Weak disorder asymptotics in the stochastic mean-field model of distance, Factor models on locally tree-like graphs, Asymptotic learning on Bayesian social networks, Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality, The radial spanning tree of a Poisson point process, Laws of large numbers in stochastic geometry with statistical applications, Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group, Sparse expanders have negative curvature, Transitive graphs uniquely determined by their local structure, The Smoothing Transform: A Review of Contraction Results, Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty, Ground states for exponential random graphs, Convergence of directed random graphs to the Poisson-weighted infinite tree, Mean-Field Monomer-Dimer Models. A Review, The minimal spanning tree and the upper box dimension, Unnamed Item, Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem, Surprising identities for the greedy independent set on Cayley trees, Strong couplings for static locally tree-like random graphs, THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS, A Fractal Dimension for Measures via Persistent Homology, Covering a compact space by fixed-radius or growing random balls, Central limit theorem for statistics of subcritical configuration models, Parking on a Random Tree, Accessibility percolation on random rooted labeled trees, An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions, Eternal Family Trees and dynamics on unimodular random graphs, Shift-coupling of random rooted graphs and networks, Spectrum of large random Markov chains: Heavy-tailed weights on the oriented complete graph, Diameter of the Stochastic Mean-Field Model of Distance, ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES, A critical branching process model for biodiversity, Unnamed Item, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, A new approach to the orientation of random hypergraphs, Minimum weight disk triangulations and fillings, On local weak limit and subgraph counts for sparse random graphs, The rank of sparse random matrices, Singularity of the \(k\)-core of a random graph, Load Thresholds for Cuckoo Hashing with Overlapping Blocks, Local limits of spatial inhomogeneous random graphs, Law of large numbers for Betti numbers of homogeneous and spatially independent random simplicial complexes, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Continuous approximation formulas for location problems, Local weak convergence for sparse networks of interacting processes, Locality of random digraphs on expanders, General epidemiological models: law of large numbers and contact tracing, Multisource invasion percolation on the complete graph, Matching recovery threshold for correlated random graphs, A unified framework for generalizing the Gromov-Hausdorff metric, Edge ideals of Erdős-Rényi random graphs: linear resolution, unmixedness and regularity