Some intersection properties of random walk paths

@article{Erdos1960SomeIP,
  title={Some intersection properties of random walk paths},
  author={Paul L. Erdos and Stephen Taylor},
  journal={Acta Mathematica Academiae Scientiarum Hungarica},
  year={1960},
  volume={11},
  pages={231-248}
}
We complete the solution of this problem in Section 3 . Clearly, there is no problem for d-== I or 2 . The solution takes a different form in the cases d= 3, d-4, and d = 5. For example, if d = 4, an interesting consequence of the result is that, with probability 1, there are infinitely many n for which 17+ (0, n) and /1 4(2n, x ) have a point in common . This in turn implies that any two independent random walks in 4-space have infinitely many points in common . This at first surprised us… 

Some problems concerning the structure of random walk paths

1. In t roduct ion . We restrict our consideration to symmetric random walk, defined in the following way. Consider the lattice formed by the points of d-dimensional Euclidean space whose coordinates

Cut Times for Brownian Motion and Random Walk

A cut time for a Brownian motion or a random walk is a time at which the past and the future of the process to not intersect. In this paper we review the work of Erdős on cut times and discuss more

Cutpoints of (1,2) and (2,1) random walks on the lattice of positive half line

In this paper, we study (1,2) and (2,1) random walks in varying environments on the lattice of positive half line. We assume that the transition probabilities at site n are asymptotically constants

On the volume of the intersection of two Wiener sausages

For a > 0, let W a 1 (t) and W a 2 (t) be the a-neighbourhoods of two independent standard Brownian motions in R d starting at 0 and observed until time t. We prove that, for d 3 and c > 0, lim t!1 1

Propriétés d'intersection des marches aléatoires

We study intersection properties of multi-dimensional random walks. LetX andY be two independent random walks with values in ℤd (d≦3), satisfying suitable moment assumptions, and letIn denote the

Most transient random walks have infinitely many cut times

We prove that if (Xn)n≥0 is a random walk on a transient graph such that the Green’s function decays at least polynomially along the random walk, then (Xn)n≥0 has infinitely many cut times almost

On the Almost Intersections of Transient Brownian Motions

Let {B1d(t)} and {Bd2(t)} be independent Brownian motions in Rd starting from 0 and nx respectively, and let wdi(a,b) ={x∈Rd: Bdi(t)=x for some t∈(a,b)}, i=1,2. Asymptotic expressions as n→∞ for the

Intersection-equivalence of Brownian paths and certain branching processes

We show that sample paths of Brownian motion (and other stable processes) intersect the same sets as certain random Cantor sets constructed by a branching process. With this approach, the classical

Large Deviations for Intersections of Random Walks

We prove a Large Deviations Principle for the number of intersections of two independent infinite-time ranges in dimension five and more, improving upon the moment bounds of Khanin, Mazel, Shlosman

Asymptotic properties of diffusions in random environment

In this thesis we study asymptotic properties of a specific class of random motions evolving in an inhomogeneous medium, the so-called diffusions in random environment. The nature of these movements
...

References

SHOWING 1-4 OF 4 REFERENCES

Triple points of Brownian paths in 3-space

In (3), some of us proved that Brownian paths in n-space have double points with probability 1 if n = 2 or 3; but, for n ≥ 4, there are no double points with probability 1. The question naturally

Some Problems on Random Walk in Space

Consider the lattice formed by all points whose coordinates are integers in d-dimensional Euclidean space, and let a point S j(n) perform a move randomly on this lattice according to the following

The Hausdorff α-dimensional measure of Brownian paths in n-space

  • Stephen Taylor
  • Mathematics
    Mathematical Proceedings of the Cambridge Philosophical Society
  • 1953
Dvoretsky, Erdös and Kakutani (3), showed that Brownian paths in 4 dimensions have zero 2-dimensional capacity, and their method gives the same result for Brownian paths in n-space whenever n ≥ 3.

Double points of Brownian paths in n-space

  • Acta Sci. Math . Szeged
  • 1950