Hitting Times on Star-Shaped Graphs
Article Sidebar
Main Article Content
Abstract
The hitting time or access time, H(u,v), is defined as the expected number of steps a random walk starting from a point u to reach a point v for the first time, where u and v need not be different. For star-shaped graphs, we present two methods for the computation of hitting time, with power series and with matrices, where the origin is at the center. We observe a pattern of hitting times as the number of vertices increases from 2, and generalize to n.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
- Student authors waive FERPA rights for only the publication of the author submitted works.
Specifically: Students of Indiana University East voluntarily agree to submit their own works to The Journal of Student Research at Indiana University East, with full understanding of FERPA rights and in recognition that for this one, specific instance they understand that The Journal of Student Research at Indiana University East is Public and Open Access. Additionally, the Journal is viewable via the Internet and searchable via Indiana University, Google, and Google-Scholar search engines.
References
R. Hall, Stochastic Implications of the Life Cycle-Permanent Income Hypothesis: Theory and Evidence, The Journal of Political Economy, 86 (1978), pp. 971-987.
J. Palacios, On Hitting Times of Random Walks on Trees, Statist. Probab. Lett., 79 (2009), pp. 234-236.
M. Kang, First Hitting Times of Simple Random Walks on Graphs with Congestion Points, Int. J. Math. Math. Sci., 30 (2003), pp. 1911-1922.
A. David Hitting times for random walks on vertex-transitive graphs, Math. Proc. Cambridge Philos. Soc. (1989), 106. 179.
S. K. Rao, Finding hitting times in various graphs Statist. Probab. Lett., 83 (2013), pp. 2067-2072.
R. P. Stanley, Algebraic Combinatorics, Springer, New York, 2013.