13 citations · 18 across the 14 of their papers we have counts for
18 papers · 1 filter
Sharp threshold for the ballisticity of the random walk on the exclusion process
Guillaume Conchon--Kerjan, Daniel Kious, Pierre-François Rodriguez
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 em…
Aging and sub-aging for one-dimensional random walks amongst random conductances
David A. Croydon, Daniel Kious, Carlo Scali
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…
Fluctuation bounds for symmetric random walks on dynamic environments via Russo-Seymour-Welsh
Rangel Baldasso, Marcelo R. Hilario, Daniel Kious +1
In this article, we prove a lower bound for the fluctuations of symmetric random walks on dynamic random environments in dimension in the perturbative regime where the walk…
Scaling limit of critical random trees in random environment
Guillaume Conchon--Kerjan, Daniel Kious, Cécile Mailler
We consider Bienaymé-Galton-Watson trees in random environment, where each generation is attributed a random offspring distribution , and is a sequence o…
The trace-reinforced ants process does not find shortest paths
Daniel Kious, Cécile Mailler, Bruno Schapira
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 an…
Finding geodesics on graphs using reinforcement learning
Daniel Kious, Cécile Mailler, Bruno Schapira
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 tha…
Random Memory Walk
Alexander Fribergh, Daniel Kious, Vladas Sidoravicius +1
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 beha…
Random walk on the simple symmetric exclusion process
Marcelo R. Hilário, Daniel Kious, Augusto Teixeira
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…
The branching-ruin number as critical parameter of random processes on trees
Andrea Collevecchio, Cong Bang Huynh, Daniel Kious
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 C…
Once reinforced random walk on
Daniel Kious, Bruno Schapira, Arvind Singh
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 , with…
Explicit formula for the density of local times of Markov Jump Processes
Ruojun Huang, Daniel Kious, Vladas Sidoravicius +1
In this note we show a simple formula for the joint density of local times, last exit tree and cycling numbers of continuous-time Markov Chains on finite graphs, which involves the…
The branching-ruin number and the critical parameter of once-reinforced random walk on trees
Andrea Collevecchio, Daniel Kious, Vladas Sidoravicius
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforce…
On the speed of once-reinforced biased random walk on trees
Andrea Collevecchio, Mark Holmes, Daniel Kious
We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away fr…
Phase transition for the Once-reinforced random walk on -like trees
Daniel Kious, Vladas Sidoravicius
In this short paper, we consider the Once-reinforced random walk with reinforcement parameter on trees with bounded degree which are transient for the simple random walk. On ea…
Reinforcement learning in social networks
Daniel Kious, Pierre Tarrès
We propose a model of network formation based on reinforcement learning, which can be seen as a generalization as the one proposed by Skyrms for signaling games. On a discrete grap…
Scaling limits for sub-ballistic biased random walks in random conductances
Alexander Fribergh, Daniel Kious
We consider biased random walks in positive random conductances on the d-dimensional lattice in the zero-speed regime and study their scaling limits. We obtain a functional Law of…
Local trapping for elliptic random walks in random environments in
Alexander Fribergh, Daniel Kious
We consider elliptic random walks in i.i.d. random environments on . The main goal of this paper is to study under which ellipticity conditions local trapping occurs.…
Stuck walks: A conjecture of Erschler, Tóth and Werner
Daniel Kious
In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competitio…