2008
DOI: 10.1214/ejp.v13-531
|View full text |Cite
|
Sign up to set email alerts
|

The mass of sites visited by a random walk on an infinite graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…There are many results for ranges on the integer lattices Z d ([DE, JO, JP70, JP71, JP72-1, JP72-2, JP74, S, DV, L, LR, H98, H01, HK01, HK02, BK, BR, BCR, LV]). On the other hand, there are relatively few results for ranges on more general (deterministic or random) infinite connected simple graphs ( [BIK,G,KM,KoN,O14,R]). Difficulties for graphs, especially for non vertex-transitive graphs, arise from the lack of spacial homogeneity of graphs.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…There are many results for ranges on the integer lattices Z d ([DE, JO, JP70, JP71, JP72-1, JP72-2, JP74, S, DV, L, LR, H98, H01, HK01, HK02, BK, BR, BCR, LV]). On the other hand, there are relatively few results for ranges on more general (deterministic or random) infinite connected simple graphs ( [BIK,G,KM,KoN,O14,R]). Difficulties for graphs, especially for non vertex-transitive graphs, arise from the lack of spacial homogeneity of graphs.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…The lower bound portion of Theorem 1 does not differ substantially from the classical approach [7], [14], requiring only the careful estimation of the probability that the sausage remains inside of a ball of radius r until at least time r β V (x, r). To treat the more challenging upper bound result, we turn to a coarse graining method out of the field of random media [5], [11], [22].…”
Section: Resultsmentioning
confidence: 99%
“…A result of this type appears in [12], and an exact discrete analogue to the below in [10]. Lemma 2.…”
Section: Upper Boundmentioning
confidence: 89%
See 2 more Smart Citations