Exceptional times of the critical dynamical Erdős-Rényi graph

DOI10.1214/17-AAP1357zbMath1405.05168arXiv1610.06000MaRDI QIDQ1617126

Matthew I. Roberts, Batı Şengül

Publication date: 7 November 2018

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

noise sensitivitydynamical random graphsgiant componenttemporal networksErdős-Rényi

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Functional limit theorems; invariance principles (60F17)

Related Items (8)

Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting) ⋮ Annealed scaling relations for Voronoi percolation ⋮ Noise sensitivity of percolation via differential inequalities ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Noise sensitivity of critical random graphs ⋮ Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs ⋮ Cluster tails for critical power-law inhomogeneous random graphs ⋮ The probability of unusually large components in the near-critical Erdős–Rényi graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Volatility of Boolean functions
• The Fourier spectrum of critical percolation
• Oded Schramm's contributions to noise sensitivity
• Dynamical sensitivity of the infinite cluster in critical percolation
• Quantitative noise sensitivity and exceptional times for percolation
• On Russo's approximate zero-one law
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Dynamical percolation
• On the largest component of the random graph at a nearcritical stage
• Which properties of a random sequence are dynamically sensitive?
• The continuum limit of critical random graphs
• Dynamical stability of percolation for some interacting particle systems and \(\varepsilon\)-movability
• Random Graphs and Complex Networks
• A survey on dynamical percolation
• On near-critical and dynamical percolation in the tree case
• Noise Sensitivity of Boolean Functions and Percolation
• The probability of unusually large components in the near-critical Erdős–Rényi graph
• Noise sensitivity of Boolean functions and applications to percolation
• Local time on the exceptional set of dynamical percolation and the incipient infinite cluster
• Strong noise sensitivity and random graphs

This page was built for publication: Exceptional times of the critical dynamical Erdős-Rényi graph