Related papers: The Spacey Random Walk: a Stochastic Process for H…
The paper deals with a certain class of random evolutions. We develop a construction that yields an invariant measure for a continuous-time Markov process with random transitions. The approach is based on a particular way of constructing…
In this paper, we first extend the celebrated PageRank modification to a higher-order Markov chain. Although this system has attractive theoretical properties, it is computationally intractable for many interesting problems. We next study a…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov chain is usually regularised by adding a…
We are studying stationary random processes with conditional polynomial moments that allow a continuous path modification. Processes with continuous path modification, are important because they are relatively easy to simulate. One does not…
Stochastic systems characterised by a random driving in a form of the general stable noise are considered. The particle experiences long rests due to the traps the density of which is position-dependent and obeys a power-law form attributed…
In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…
Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been…
We study convergence to equilibrium for a large class of Markov chains in random environment. The chains are sparse in the sense that in every row of the transition matrix $P$ the mass is essentially concentrated on few entries. Moreover,…
Path-wise observables--functionals of stochastic trajectories--are at the heart of time-average statistical mechanics and are central to thermodynamic inequalities such as uncertainty relations, speed limits, and correlation-bounds. They…
This paper motivates the use of random-bridges -- stochastic processes conditioned to take target distributions at fixed timepoints -- in the realm of generative modelling. Herein, random-bridges can act as stochastic transports between two…
We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…
A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local "random-to-front" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the…
Continuous time random walks and Langevin equations are two classes of stochastic models for describing the dynamics of particles in the natural world. While some of the processes can be conveniently characterized by both of them, more…
Let $(M,d,\mu)$ be a uniformly discrete metric measure space satisfying space homogeneous volume doubling condition. We consider discrete time Markov chains on $M$ symmetric with respect to $\mu$ and whose one-step transition density is…
A Markovian single-server queue is studied in an interactive random environment. The arrival and service rates of the queue depend on the environment, while the transition dynamics of the random environment depends on the queue length. We…
A Markov chain (MC) formalism is used to investigate the mean-square displacement (MSD) of a random walker on Newman-Watts (NW) networks. It leads to a precise analysis of the conditions for the emergence of anomalous sub- or…
The paper deals with non-linear Poisson neuron network models with bounded memory dynamics, that can include both Hebbian learning mechanisms and refractory periods. The state of a network is described by the times elapsed since its neurons…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
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…