First-passage percolation on Cartesian power graphs

DOI10.1214/17-AOP1199zbMath1430.60017arXiv1506.08564WikidataQ130148452 ScholiaQ130148452MaRDI QIDQ1746146

Anders Martinsson

Publication date: 24 April 2018

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08564

zbMATH Keywords

hypercubepower graphhigh dimensiontime constantfirst-passage percolation

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Percolation (82B43)

Related Items (4)

Undirected polymers in random environment: path properties in the mean field limit ⋮ Oriented first passage percolation in the mean field limit. II: The extremal process ⋮ Accessibility percolation on Cartesian power graphs ⋮ Random growth models: Shape and convergence rate

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the time constant of high dimensional first passage percolation
• Unoriented first-passage percolation on the \(n\)-cube
• Construction of a short path in high-dimensional first passage percolation
• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• Probability approximations via the Poisson clumping heuristic
• Phase transition for accessibility percolation on hypercubes
• Percolation
• Oriented percolation in dimensions d ≥ 4: bounds and asymptotic formulas

This page was built for publication: First-passage percolation on Cartesian power graphs