Number of distinct and common sites visited by $N$ independent random walkers
Satya N. Majumdar, Gregory Schehr

TL;DR
This paper analyzes the behavior of the number of distinct and common sites visited by N independent random walkers in various dimensions, revealing phase transitions and exact distributions, with extensions to related stochastic processes.
Contribution
It provides exact calculations of mean numbers of visited sites and uncovers phase transitions in the growth behavior of common sites visited by the walkers.
Findings
Exact mean values of visited sites for large t.
Identification of a phase transition in the (N, d) plane.
Full distribution of visited sites in 1D computed.
Abstract
In this Chapter, we consider a model of independent random walkers, each of duration , and each starting from the origin, on a lattice in dimensions. We focus on two observables, namely and denoting respectively the number of distinct and common sites visited by the walkers. For large , where the lattice random walkers converge to independent Brownian motions, we compute exactly the mean and . Our main interest is on the -dependence of these quantities. While for the -dependence only appears in the prefactor of the power-law growth with time, a more interesting behavior emerges for . For this latter case, we show that there is a ``phase transition'' in the plane where the two critical line and separate three phases…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Stochastic processes and statistical mechanics · Algorithms and Data Compression
