Subexponential tail asymptotics for a random walk with randomly placed one-way nodes
Nina Gantert (2002)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Nina Gantert (2002)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Olivier Mejane (2004)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Takahiko Nakazi (1984)
Studia Mathematica
Similarity:
Arvind Singh (2007)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Françoise Pène, Benoît Saussol (2009)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighbourhood of the origin. We address this question in the case of some extended dynamical systems similar to planar random walks, including ℤ-extension of mixing subshifts of finite type. We define a pointwise recurrence rate and relate it to the dimension of the process, and establish a result of convergence...
Endre Csáki, Pál Révész, Jay Rosen (1998)
Annales de l'I.H.P. Probabilités et statistiques
Similarity: