On the critical probability in percolation
From MaRDI portal
Publication:1748902
Abstract: For percolation on finite transitive graphs, Nachmias and Peres suggested a characterization of the critical probability based on the logarithmic derivative of the susceptibility. As a first test-case, we study their suggestion for the ErdH{o}s-R'enyi random graph G_{n,p}, and confirm that the logarithmic derivative has the desired properties: (i) its maximizer lies inside the critical window p=1/n+Theta(n^{-4/3}), and (ii) the inverse of its maximum value coincides with the Theta(n^{-4/3})-width of the critical window. We also prove that the maximizer is not located at p=1/n or p=1/(n-1), refuting a speculation of Peres.
Recommendations
Cites work
- A note about critical percolation on finite graphs
- A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
- A power law of order 1/4 for critical mean field Swendsen-Wang dynamics
- Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Component behavior near the critical point of the random graph process
- Critical random graphs: Diameter and mixing time
- Enumerating graphs and Brownian motion
- Expansion in ${\boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${\boldsymbol{{\mathbb Z}^n}}$: the First Three Terms
- Exploring hypergraphs with martingales
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3503316 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Hypercube percolation
- Largest random component of a k-cube
- NIST handbook of mathematical functions
- On the critical percolation probabilities
- On the strength of connectedness of a random graph
- Percolation
- Probability: A Graduate Course
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Random subgraphs of finite graphs. III: The phase transition for the n-cube
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- Random subgraphs of the 2D Hamming graph: The supercritical phase
- Susceptibility in subcritical random graphs
- Tail estimates for the Brownian excursion area and other Brownian areas
- The Alexander-Orbach conjecture holds in high dimensions
- The Brownian excursion area: A numerical analysis
- The Evolution of Random Graphs
- The Evolution of Random Subgraphs of the Cube
- The evolution of subcritical Achlioptas processes
- The number of connected sparsely edged graphs
- The total progeny in a branching process and a related random walk
- Tree graph inequalities and critical behavior in percolation models
- Unlacing hypercube percolation: a survey
Cited in
(19)- Critical path analysis for continuum percolation
- Critical first-passage percolation starting on the boundary
- Preferential attachment without vertex growth: emergence of the giant component
- Critical probabilities and convergence time of percolation probabilistic cellular automata
- Scaling window for mean-field percolation of averages
- Random replacements in Pólya urns with infinitely many colours
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- scientific article; zbMATH DE number 5998964 (Why is no real title available?)
- scientific article; zbMATH DE number 3976062 (Why is no real title available?)
- A proof of factorization formula for critical percolation
- Are the tails of percolation thresholds Gaussians?
- On the oddness of percolation
- Expansion of Percolation Critical Points for Hamming Graphs
- Critical Percolation on a Bethe Lattice Revisited
- Critical point and percolation probability in a long range site percolation model on \(\mathbb Z^d\)
- The Fourier spectrum of critical percolation
- A branching process with deletions and mergers that matches the threshold for hypercube percolation
- Is the critical percolation probability local?
- The convergence of the exploration process for critical percolation on the k-out graph
This page was built for publication: On the critical probability in percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748902)
