Coverings, Laplacians, and heat kernels of directed graphs

MaRDI QIDQ1010941zbMATH OpenFDO

Authors Clara E. Brasseur, Ryan E. Grady, Stratos Prassidis

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117308, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r31.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Review text

Summary: Combinatorial covers of graphs were defined by Chung and Yau. Their main feature is that the spectra of the Combinatorial Laplacian of the base and the total space are related. We extend their definition to directed graphs. As an application, we compute the spectrum of the Combinatorial Laplacian of the homesick random walk \(RW_{\mu}\) on the line. Using this calculation, we show that the heat kernel on the weighted line can be computed from the heat kernel of `\((1 + 1/\mu)\)-regular' tree.

Recommendations

• Coverings, heat kernels and spanning trees
• Non self-adjoint Laplacians on a directed graph
• Random walks on directed covers of graphs
• Spectral structure of the Laplacian on a covering graph
• Laplacian of a graph covering and its applications

Cited in

(2)

• Discrete diffusion-type equation on regular graphs and its applications
• Random walks on directed covers of graphs

This page was built for publication: Coverings, Laplacians, and heat kernels of directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010941)