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
Distribution-constrained optimal multiple stopping: the Root-type solution
Shuoqing Deng, Daxin Huang
Universality and sharp thresholds for ellipsoid fitting
Frederic Koehler, Youngtak Sohn
Local Laws and Edge Universality for Noncentral Sample Covariance Matrices
Can Hu, Jiang Hu, Zhidong Bai
Well-posedness and regularity of stochastic heat equations on moving domains
Chongyang Ren, Tusheng Zhang
Traveling Waves in Equity Markets with Rank-Based Entry and Exit
Graeme Baker, Caroline Smyth
An approximate zero bias transformation for random sums: Applications to sampling with outliers, auto insurance, and generative AI
Wasamon Jantai, Nathakhun Wiroonsri