Related papers: A generalized telegraph process with velocity driv…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker visited twice or more. This simple model has…
This paper investigates the position (state) distribution of the single step binomial (multi-nomial) process on a discrete state / time grid under the assumption that the velocity process rather than the state process is Markovian. In this…
The correspondence between the telegraph random process and transport within a binary stochastic Markovian mixture is established. This equivalence is used to derive the distribution function for the transit length, defined as the distance…
We introduce the P\'olya threshold graph model and derive its stochastic and algebraic properties. This random threshold graph is generated sequentially via a two-color P\'olya urn process. Starting from an empty graph, each time step…
Persistent random walks are intermediate transport processes between a uniform rectilinear motion and a Brownian motion. They are formed by successive steps of random finite lengths and directions travelled at a fixed speed. The isotropic…
We shall show in this paper that there are experiments which are Bernoulli trials with success probability p > 0.5, and which have the curious feature that it is possible to correctly predict the outcome with probability > p.
The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…
We study the long-time behavior of variants of the telegraph process with position-dependent jump-rates, which result in a monotone gradient-like drift toward the origin. We compute their invariant laws and obtain, via probabilistic…
Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step,…
In this note, we present some ideas for describing the distributions of the running maximum/minimum, first passage times and telegraphic meanders. Explicit formulae for joint distribution of the extrema, the number of velocity switches and…
Most of the published articles on random motions have been devoted to the study of the telegraph process or its generalizations that describe the random motion in $R^n$ of a single particle in a Markov or semi-Markov medium. However, up to…
The P\'olya urn scheme is a discrete-time process concerning the addition and removal of colored balls. There is a known embedding of it in continuous-time, called the P\'olya process. We deal with a generalization of this stochastic model,…
A telegraph process with an elastic barrier at the origin was studied in [5]; in particular the number of visits of the origin before the absorption is a geometric distributed random variable M. Some asymptotic results (large and moderate…
In this paper we consider the one-dimensional dynamical evolution of a particle traveling at constant speed and performing, at a given rate, random reversals of the velocity direction. The particle is subject to stochastic resetting,…
The Bernoulli convolution with parameter $\lambda\in(0,1)$ is the measure on $\bf R$ that is the distribution of the random power series $\sum\pm\lambda^n$, where $\pm$ are independent fair coin-tosses. This paper surveys recent progress on…
In this paper we present the distribution of the maximum of the asymmetric telegraph process in an arbitrary time interval $[0,t]$ under the conditions that the initial velocity $V(0)$ is either $c_1$ or $-c_2$ and the number of changes of…
We study sums of independent and identically distributed random velocities in special relativity. We show that the resulting one-dimensional velocity distributions are not only stable under relativistic velocity addition but define a…
This article is devoted to methods of construction and study of stochastic models based on Monte Carlo method. A model of Brownian motion, the construction and processing which brings to a world of random numbers and mathematical…
For entropy driven balanced processes we obtain final states with Poisson, Bernoulli, negative binomial and P\'olya distributions. We apply this both for complex networks and particle production. For random networks we follow the evolution…