Searcharxiv⌕ Search

arXiv subjects

Leonel Zuaznábar

Publications and source records attributed to Leonel Zuaznábar.

6 recordsLinked to original sources

Generalized Excited Random Walks under Bernoulli excitations

We study a variant of the Generalized Excited Random Walk (GERW) on $\mathbb{Z}^d$ introduced by Menshikov, Popov, Ramírez and Vachkovskaia in [Ann. Probab. 40 (5), 2012]. It consists of a particular version of the model studied in [arXiv preprint arXiv:2211.05715, 2022] where excitation may or may not occur according to a time-dependent probability. Specifically, given $\{p_n\}_{n \ge 1}$, $p_n \in (0, 1]$ for all $n \ge 1$, whenever the process visits a site at time $n$ for the first time, with probability $p_n$ it gains a drift in a fixed direction. Otherwise, it behaves as a $d$-martingale with zero-mean vector. We refer to the model as $p_n$-GERW. Assuming bounded jumps and $p_n \approx n^{-β}$, we show a series of results for the $p_n$-\Name{} depending on the value of $β$ and on the dimension $d$. Specifically, for every $β\in(0,1]$ and $d=2$ or $d>h(β)$, with $h$ a decreasing function of $β$, we prove a SLLN for the range, while for $β<1/2$ we prove a sub-ballistic SLLN for the process whenever the SLLN for the range holds. We also study the $p_n$-\Name{} under diffusive scaling, and we obtain a Functional Central Limit Theorem for $β> 1/2$ and $d\geq 2$, or $β=1/2$ and $d=2$. Finally, for $β=1/2$ and $d \ge 11$ we show that the diffusively rescaled $p_n$-\Name{} converges in distribution to a Brownian Motion plus a multiple of the square root of time.

math.PR↗

Estimates on Escape Times for the Elephant Random Walk

We study the gambler's ruin problem for the Elephant Random Walk, focusing on escape time from a symmetric interval of the form $\{-N, \ldots, N\}$. As our main result, we derive tight exponential bounds for the tail of this escape time. We then illustrate the usefulness of such bounds by proving that, in the diffusive regime, the Elephant's average behavior mirrors that of the traditional symmetric random walk: the expected escape time grows quadratically with $N$.

math.PR↗

On the convergence of the drainage network with branching

The Drainage Network is a system of coalescing random walks, exhibiting long-range dependence before coalescence, introduced by Gangopadhyay, Roy, and Sarkar. Coletti, Fontes, and Dias proved its convergence to the Brownian Web under diffusive scaling. In this work, we introduce a perturbation of the system allowing branching of the random walks with low probabilities varying with the scaling parameter. When the branching probability is inversely proportional to the scaling parameter, we show that this drainage network with branching consists of a tight family such that any weak limit point contains a Brownian Net. We conjecture that the limit is indeed the Brownian Net.

math.PR↗

Scaling limit of an equilibrium surface under the Random Average Process

We consider the equilibrium surface of the Random Average Process started from an inclined plane, as seen from the height of the origin, obtained in [Ferrari & Fontes, 1998], where its fluctuations were shown to be of order of the square root of the distance to the origin in one dimension, and the square root of the log of that distance in two dimensions (and constant in higher dimensions). Remarkably, even if not pointed out explicitly in [Ferrari & Fontes, 1998], the correlation structure of those fluctuations is given in terms of the Green's function of a certain random walk, and thus corresponds to those of Discrete Gaussian Free Fields. In the present paper we obtain the scaling limit of those fluctuations in one and two dimensions, in terms of Gaussian processes, in the sense of finite dimensional distributions. In one dimension, the limit is given by Brownian Motion; in two dimensions, we get a process with a discontinuous covariance function.

math.PR↗

A version of the random directed forest and its convergence to the Brownian web

Several authors have studied convergence in distribution to the Brownian web under diffusive scaling of Markovian random walks. In a paper by R. Roy, K. Saha and A. Sarkar, convergence to the Brownian web is proved for a system of coalescing random paths -- the Random Directed Forest -- which are not Markovian. Paths in the Random Directed Forest do not cross each other before coalescence. Here we study a generalization of the non-Markovian Random Directed Forest where paths can cross each other and prove convergence to the Brownian web. This provides an example of how the techniques to prove convergence to the Brownian web for systems allowing crossings can be applied to non-Markovian systems.

math.PR↗

Asymptotic behavior of a low temperature non-cascading 2-GREM dynamics at extreme time scales

We derive the scaling limit for the Hierarchical Random Hopping dynamics for the non cascading 2-GREM at low temperatures and time scales where the dynamics is close to equilibrium. The {\em fine tuning} phenomenon plays a role (under certain choices of parameters of the model), yielding three dynamical regimes. In contrast to the {\em cascading} case, the pairs of first and second level energies have fluctuations which scale with the volume, and this leads to a family of time scales where we see the dynamics moving through only a part of the full low temperature energy landscape.

math.PR↗