High-ordered Random Walks and Generalized Laplacians on Hypergraphs

Details High-ordered Random Walks and Generalized Laplacians on Hypergraphs High-ordered Random Walks and Generalized Laplacians on Hypergraphs

2011-02-22

arxiv.org/abs/1102.4409v1

Mathematics

Combinatorics

19 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

High-ordered Random Walks and Generalized Laplacians on Hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with High-ordered Random Walks and Generalized Laplacians on Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-ordered Random Walks and Generalized Laplacians on Hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558150