Generalized Laplacians and First Transit Times for Directed Graphs
2009-03-23
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Generalized Laplacians and First Transit Times for Directed Graphs
Authors
Published Date
2009-03-23
Publisher
Type
Report
Abstract
In this paper, we extend previous results on average commute-times for undirected graphs to fully-connected directed graphs, corresponding to irreducible Markov chains. We introduce an unsymmetrized generalized Laplacian matrix and show how its pseudo-inverse directly yields the one-way first-transit times and round-trip commute times with formulas almost matching those for the undirected graph case. We show that the results are equivalent to similar formulas in terms of the Fundamental Matrix for recurrent irreducible Markov chains. We show that the unsymmetrized generalized Laplacian and its pseudo-inverse are positive semi-definite, leading to a natural embedding of the graph in Euclidean space which preserves the round-trip commute times.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Boley, Daniel. (2009). Generalized Laplacians and First Transit Times for Directed Graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215796.
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.