相关论文: Exit Probabilities and Balayage of Constrained Ran…

Let $\tau = (\tau_i : i \in {\Bbb Z})$ denote i.i.d.~positive random variables with common distribution $F$ and (conditional on $\tau$) let $X = (X_t : t\geq0, X_0=0)$, be a continuous-time simple symmetric random walk on ${\Bbb Z}$ with…

Random walks in random scenery are processes defined by $$Z_n:=\sum_{k=1}^n\omega_{S_k}$$ where $S:=(S_k,k\ge 0)$ is a random walk evolving in $\mathbb{Z}^d$ and $\omega:=(\omega_x, x\in{\mathbb Z}^d)$ is a sequence of i.i.d. real random…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

In this paper we develop a perturbation method to predict the rate of occurrence of rare events for singularly perturbed stochastic systems using a probability density function approach. In contrast to a stochastic normal form approach, we…

This paper introduces a new algorithm for numerically computing equilibrium (i.e. stationary) distributions for Markov chains and Markov jump processes with either a very large finite state space or a countably infinite state space. The…

The theory of rapid mixing random walks plays a fundamental role in the study of modern randomised algorithms. Usually, the mixing time is measured with respect to the worst initial position. It is well known that the presence of…

A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…

Time-parallel algorithms, such as Parareal, are well-understood for linear problems, but their convergence analysis for nonlinear, chaotic systems remains limited. This paper introduces a new theoretical framework for analysing…

We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based method that yields approximations to the exit distribution and occupation measure associated with the time of exit from a domain (i.e., the time of first…

We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…

We study the probability of stability of a large complex system of size $N$ within the framework of a generalized May model, which assumes a linear dynamics of each population size $n_i$ (with respect to its equilibrium value): $…

For certain materials science scenarios arising in rubber technology, one-dimensional moving boundary problems (MBPs) with kinetic boundary conditions are capable of unveiling the large-time behavior of the diffusants penetration front,…

Our model is a constrained homogeneous random walk in a nonnegative orthant Z_+^d. The convergence to stationarity for such a random walk can often be checked by constructing a Lyapunov function. The same Lyapunov function can also be used…

The methodology based on the random walk processes is adapted and applied to a comprehensive analysis of the statistical properties of the probability fluxes. To this aim we define a simple model of the Markovian stochastic dynamics on a…

Consider the braid group $B_3=< a,b| aba=bab>$ and the nearest neighbor random walk defined by a probability $\nu$ with support $\{a,a^{-1},b,b^{-1}\}$. The rate of escape of the walk is explicitly expressed in function of the unique…

We consider the approximation of the performance of random walks in the quarter-plane. The approximation is in terms of a random walk with a product-form stationary distribution, which is obtained by perturbing the transition probabilities…

We study the statistics of the number of records $R_n$ for a symmetric, $n$-step, discrete jump process on a $1D$ lattice. At a given step, the walker can jump by arbitrary lattice units drawn from a given symmetric probability…

In this paper, we present a novel iterative Monte Carlo method for approximating the stationary probability of a single state of a positive recurrent Markov chain. We utilize the characterization that the stationary probability of a state…

In this paper, we propose and analyze a novel one-dimensional inhomogeneous random walk model that combines spatial decay of transition probabilities with a temporal renewal structure for each excursion. In this model, the probability of…

Compared to basic fork-join queues, a job in (n, k) fork-join queues only needs its k out of all n sub-tasks to be finished. Since (n, k) fork-join queues are prevalent in popular distributed systems, erasure coding based cloud storages,…