Diameter and stationary distribution of random r-out digraphs
Visualitza/Obre
Cita com:
hdl:2117/342134
Tipus de documentArticle
Data publicació2020-08-07
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-SenseObraDerivada 3.0 Espanya
Abstract
Let D(n, r) be a random r-out regular directed multigraph on the set of vertices {1, . . . , n}. In this work, we establish that for every r = 2, there exists ¿r > 0 such that diam(D(n, r)) = (1 + ¿r + o(1)) logr n. The constant ¿r is related to branching processes and also appears in other models of random undirected graphs. Our techniques also allow us to bound some extremal quantities related to the stationary distribution of a simple random walk on D(n, r). In particular, we determine the asymptotic behaviour of pmax and pmin, the maximum and the minimum values of the stationary distribution. We show that with high probability pmax = n -1+o(1) and pmin = n -(1+¿r)+o(1). Our proof shows that the vertices with p(v) near to pmin lie at the top of “narrow, slippery towers”; such vertices are also responsible for increasing the diameter from (1+o(1)) logr n to (1 + ¿r + o(1)) logr n.
CitacióAddario-Berry, L.; Balle, B.; Perarnau-Llobet, G. Diameter and stationary distribution of random r-out digraphs. "Electronic journal of combinatorics", 7 Agost 2020, vol. 27, núm. P3.28, p. 1-41.
ISSN1077-8926
Versió de l'editorhttps://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i3p28
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
revised_paper.pdf | Article | 463,8Kb | Visualitza/Obre |