Related papers: Game-driven random walks: Survival time statistics
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…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
The distribution of the first positive position reached by a random walker starting from the origin is fundamental for understanding the statistics of extremes and records in one-dimensional random walks. We present a comprehensive study of…
We analyze the dynamics of random walks in which the jumping probabilities are periodic {\it time-dependent} functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary.…
We investigate crossing path probabilities for two agents that move randomly in a bounded region of the plane or on a sphere (denoted $R$). At each discrete time-step the agents move, independently, fixed distances $d_1$ and $d_2$ at angles…
We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a)…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
The objective of the present study is to present a computational model of the motion of a single athlete in a team and to compare the resulting trajectory with experimental data obtained in the field during competitions by match analysis…
Background: This study is mainly motivated by the need of understanding how the diffusion behaviour of a biomolecule (or even of a larger object) is affected by other moving macromolecules, organelles, and so on, inside a living cell,…
The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…
Locally activated random walks are defined as random processes, whose dynamical parameters are modified upon visits to given activation sites. Such dynamics naturally emerge in living systems as varied as immune and cancer cells interacting…
The focus of a survival study is partly on the distribution of survival times, and partly on the health or quality of life of patients while they live. Health varies over time, and survival is the most basic aspect of health, so the two…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…