Bounds for avalanche critical values of the Bak-Sneppen model
Alexis Gillett, Ronald Meester, Misja Nuyens
Abstract
We study the Bak-Sneppen model on locally finite transitive graphs G, in particular on Zd and on TDelta, the regular tree with common degree Delta. We show that the avalanches of the Bak-Sneppen model dominate independent site percolation, in a sense to be made precise. Since avalanches of the Bak-Sneppen model are dominated by a simple branching process, this yields upper and lower bounds for the so-called avalanche critical value pcBS(G). Our main results imply that 1/(Delta+1) <= ≤ pcBS(TDelta) ≤ 1/(Delta -1), and that 1/(2d+1)≤ pcBS(Zd)≤ 1/(2d)+ 1/(2d)2+O(d-3), as d∞.
Create a lesson
Related papers
Sandpile avalanches in two dimensions are finite
Ahmed Bou-Rabee
Markov Chain Convergence in Kernel-Induced Geometry
Oleksii Kachaiev, Luc Brogat-Motte, Silvia Villa et al.
Interacting Stochastic Systems with Agent-Based Sampling and Connection-Based Reinforcement
Yogesh Dahiya, Gursharn Kaur, Neeraja Sahasrabudhe
Dimension-free Markov--Bernstein-type inequality for R2-valued polynomials
Egor Kosov
Initialization-Dependent Solution Selection by the Euler-Maruyama Scheme for a Degenerate SDE
Akihiro Tanaka
Statistical inference for rough Burgers-type stochastic partial differential equations
Simon Chony Acosta Christian Olivera Ciprian Tudor