English

Minimum stationary values of sparse random directed graphs

Probability 2025-02-13 v3 Discrete Mathematics Combinatorics

Abstract

We consider the stationary distribution of the simple random walk on the directed configuration model with bounded degrees. Provided that the minimum out-degree is at least 22, with high probability (whp) there is a unique stationary distribution. We show that the minimum positive stationary value is whp n(1+C+o(1))n^{-(1+C+o(1))} for some constant C0C \ge 0 determined by the degree distribution. In particular, CC is the competing combination of two factors: (1) the contribution of atypically "thin" in-neighbourhoods, controlled by subcritical branching processes; and (2) the contribution of atypically "light" trajectories, controlled by large deviation rate functions. Additionally, our proof implies that whp the hitting and the cover time are both n1+C+o(1)n^{1+C+o(1)}. Our results complement those of Caputo and Quattropani who showed that if the minimum in-degree is at least 2, stationary values have logarithmic fluctuations around n1n^{-1}.

Keywords

Cite

@article{arxiv.2010.07246,
  title  = {Minimum stationary values of sparse random directed graphs},
  author = {Xing Shi Cai and Guillem Perarnau},
  journal= {arXiv preprint arXiv:2010.07246},
  year   = {2025}
}

Comments

51 pages, 4 figures

R2 v1 2026-06-23T19:21:10.778Z