Extreme values of the stationary distribution of random walks on directed graphs

We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of vertices in the stationary distribution. We give an upper bound for this ratio over all strongly connected graphs on $n$ vertices. We characterize all graphs achieving the upper bound and we give explicit constructions for these extremal graphs. Additionally, we show that under certain conditions, the principal ratio is tightly bounded. We also provide counterexamples to show the principal ratio cannot be tightly bounded under weaker conditions.

[1]  A. Ostrowski.  On the Eigenvector belonging to the Maximal Root of a Non-negative Matrix , 1960 .

[2]  Fan Chung Graham,et al.  Local Partitioning for Directed Graphs Using PageRank , 2007, Internet Math..

[3]  Xiaodong Zhang.  Eigenvectors and eigenvalues of non-regular graphs , 2005 .

[4]  F. Chung.  Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .

[5]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[6]  Geoff A. Latham,et al.  A Remark on Minc's Maximal Eigenvector Bound for Positive Matrices , 1995, SIAM J. Matrix Anal. Appl..

[7]  Yuan Hong,et al.  On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix , 2002 .

[8]  H. Schneider.  Note on the Fundamental Theorem on Irreducible Non-Negative Matrices , 1958, Proceedings of the Edinburgh Mathematical Society.

[9]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[10]  Henryk Minc,et al.  On the Maximal Eigenvector of a Positive Matrix , 1970 .

[11]  K. P. Hadeler,et al.  On copositive matrices , 1983 .

[12]  K. Das.  A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix , 2009 .

[13]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[14]  A. Ostrowski,et al.  Bounds for the Greatest Latent Root of a Positive Matrix , 1952 .

[15]  Sebastian M. Cioaba,et al.  Principal eigenvectors of irregular graphs , 2007 .

[16]  M. Stuart Lynn,et al.  Bounds for Perron eigenvectors and subdominant eigenvalues of positive matrices , 1969 .

[17]  Peter Winkler,et al.  Maximum itting Time for Random Walks on Graphs , 1990, Random Struct. Algorithms.

[18]  Britta Papendieck,et al.  On maximal entries in the principal eigenvector of graphs , 2000 .

[19]  Michael Tait,et al.  Characterizing graphs of maximum principal ratio , 2015, 1511.06378.