scientific article; zbMATH DE number 5205673

zbMath1130.05053arXivmath/0610466MaRDI QIDQ5422650

Asaf Nachmias, Yuval Peres

Publication date: 29 October 2007

Full work available at URL: https://arxiv.org/abs/math/0610466

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

large deviationsindependent incrementsStochastically bounded processes

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (15)

Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ The scaling window for a random graph with a given degree sequence ⋮ The largest component in critical random intersection graphs ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Mixing time of near-critical random graphs ⋮ Exploring hypergraphs with martingales ⋮ Aggregation models with limited choice and the multiplicative coalescent ⋮ Critical percolation on random regular graphs ⋮ Central limit theorem for statistics of subcritical configuration models ⋮ A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics ⋮ Size of the largest component in a critical graph ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ Expansion of Percolation Critical Points for Hamming Graphs ⋮ Asymptotic normality of the size of the giant component via a random walk ⋮ Asymptotic normality of the size of the giant component in a random hypergraph

This page was built for publication: