Diameter and Stationary Distribution of Random r-out Digraphs

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))rn. 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 π and π, the maximum and the minimum values of the stationary distribution. We show that with high probability π = n-1+o(1) and π=n-(1+ηr)+o(1). Our proof shows that the vertices with π(v) near to π lie at the top of "narrow, slippery towers", such vertices are also responsible for increasing the diameter from (1+o(1))r n to (1+ηr+o(1))rn.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…