Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Kious, Daniel"'
We study a non-reversible random walk advected by the symmetric simple exclusion process, so that the walk has a local drift of opposite sign when sitting atop an occupied or an empty site. We prove that the back-tracking probability of the walk exhi
Externí odkaz:
http://arxiv.org/abs/2409.02096
We consider random walks amongst random conductances in the cases where the conductances can be arbitrarily small, with a heavy-tailed distribution at 0, and where the conductances may or may not have a heavy-tailed distribution at infinity. We study
Externí odkaz:
http://arxiv.org/abs/2308.02230
In this article, we prove a lower bound for the fluctuations of symmetric random walks on dynamic random environments in dimension $1 + 1$ in the perturbative regime where the walker is weakly influenced by the environment. We suppose that the random
Externí odkaz:
http://arxiv.org/abs/2304.05771
We consider Bienaym\'e-Galton-Watson trees in random environment, where each generation $k$ is attributed a random offspring distribution $\mu_k$, and $(\mu_k)_{k\geq 0}$ is a sequence of independent and identically distributed random probability mea
Externí odkaz:
http://arxiv.org/abs/2209.11130
In this paper, we study a probabilistic reinforcement-learning model for ants searching for the shortest path(s) between their nest and a source of food. In this model, the nest and the source of food are two distinguished nodes $N$ and $F$ in a fini
Externí odkaz:
http://arxiv.org/abs/2106.10559
It is well-known in biology that ants are able to find shortest paths between their nest and the food by successive random explorations, without any mean of communication other than the pheromones they leave behind them. This striking phenomenon has
Externí odkaz:
http://arxiv.org/abs/2010.04820
We present a simple model of a random walk with partial memory, which we call the \emph{random memory walk}. We introduce this model motivated by the belief that it mimics the behavior of the once-reinforced random walk in high dimensions and with sm
Externí odkaz:
http://arxiv.org/abs/2004.07997
We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is sitting on
Externí odkaz:
http://arxiv.org/abs/1906.03167
The branching-ruin number of a tree, which describes its asymptotic growth and geometry, can be seen as a polynomial version of the branching number. This quantity was defined by Collevecchio, Kious and Sidoravicius (2018) in order to understand the
Externí odkaz:
http://arxiv.org/abs/1811.08058
We revisit an unpublished paper of Vervoort (2002) on the once reinforced random walk, and prove that this process is recurrent on any graph of the form $\mathbb{Z}\times \Gamma$, with $\Gamma$ a finite graph, for sufficiently large reinforcement par
Externí odkaz:
http://arxiv.org/abs/1807.07167