Основні поняття
Four universal growth regimes are observed in degree-dependent first passage percolation on spatial random graphs, showcasing unique phases of transmission time growth.
Анотація
The content explores the four distinct growth phases observed in degree-dependent first passage percolation on spatial random graphs. It delves into the underlying model parameters and their impact on the transmission times between vertices. The study reveals a rich behavior with several growth phases and non-smooth phase transitions, providing insights into the dynamics of spreading processes on graph networks.
Introduction
Definition of First Passage Percolation (FPP)
Introduction of One-Dependent FPP
Universality Classes of Transmission Times
Description of one-dependent FPP model parameters and their influence on transmission times
Precise Behavior in the Four Phases
Detailed analysis of each growth phase: explosive, polylogarithmic, polynomial, and linear
New Methodology: Moving to Quenched to Replace FKG-Inequality
Development of a general technique using pseudorandom nets combined with multi-round exposure to replace the FKG inequality
Budget Travel Plan with 3-Edge Bridge-Paths
Explanation of the methodology for constructing connecting paths over multiple iterations
Robustness of Techniques
Discussion on the robustness and applicability of developed techniques across various graph models
Статистика
In this paper we develop new methods to prove the upper bounds in all sub-explosive phases.
We show that as µ increases, different phases occur for the transmission time between vertices.
The cost function C(xy) could also depend on |x − y|.