scientific article; zbMATH DE number 2042286

zbMATH Open1037.60008MaRDI QIDQ4450065FDOQ4450065

Authors: David Aldous, J. Michael Steele 

Publication date: 15 February 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1839489
• Maximum Weight Partial Colorings on Sparse Random Graphs
• Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method

zbMATH Keywords

local weak convergenceobjective methodgeometric random graphsPoisson weighted infinite treeprobabilistic combinatorial optimizationrandom tees with random edge weights

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Combinatorial probability (60C05)

Cited In (only showing first 100 items - show all)

• Singularity of the \(k\)-core of a random graph
• On local weak limit and subgraph counts for sparse random graphs
• Spectra of large random trees
• The densest subgraph problem in sparse random graphs
• The number of accessible paths in the hypercube
• Matchings on infinite graphs
• Weak disorder in the stochastic mean-field model of distance. II
• Solution of the monomer-dimer model on locally tree-like graphs. Rigorous results
• Belief propagation for optimal edge cover in the random complete graph
• A survey of max-type recursive distributional equations
• Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics
• Planar stochastic hyperbolic triangulations
• Weak disorder asymptotics in the stochastic mean-field model of distance
• The functional equation of the smoothing transform
• Ising models on locally tree-like graphs
• Replica symmetry of the minimum matching
• Invasion percolation on the Poisson-weighted infinite tree
• Local convergence of random graph colorings
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Distributionally robust mixed integer linear programs: persistency models with applications
• Random infinite squarings of rectangles
• Endogeny for the logistic recursive distributional equation
• Around the circular law
• The mean field traveling salesman and related problems
• Factor models on locally tree-like graphs
• Laws of large numbers in stochastic geometry with statistical applications
• Near-minimal spanning trees: A scaling exponent in probability models
• Gaussian limits for random measures in geometric probability
• The minimal spanning tree and the upper box dimension
• Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
• Recurrence of planar graph limits
• Lévy-Khintchine random matrices and the Poisson weighted infinite skeleton tree
• Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Cutting down trees with a Markov chainsaw
• Mean-field monomer-dimer models. A review
• Percolations on random maps. I: Half-plane models
• Minimal spanning forests
• The limiting distributions of large heavy Wigner and arbitrary random matrices
• Ising models on power-law random graphs
• On the phase transition in random simplicial complexes
• Continuous approximation formulas for location problems
• Spectrum of non-Hermitian heavy tailed random matrices
• Interacting particle systems as stochastic social dynamics
• Frozen percolation on the binary tree is nonendogenous
• The weak limit of Ising models on locally tree-like graphs
• Spectrum of large random reversible Markov chains: heavy-tailed weights on the complete graph
• The measurable Kesten theorem
• The set of solutions of random XORSAT formulae
• The rank of diluted random graphs
• Majority dynamics on trees and the dynamic cavity method
• Gibbs measures and phase transitions on sparse random graphs
• A stochastic complex network model
• Connectivity of random geometric graphs related to minimal spanning forests
• Poisson-Dirichlet branching random walks
• Extinction window of mean field branching annihilating random walk
• Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
• A conversation with David J. Aldous
• A critical branching process model for biodiversity
• Invariance, quasi-invariance, and unimodularity for random graphs
• On the connectivity threshold for general uniform metric spaces
• Explosion and linear transit times in infinite trees
• A new approach to the orientation of random hypergraphs
• On the limit of large girth graph sequences
• Emergence of extended states at zero in the spectrum of sparse random graphs
• Maximum independent sets on random regular graphs
• Pagerank asymptotics on directed preferential attachment networks
• Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
• Local picture and level-set percolation of the Gaussian free field on a large discrete torus
• Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
• Local convergence for permutations and local limits for uniform \(\rho \)-avoiding permutations with \(|\rho |=3\)
• A fractal dimension for measures via persistent homology
• Interacting diffusions on sparse graphs: hydrodynamics from local weak limits
• Eternal family trees and dynamics on unimodular random graphs
• Maxima and near-maxima of a Gaussian random assignment field
• Dynamic space efficient hashing
• On the expected total number of infections for virus spread on a finite network
• Eigenvector statistics of Lévy matrices
• Local neighbourhoods for first-passage percolation on the configuration model
• Limiting properties of random graph models with vertex and edge weights
• A framework for imperfectly observed networks
• Parking on a random rooted plane tree
• Optimal stationary markings
• Ground states for exponential random graphs
• The radial spanning tree of a Poisson point process
• Transitive graphs uniquely determined by their local structure
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Renewal sequences and record chains related to multiple zeta sums
• The smoothing transform: a review of contraction results
• Random simplicial complexes: around the phase transition
• Load balancing in hypergraphs
• Random intersection graphs with communities
• On the speed and spectrum of mean-field random walks among random conductances
• Scaling limits for width two partially ordered sets: the incomparability window
• Convergence of directed random graphs to the Poisson-weighted infinite tree
• Edge ideals of Erdős-Rényi random graphs: linear resolution, unmixedness and regularity
• First steps in combinatorial optimization on graphons: matchings
• Local weak convergence for sparse networks of interacting processes
• Asymptotic learning on Bayesian social networks
• The planted matching problem: phase transitions and exact results

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450065)