Random walks on digraphs, the generalized digraph laplacian and the degree of asymmetry

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6516 LNCS, Issue , 2010, Pages 74-85

  Li, Yanhua ^a   Zhang, Zhi Li ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHEEGER CONSTANT; DEGREE OF ASYMMETRY; FUNDAMENTAL MATRIX; LAPLACIAN MATRICES; LAPLACIANS; MARKOV CHAIN; MOORE-PENROSE; NEW RESULTS; PSEUDO-INVERSES; RANDOM WALK; RANDOM-WALK THEORY; SINGULAR VALUES; SPECTRAL GRAPH THEORY; UNDIRECTED GRAPH; MOORE PENROSE PSEUDO INVERSE;

ALGORITHMS; GREEN'S FUNCTION; LAPLACE TRANSFORMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; CHAINS; COMPUTATION THEORY; DIRECTED GRAPHS; INVERSE PROBLEMS; RANDOM PROCESSES;

GRAPH THEORY;

EID: 78650891188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18009-5_8     Document Type: Conference Paper

References (15)

1. Aldous, D., Fill, J.A.: Reversible markov chains and random walks on graphs, http://www.stat.berkeley.edu/~aldous/RWG/book.html
2. Bhatia, R.: Matrix Analysis. Springer, Heidelberg (1997)
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)
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)
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) (Pubitemid 128666929)
6. Chung, F.R.K.: Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics 9, 1-19 (2005)
7. Chung, F.R.K.: Spectral Graph Theory. In: CBMS Regional Conference Series in Mathematics, vol. 92 (2006)
8. Chung, F.R.K., Yau, S.T.: Discrete green's functions. Journal of Combinatorial Theory, Series A, 191-214 (July 2000)
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)
10. Horn, R., Johnson, C.R.: Matrix Analysis, 1st edn. Cambridge University Press, Cambridge (1985)
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)
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. Lovàsz, L.: Random walks on graphs: A survey. Combinatorics 2, 1-46 (1993)
14. Mihail, M.: Conductance and convergence of markov chains-a combinatorial treatment of expanders. In: Proceedings of FOCS 1989, pp. 526-531 (1989)
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)