Related papers: Bridges of Markov counting processes: quantitative…
We present a method to sample Markov-chain trajectories constrained to both the initial and final conditions, which we term Markov bridges. The trajectories are conditioned to end in a specific state at a given time. We derive the master…
In this paper our first goal is to give precise definition of the L\'evy bridges with random length. Our second task is to establish the Markov property of this process with respect to its completed natural filtration and thus with respect…
A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
We consider weighted graphs satisfying sub-Gaussian estimate for the natural random walk. On such graphs, we study symmetric Markov chains with heavy tailed jumps. We establish a threshold behavior of such Markov chains when the index…
A study of time homogeneous, real valued Markov processes with a special property and a non-atomic initial distribution is provided. The new notion of a function of evolution of distribution which determines the dependency between one…
We provide quantitative bounds for the long time behavior of a class of Piecewise Deterministic Markov Processes with state space Rd \times E where E is a finite set. The continuous component evolves according to a smooth vector field that…
We consider the filtering problem of estimating a hidden random variable $X$ by noisy observations. The noisy observation process is constructed by a randomised Markov bridge (RMB) $(Z_t)_{t\in [0,T]}$ of which terminal value is set to…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
We propose a method to exactly generate bridge run-and-tumble trajectories that are constrained to start at the origin with a given velocity and to return to the origin after a fixed time with another given velocity. The method extends the…
We consider the down/up crossing property of weighted Markov branching processes. The joint probability distribution of multi crossing numbers of such processes are obtained. In particular, for Markov branching processes, the probability…
Theoretical computer science plays an important role in the understanding of social networks and their properties. We can model information rippling throughout social networks, or the opinions of social media users for example, using graph…
I derive the pointwise conditional means and variances of an arbitrary Gauss-Markov process, given noisy observations of points on a sample path. These moments depend on the process's mean and covariance functions, and on the conditional…
We consider the problem of bounding mean first passage times for a class of continuous-time Markov chains that captures stochastic interactions between groups of identical agents. The quantitative analysis of such probabilistic population…
A formula for the transition density of a Markov process defined by an infinite-dimensional stochastic equation is given in terms of the Ornstein--Uhlenbeck bridge and a useful lower estimate on the density is provided. As a consequence,…
We consider a piecewise-deterministic Markov process governed by a jump intensity function, a rate function that determines the behaviour between jumps, and a stochastic kernel describing the conditional distribution of jump sizes. We study…
This work explores the implications of assuming time symmetry and applying bridge-type, time-symmetric temporal boundary conditions to deterministic laws of nature with random components. The analysis, drawing on the works of Kolmogorov and…
In this note, a general approach to the study of non-stationary Markov chains with catastrophes and the corresponding queuing models is considered, as well as to obtain estimates of the limiting regime itself. As an illustration, an example…
We study the limit behaviour of upper and lower bounds on expected time averages in imprecise Markov chains; a generalised type of Markov chain where the local dynamics, traditionally characterised by transition probabilities, are now…
We study the random acceleration model, which is perhaps one of the simplest, yet nontrivial, non-Markov stochastic processes, and is key to many applications. For this non-Markov process, we present exact analytical results for the…