Related papers: Game-driven random walks: Survival time statistics
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
During epidemics, the population is asked to Socially Distance, with pairs of individuals keeping two meters apart. We model this as a new optimization problem by considering a team of agents placed on the nodes of a network. Their common…
We study a model of stochastic evolutionary game dynamics in which the probabilities that agents choose suboptimal actions are dependent on payoff consequences. We prove a sample path large deviation principle, characterizing the rate of…
Given a random walk a method is presented to produce a matrix of transition probabilities that is consistent with that random walk. The method is a kind of reverse application of the usual ergodicity and is tested by using a transition…
We consider one dimensional random walks in random environment where every time the process stays at a location, it dies with a fixed probability. Under some mild assumptions it is easy to show that the survival probability goes to zero as…
As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…
Disease outbreaks affect many ecosystems threatening species that also fight against other natural enemies. We investigate a cyclic game system with $5$ species, whose organisms outcompete according to the rules of a generalised spatial…
The evolution of many dynamical systems that describe relationships or interactions between objects can be effectively modeled by temporal networks, which are typically represented as a sequence of static network snapshots. In this paper,…
Complex networks are a great tool for simulating the outcomes of different strategies used within the iterated prisoners' dilemma game. However, because the strategies themselves rely on the connection between nodes, then initial network…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
Models in evolutionary game theory traditionally assume symmetric interactions in homogeneous environments. Here, we consider populations evolving in a heterogeneous environment, which consists of patches of different qualities that are…
Random walks can be used to search complex networks for a desired resource. To reduce search lengths, we propose a mechanism based on building random walks connecting together partial walks (PW) previously computed at each network node.…
We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a…
We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…
We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that,…
We study the disruption process of hierarchical 3-body systems with bodies of comparable mass. Such systems have long survival times that vary by orders of magnitude depending on the initial conditions. By comparing with 3-body numerical…
Consider a collaborative dynamic of $k$ independent random walks on a finite connected graph $G$. We are interested in the size of the set of vertices visited by at least one walker and study how the number of walkers relates to the…
The random order graph streaming model has received significant attention recently, with problems such as matching size estimation, component counting, and the evaluation of bounded degree constant query testable properties shown to admit…