Minimum stationary values of sparse random directed graphs

DOI10.1214/25-AAP2247MaRDI QIDQ6846931zbMATH OpenFDO

Authors Xing Shi Cai, Guillem Perarnau

Publication date 10 March 2026

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

Full work available at URL https://projecteuclid.org/journals/annals-of-applied-probability/volume-36/issue-1/Minimum-stationary-values-of-sparse-random-directed-graphs/10.1214/25-AAP2247.full

zbMATH Keywords

directed configuration modelrandom walksstationary distribution

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05)

Cites work

• Bootstrap percolation in living neural networks
• Characterizing optimal sampling of binary contingency tables via the configuration model
• Coupling on weighted branching trees
• Covering problems for Brownian motion on spheres
• Cutoff at the ``entropic time for sparse Markov chains
• Diameter and stationary distribution of random r-out digraphs
• Generalized PageRank on directed configuration networks
• Graph colouring and the probabilistic method
• scientific article; zbMATH DE number 3504208 (Why is no real title available?)
• scientific article; zbMATH DE number 3410334 (Why is no real title available?)
• Large deviations techniques and applications.
• Random graphs and complex networks. Volume 1
• Random walk on sparse random digraphs
• Rankings in directed configuration models with heavy tailed in-degrees
• Some New Bounds on the Probability of Extinction of a Galton–Watson Process with Numerical Comparisons
• Stationary distribution and cover time of random walks on random digraphs
• Stationary distribution and cover time of sparse directed configuration models
• Stein's method for concentration inequalities
• The diameter of sparse random graphs
• The diameter of the directed configuration model
• The giant component of the directed configuration model revisited
• The graph structure of a deterministic automaton chosen at random
• The probability that a random multigraph is simple
• The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
• Typical distances in the directed configuration model

This page was built for publication: Minimum stationary values of sparse random directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846931)