Pith. sign in

REVIEW

Giant Component and Vacant Set for Random Walk on a Discrete Torus

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0610802 v2 pith:V3SCG7RF submitted 2006-10-26 math.PR math-phmath.COmath.MP

classification math.PRmath-phmath.COmath.MP
keywords componentvacantwalkconnecteddiscreterandomsitestorus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider random walk on a discrete torus E of side-length N, in sufficiently high dimension d. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time uN^d. We show that when u is chosen small, as N tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const log N. Moreover, this connected component occupies a non-degenerate fraction of the total number of sites N^d of E, and any point of E lies within distance an arbitrary fractional power of N from this component.

Discussion (0). Continue with ORCID to comment.

Pith tools