Abstract
AbstractWe study the long-term behaviour of a random walker embedded in a growing sequence of graphs. We define a (generally non-Markovian) real-valued stochastic process, called the knowledge process, that represents the ratio between the number of vertices already visited by the walker and the current size of the graph. We mainly focus on the case where the underlying graph sequence is the growing sequence of complete graphs.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference16 articles.
1. Principles of Random Walk
2. Markov Chains and Mixing Times
3. Cover times, blanket times, and majorizing measures
4. Walking within growing domains: recurrence versus transience
5. [9] De Bacco, C. , Majumdar, S. and Sollich, P. (2015). The average number of distinct sites visited by a random walker on random graphs. Preprint. Available at https://arxiv.org/abs/1501.01528v2.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献