相关论文: Survival Probabilities of History-Dependent Random…

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

We study branching processes in an i.i.d. random environment, where the associated random walk is of the oscillating type. This class of processes generalizes the classical notion of criticality. The main properties of such branching…

The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…

We introduce a random barrier to a supercritical branching random walk in an i.i.d. random environment $\{\mathcal{L}_n\}$ indexed by time $n,$ i.e., in each generation, only the individuals born below the barrier can survive and reproduce.…

Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…

We introduce a path sampling method for obtaining statistical properties of an arbitrary stochastic dynamics. The method works by decomposing a trajectory in time, estimating the probability of satisfying a progress constraint, modifying…

Let $\{S_n\}$ be a random walk in the domain of attraction of a stable law $\mathcal{Y}$, i.e. there exists a sequence of positive real numbers $(a_n)$ such that $S_n/a_n$ converges in law to $\mathcal{Y}$. Our main result is that the…

For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…

In a recent publication [PRL {\bf 81}, 1142 (1998)] it was argued that a randomly forced particle which collides inelastically with a boundary can undergo inelastic collapse and come to rest in a finite time. Here we discuss the survival…

We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…

Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…

The problem of how many trajectories of a random walker in a potential are needed to reconstruct the values of this potential is studied. We show that this problem can be solved by calculating the probability of survival of an abstract…

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…

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,…

We discuss importance sampling of exit problems that involve unbounded stopping times; examples are mean first passage times, transition rates or committor probabilities in molecular dynamics. The naive application of variance minimization…

A detailed study is presented for a large class of uncoupled continuous-time random walks (CTRWs). The master equation is solved for the Mittag-Leffler survival probability. The properly scaled diffusive limit of the master equation is…

Extreme events are by nature rare and difficult to predict, yet are often much more important than frequent, typical events. An interesting counterpoint to the prediction of such events is their retrodiction -- given a process in an outlier…

This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the…

In this paper we find an upper bound for the probability that a $3$ dimensional simple random walk covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball of radius $N$. For $d\ge 4$, it has been shown in…

In this article, we study branching random walks on graphs modeling division-mutation processes inspired by adaptive immunity. We apply the theory of expander graphs on mutation rules in evolutionary processes and obtain estimates for the…