6 papers · 1 filter
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…