Long-range first-passage percolation on the torus
From MaRDI portal
Publication:6614947
Recommendations
- Multiple phase transitions in long-range first-passage percolation on square lattices
- Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics
- Last passage percolation on the complete graph
- First passage percolation on random geometric graphs and an application to shortest-path trees
- Flooding and diameter in general weighted random graphs
Cites work
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- Arithmetic oscillations of the chemical distance in long-range percolation on \(\mathbb{Z}^d\)
- Diameter of the stochastic mean-field model of distance
- Distance evolutions in growing preferential attachment graphs
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- First passage percolation on random graphs with finite mean degrees
- First passage percolation on the Erdős-Rényi random graph
- First-passage percolation on the random graph
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Long paths in first passage percolation on the complete graph II. Global branching dynamics
- Long paths in first passage percolation on the complete graph. I: Local PWIT dynamics
- Multiple phase transitions in long-range first-passage percolation on square lattices
- Nonuniversality of weighted random graphs with infinite variance degree
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Penalising transmission to hubs in scale-free spatial random graphs
- Short paths for first passage percolation on the complete graph
- Size and Weight of Shortest Path Trees with Exponential Link Weights
- The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights
- The flooding time in random graphs
- The longest minimum-weight path in a complete graph
- Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
- Universality for first passage percolation on sparse random graphs
- Weak disorder asymptotics in the stochastic mean-field model of distance
- Weak disorder in the stochastic mean-field model of distance. II
- Weighted distances in scale-free configuration models
- Weighted distances in scale-free preferential attachment models
- When is a scale-free graph ultra-small?
This page was built for publication: Long-range first-passage percolation on the torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614947)
