Related papers: On Random Walks and Diffusions Related to Parrondo…
The sampling of the configuration space in diffusion Monte Carlo (DMC) is done using walkers moving randomly. In a previous work on the Hubbard model [\href{https://doi.org/10.1103/PhysRevB.60.2299}{Assaraf et al.~Phys.~Rev.~B \textbf{60},…
In this paper we discuss the diffusion of serious games and present reasons for why Rogers traditional approach is limited in this context. We present an alternative overview through the characteristics of relative advantage, compatibility,…
We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
Several authors have implied that the original inspiration for Parrondo's games was a physical system called a ``flashing Brownian ratchet''. The relationship seems to be intuitively clear but, surprisingly, has not yet been established…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We consider random walkers that deform the medium as they move, enabling a faster motion in regions which have been recently visited. This induces an effective attraction between walkers mediated by the medium, which can be regarded as a…
We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
From the gambling logs of an online lottery game we extract the probability distribution of various quantities (e.g., bet value, total pool size, waiting time between successive gambles) as well as related correlation coefficients. We view…
We study the minimal random walk introduced by Kumar, Harbola and Lindenberg. It is a random process on $\{0, 1, \ldots \}$ with unbounded memory which exhibits subdiffusive, diffusive and superdiffusive regimes. We prove the law of large…
We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. As…
This survey is concerned with random walks on mapping class groups. We illustrate how the actions of mapping class groups on Teichm\"uller spaces or curve complexes reveal the nature of random walks, and vice versa. Our emphasis is on the…
Combinatorial Game Theory typically studies sequential rulesets with perfect information where two players alternate moves. There are rulesets with {\em entailing moves} that break the alternating play axiom and/or restrict the other…
We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…