Commute Times for a Directed Graph using an Asymmetric Laplacian
2010-03-08
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Commute Times for a Directed Graph using an Asymmetric Laplacian
Authors
Published Date
2010-03-08
Publisher
Type
Report
Abstract
The expected commute times for a strongly connected directed graph are related to an asymmetric Laplacian matrix as a direct extension to similar well known formulas for undirected graphs. We show the close relationships between the asymmetric Laplacian and the so-called Fundamental matrix. We give bounds for the commute times in terms of the stationary probabilities for a random walk over the graph together with the asymmetric Laplacian and show how this can be approximated by a symmetrized Laplacian derived from a related weighted undirected graph.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Boley, Daniel; Ranjan, Gyan; Zhang, Zhi-Li. (2010). Commute Times for a Directed Graph using an Asymmetric Laplacian. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215823.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.