Minimal spanning trees and Stein's method
From MaRDI portal
Publication:2403137
DOI10.1214/16-AAP1239zbMath1371.60035arXiv1307.1661OpenAlexW2962904658MaRDI QIDQ2403137
Sourav Chatterjee, Sanchayan Sen
Publication date: 15 September 2017
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.1661
Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Trees (05C05) Extremal problems in graph theory (05C35) Convergence of probability measures (60B10)
Related Items (14)
The scaling limits of the minimal spanning tree and invasion percolation in the plane ⋮ A central limit theorem for the length of the longest common subsequences in random words ⋮ Vector-valued statistics of binomial processes: Berry-Esseen bounds in the convex distance ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Central limit theorems for the radial spanning tree ⋮ Malliavin-Stein method: a survey of some recent developments ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs ⋮ On the law of the iterated logarithm and strong invariance principles in stochastic geometry ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ Normal approximation on Poisson spaces: Mehler's formula, second order Poincaré inequalities and stabilization ⋮ Harry Kesten's work in probability theory ⋮ An upper bound on the two-arms exponent for critical percolation on \(\mathbb{Z}^d\) ⋮ Quantitative two-scale stabilization on the Poisson space ⋮ The Dickman–Goncharov distribution
This page was built for publication: Minimal spanning trees and Stein's method
