Conjecture on explosive distances in scale-free percolation
Conjecture on explosive distances in scale-free percolation
Let denote the -distance between vertices , and let be the explosion time from . Under the condition of the distance theorem, these quantities satisfy the following almost-sure bound. Explosive-distance conjecture. For any two vertices ,
almost surely. Consequently, as ,
The conjecture strengthens the asserted result on explosive -distances, predicting that distances asymptotically decompose into the explosion times from the two endpoints. The supplied text gives no resolution, so its status remains open.
Sources & referencesView supporting material
Primary source
Remco van der Hofstad and Julia Komjathy, “Explosion and distances in scale-free percolation”, arXiv:1706.02597 (2018).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.