Coverings, Laplacians, and heat kernels of directed graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
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.
@article{10_37236_120,
author = {Clara E. Brasseur and Ryan E. Grady and Stratos Prassidis},
title = {Coverings, {Laplacians,} and heat kernels of directed graphs},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/120},
zbl = {1181.05059},
url = {http://geodesic.mathdoc.fr/articles/10.37236/120/}
}
TY - JOUR AU - Clara E. Brasseur AU - Ryan E. Grady AU - Stratos Prassidis TI - Coverings, Laplacians, and heat kernels of directed graphs JO - The electronic journal of combinatorics PY - 2009 VL - 16 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.37236/120/ DO - 10.37236/120 ID - 10_37236_120 ER -
Clara E. Brasseur; Ryan E. Grady; Stratos Prassidis. Coverings, Laplacians, and heat kernels of directed graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/120
Cité par Sources :