Continuum of All-Pair Shortest-Path to All-Path via Random Walk
Authors
Published Date
Publisher
Type
Abstract
A method is proposed to compute the continuum of paths, from shortest paths to all random paths between all pairs of nodes at once in a unified way. The analysis is based on treating the network as a random walk with an additional absorbing state named evaporating state reachable with nonzero probability from any state (so called "evaporating random walk"). The probability of avoiding absorption is tuned by a single parameter varying between 0 and 1, with lower values favoring shorter paths. A computational example is used to illustrate the method.
Keywords
Description
Related to
item.page.replaces
License
Series/Report Number
Technical Report; 13-016
Funding Information
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Golnari, Golshan; Boley, Daniel. (2013). Continuum of All-Pair Shortest-Path to All-Path via Random Walk. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215919.
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.