Noise sensitivity of critical random graphs
From MaRDI portal
Publication:2696635
DOI10.1007/s11856-022-2354-yOpenAlexW3082144842MaRDI QIDQ2696635
Publication date: 17 April 2023
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.01707
Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17) Boolean functions (06E30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks, capacity and percolation on trees
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Exceptional times of the critical dynamical Erdős-Rényi graph
- The scaling limit of the minimum spanning tree of the complete graph
- Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
- The continuum limit of critical random graphs
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Susceptibility in subcritical random graphs
- The Evolution of Random Graphs
- Component behavior near the critical point of the random graph process
- The Structure of a Random Graph at the Point of the Phase Transition
- Noise Sensitivity of Boolean Functions and Percolation
- Noise sensitivity of Boolean functions and applications to percolation
- Strong noise sensitivity and random graphs