Penalisation of the Standard Random Walk by a Function of the One-Sided Maximum, of the Local Time, or of the Duration of the Excursions

Author(s):  
Pierre Debs
Keyword(s):  
1987 ◽  
Vol 74 (2) ◽  
pp. 271-287 ◽  
Author(s):  
J. R. Norris ◽  
L. C. G. Rogers ◽  
David Williams

1995 ◽  
Vol 32 (2) ◽  
pp. 375-395 ◽  
Author(s):  
Lajos Takács

This paper is concerned with the distibutions and the moments of the area and the local time of a random walk, called the Bernoulli meander. The limit behavior of the distributions and the moments is determined in the case where the number of steps in the random walk tends to infinity. The results of this paper yield explicit formulas for the distributions and the moments of the area and the local time for the Brownian meander.


2011 ◽  
Vol 121 (6) ◽  
pp. 1290-1314 ◽  
Author(s):  
Endre Csáki ◽  
Miklós Csörgő ◽  
Antónia Földes ◽  
Pál Révész
Keyword(s):  

Entropy ◽  
2020 ◽  
Vol 22 (12) ◽  
pp. 1431
Author(s):  
Gaia Pozzoli ◽  
Mattia Radice ◽  
Manuele Onofri ◽  
Roberto Artuso

We consider a continuous-time random walk which is the generalization, by means of the introduction of waiting periods on sites, of the one-dimensional non-homogeneous random walk with a position-dependent drift known in the mathematical literature as Gillis random walk. This modified stochastic process allows to significantly change local, non-local and transport properties in the presence of heavy-tailed waiting-time distributions lacking the first moment: we provide here exact results concerning hitting times, first-time events, survival probabilities, occupation times, the moments spectrum and the statistics of records. Specifically, normal diffusion gives way to subdiffusion and we are witnessing the breaking of ergodicity. Furthermore we also test our theoretical predictions with numerical simulations.


2019 ◽  
Vol 29 (3) ◽  
pp. 149-158 ◽  
Author(s):  
Valeriy. I. Afanasyev

Abstract Let {Sn, n ≥ 0} be integer-valued random walk with zero drift and variance σ2. Let ξ(k, n) be number of t ∈ {1, …, n} such that S(t) = k. For the sequence of random processes $\begin{array}{} \xi(\lfloor u\sigma \sqrt{n}\rfloor,n) \end{array}$ considered under conditions S1 > 0, …, Sn > 0 a functional limit theorem on the convergence to the local time of Brownian meander is proved.


2005 ◽  
Vol 01 (01) ◽  
pp. 79-107 ◽  
Author(s):  
MAK KABOUDAN

Applying genetic programming and artificial neural networks to raw as well as wavelet-transformed exchange rate data showed that genetic programming may have good extended forecasting abilities. Although it is well known that most predictions of exchange rates using many alternative techniques could not deliver better forecasts than the random walk model, in this paper employing natural computational strategies to forecast three different exchange rates produced two extended forecasts (that go beyond one-step-ahead) that are better than naïve random walk predictions. Sixteen-step-ahead forecasts obtained using genetic programming outperformed the one- and sixteen-step-ahead random walk US dollar/Taiwan dollar exchange rate predictions. Further, sixteen-step-ahead forecasts of the wavelet-transformed US dollar/Japanese Yen exchange rate also using genetic programming outperformed the sixteen-step-ahead random walk predictions of the exchange rate. However, random walk predictions of the US dollar/British pound exchange rate outperformed all forecasts obtained using genetic programming. Random walk predictions of the same three exchange rates employing raw and wavelet-transformed data also outperformed all forecasts obtained using artificial neural networks.


2014 ◽  
Vol 28 (29) ◽  
pp. 1450201
Author(s):  
Seung Ki Baek ◽  
Hawoong Jeong ◽  
Seung-Woo Son ◽  
Beom Jun Kim

The investigation of random walks is central to a variety of stochastic processes in physics, chemistry and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a zero-one-only process. It makes a step in the same direction as the previous step with probability p, and stops to change the direction with 1 − p. By using the generating-function method, we calculate its characteristic quantities such as the statistical moments and probability of the first return.


1992 ◽  
Vol 41 (2) ◽  
pp. 181-190
Author(s):  
Miklós Csörgő ◽  
Pál Révész
Keyword(s):  

2005 ◽  
Vol 18 (3) ◽  
pp. 687-717 ◽  
Author(s):  
Endre Csáki ◽  
Antönia Földes ◽  
Pál Révész

Sign in / Sign up

Export Citation Format

Share Document