Hitting and commute time distributions of restarting random walks on path graphs
Abstract
We calculate the probability mass function (PMF) and cumulative distribution function (CDF) of hitting and commute time for random walks with restarting on path graphs according to the exact expressions obtained by Zlatanov and Kocarev. The inclusion of a restarting mechanism on the path graph significantly reduces the probability that the walker completes a hit or commute, as shown by both the PMF and CDF. This means that it is less likely for a walker on a path graph to hit a given target node, or to commute from a target node back to the initial node.
Downloads
Published
Issue
Section
License
By submitting their manuscript to the Samahang Pisika ng Pilipinas (SPP) for consideration, the Authors warrant that their work is original, does not infringe on existing copyrights, and is not under active consideration for publication elsewhere.
Upon acceptance of their manuscript, the Authors further agree to grant SPP the non-exclusive, worldwide, and royalty-free rights to record, edit, copy, reproduce, publish, distribute, and use all or part of the manuscript for any purpose, in any media now existing or developed in the future, either individually or as part of a collection.
All other associated economic and moral rights as granted by the Intellectual Property Code of the Philippines are maintained by the Authors.
