Related papers: Chase-escape with conversion on the complete graph
Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show that such games admit a value even in the presence of…
We consider the one-sided exit problem for (fractionally) integrated random walks and L\'evy processes. We prove that the rate of decrease of the non-exit probability -- the so-called survival exponent -- is universal in this class of…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
We consider the two-dimensional simple random walk conditioned on never hitting the origin, which is,formally speaking, the Doob's $h$-transform of the simple random walk with respect to the potential kernel. We then study the behavior of…
The evasion paths problem asks when a dynamically changing space can be navigated: imagine guards are patrolling a region, for instance, and we need to stay outside their view. We use the Bousfield-Kan spectral sequence for homotopy inverse…
Generalization of the one-dimensional totally asymmetric exclusion process (TASEP) with open boundary conditions in which particles are allowed to jump $l$ sites ahead with the probability $p_l\sim 1/l^{\sigma+1}$ is studied by Monte Carlo…
Quantum walks on undirected graphs have been studied using symmetric matrices, such as the adjacency or Laplacian matrix, and many results about perfect state transfer are known. We extend some of those results to oriented graphs. We also…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
We calculate the survival probability of a stationary target in one dimension surrounded by diffusive or subdiffusive traps of time-dependent density. The survival probability of a target in the presence of traps of constant density is…
We study the discrete-time threshold-$\theta \geq 2$ contact process on random graphs of general degrees. For random graphs with a given degree distribution $\mu$, we show that if $\mu$ is lower bounded by $\theta+2$ and has finite $k$th…
In this paper, we study coherent exciton transport of continuous-time quantum walks on star graph. Exact analytical results of the transition probabilities are obtained by means of the Gram-Schmidt orthonormalization of the eigenstates. Our…
The phase transition of the even offspringed branching and annihilating random walk is studied by N-cluster mean-field approximations on one-dimensional lattices. By allowing to reach zero branching rate a phase transition can be seen for…
We investigate network exploration by random walks defined via stationary and adaptive transition probabilities on large graphs. We derive an exact formula valid for arbitrary graphs and arbitrary walks with stationary transition…
The intersecting pedestrian flow on the 2D lattice with random update rule is studied. Each pedestrian has three moving directions without the back step. Under periodic boundary conditions, an intermediate phase has been found at which some…
We find the formulas of the transition probabilities of the $N$-particle multi-species asymmetric simple exclusion processes (ASEP), and show that the transition probabilities are written as a determinant when the order of particles in the…
We revisit the totally asymmetric simple exclusion process with open boundaries (TASEP), focussing on the recent discovery by de Gier and Essler that the model has a dynamical transition along a nontrivial line in the phase diagram. This…
We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the…
In the present work we prove that given any two unicycle graphs (pseudoforests) that share the same degree sequence there is a finite sequence of 2-switches transforming one into the other such that all the graphs in the sequence are also…
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been…
The totally asymmetric simple exclusion process with generalized update is a version of the discrete time totally asymmetric exclusion process with an additional inter-particle interaction that controls the degree of particle clustering.…