Advertisement

Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry

  • Yanhua Li
  • Zhi-Li Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6516)

Abstract

In this paper we extend and generalize the standard random walk theory (or spectral graph theory) on undirected graphs to digraphs. In particular, we introduce and define a (normalized) digraph Laplacian matrix, and prove that 1) its Moore-Penrose pseudo-inverse is the (discrete) Green’s function of the digraph Laplacian matrix (as an operator on digraphs), and 2) it is the normalized fundamental matrix of the Markov chain governing random walks on digraphs. Using these results, we derive new formula for computing hitting and commute times in terms of the Moore-Penrose pseudo-inverse of the digraph Laplacian, or equivalently, the singular values and vectors of the digraph Laplacian. Furthermore, we show that the Cheeger constant defined in [6] is intrinsically a quantity associated with undirected graphs. This motivates us to introduce a metric – the largest singular value of \(\Delta:=(\tilde{\cal L}-\tilde{\cal L}^T)/2\) – to quantify and measure the degree of asymmetry in a digraph. Using this measure, we establish several new results, such as a tighter bound (than that of Fill’s in [9] and Chung’s in [6]) on the Markov chain mixing rate, and a bound on the second smallest singular value of \(\tilde{\cal L}\).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aldous, D., Fill, J.A.: Reversible markov chains and random walks on graphs, http://www.stat.berkeley.edu/~aldous/RWG/book.html
  2. 2.
    Bhatia, R.: Matrix Analysis. Springer, Heidelberg (1997)CrossRefzbMATHGoogle Scholar
  3. 3.
    Boley, D., Ranjan, G., Zhang, Z.-L.: An asymmetric laplacian for a directed graph. University of minnesota computer science department technical report: Tr09-009 (2009)Google Scholar
  4. 4.
    Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Mixing times for random walks on geometric random graphs. In: SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Vancouver, pp. 240–249. SIAM, Philadelphia (2005)Google Scholar
  5. 5.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)CrossRefGoogle Scholar
  6. 6.
    Chung, F.R.K.: Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics 9, 1–19 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Chung, F.R.K.: Spectral Graph Theory. In: CBMS Regional Conference Series in Mathematics, vol. 92 (2006)Google Scholar
  8. 8.
    Chung, F.R.K., Yau, S.T.: Discrete green’s functions. Journal of Combinatorial Theory, Series A, 191–214 (July 2000)Google Scholar
  9. 9.
    Fill, J.A.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1(1), 62–87 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Horn, R., Johnson, C.R.: Matrix Analysis, 1st edn. Cambridge University Press, Cambridge (1985)CrossRefzbMATHGoogle Scholar
  11. 11.
    Jerrum, M., Son, J.-B.: Spectral gap and log-sobolev constant for balanced matroids. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2002 (2002)Google Scholar
  12. 12.
    Li, Y., Zhang, Z.-L.: Random walks on diagraphs, the generalized digraph laplacian and the degree of asymmetry. Technical Report. CSE Department of University of Minnesota (2010), http://www.cs.umn.edu/~yanhua/
  13. 13.
    Lovàsz, L.: Random walks on graphs: A survey. Combinatorics 2, 1–46 (1993)Google Scholar
  14. 14.
    Mihail, M.: Conductance and convergence of markov chains-a combinatorial treatment of expanders. In: Proceedings of FOCS 1989, pp. 526–531 (1989)Google Scholar
  15. 15.
    Zhou, D., Huang, J., Schölkopf, B.: Learning from labeled and unlabeled data on a directed graph. In: Proceedings of the 22nd International Conference on Machine Learning, ICML 2005, pp. 1036–1043. ACM, New York (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yanhua Li
    • 1
  • Zhi-Li Zhang
    • 1
  1. 1.University of MinnesotaTwin CitiesUSA

Personalised recommendations