High-Ordered Random Walks and Generalized Laplacians on Hypergraphs

Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these very different versions of Laplacians for hypergraphs. We introduce a set of Laplacians for hypergraphs through studying high-ordered random walks on hypergraphs. We prove the eigenvalues of these Laplacians can effectively control the mixing rate of high-ordered random walks, the generalized distances/diameters, and the edge expansions.

[1]  F. Chung.  The Laplacian of a Hypergraph. , 1992 .

[2]  Vojtech Rödl,et al.  A Dirac-Type Theorem for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.

[3]  J. A. Rodŕıguez,et al.  Laplacian Eigenvalues and Partition Problems in Hypergraphs , 2004 .

[4]  Daniela Kühn,et al.  Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree , 2006, J. Comb. Theory, Ser. B.

[5]  Andrzej Dudek,et al.  Tight Hamilton cycles in random uniform hypergraphs , 2011, Random Struct. Algorithms.

[6]  Gyula Y. Katona,et al.  Generating quadrangulations of surfaces with minimum degree at least 3 , 1999 .

[7]  Fan Chung Graham,et al.  An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian , 1994, SIAM J. Discret. Math..

[8]  Fan Chung Graham,et al.  The Diameter and Laplacian Eigenvalues of Directed Graphs , 2006, Electron. J. Comb..

[9]  Andrzej Dudek,et al.  Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs , 2012, Electron. J. Comb..

[10]  D. Osthus,et al.  Hamilton l-cycles in k-graphs , 2009 .

[11]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

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

[13]  Vojtech Rödl,et al.  An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..

[14]  Endre Szemer,et al.  AN APPROXIMATE DIRAC-TYPE THEOREM FOR k-UNIFORM HYPERGRAPHS , 2008 .

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

[16]  Fan Chung Graham,et al.  Quasi-Random Hypergraphs , 1990, Random Struct. Algorithms.

[17]  Hiêp Hàn,et al.  Dirac-type results for loose Hamilton cycles in uniform hypergraphs , 2010, J. Comb. Theory, Ser. B.

[18]  Milena Mihail,et al.  Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.

[19]  F. Chung.  Diameters and eigenvalues , 1989 .

[20]  Yoshiharu Kohayakawa,et al.  Hypergraphs, Quasi-randomness, and Conditions for Regularity , 2002, J. Comb. Theory, Ser. A.

[21]  A. Sokal,et al.  Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .

[22]  Alan M. Frieze,et al.  Loose Hamilton Cycles in Random 3-Uniform Hypergraphs , 2010, Electron. J. Comb..