Bounds for avalanche critical values of the Bak-Sneppen model
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∞.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.