Related papers: A multiplicative coalescent with asynchronous mult…
We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…
For some discretely observed path of oscillating Brownian motion with level of self-organized criticality $\rho_0$, we prove in the infill asymptotics that the MLE is $n$-consistent, where $n$ denotes the sample size, and derive its limit…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
Let $X^I_n$ be the coalescence time of two particles picked at random from the $n$th generation of a critical Galton-Watson process with immigration, and let $A^I_n$ be the coalescence time of the whole population in the $n$th generation.…
We study three classes of continuous time Markov processes (inclusion process, exclusion process, independent walkers) and a family of interacting diffusions (Brownian energy process). For each model we define a boundary driven process…
A Markov process is registered. At random moment $\theta$ the distribution of observed sequence changes. Using probability maximizing approach the optimal stopping rule for detecting the change is identified. Some explicit solution is…
Consider the standard Poisson process in the first quadrant of the Euclidean plane, and for any point (u,v) of this quadrant take the Young diagram obtained by applying the Robinson-Schensted correspondence to the intersection of the…
Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…
The Ancestral Selection Graph (ASG) is an important genealogical process which extends the well-known Kingman coalescent to incorporate natural selection. We show that the number of lineages of the ASG with and without mutation is…
This paper studies a basic Markov chain, the Burnside process, on the space of flags $G/B$ with $G = GL_n(\mathbb{F}_q)$ and $B$ its upper triangular matrices. This gives rise to a shuffling: a Markov chain on the symmetric group realized…
Inertial particles suspended in many natural and industrial flows undergo coagulation upon collisions and fragmentation if their size becomes too large or if they experience large shear. Here we study this coagulation-fragmentation process…
A $p$-jump process is a piecewise deterministic Markov process with jumps by a factor of $p$. We prove a limit theorem for such processes on the unit interval. Via duality with respect to probability generating functions, we deduce limiting…
We consider a system of $N$ particles on the real line that evolves through iteration of the following steps: 1) every particle splits into two, 2) each particle jumps according to a prescribed displacement distribution supported on the…
Multi-state models are frequently applied for representing processes evolving through a discrete set of state. Important classes of multi-state models arise when transitions between states may depend on the time since entry into the current…
We study reaction-diffusion particle systems with several interaction mechanisms. As the number of particles tends to infinity, the system admits a mean-field limit describing the bulk behaviour. We focus on determining the propagation…
We introduce a family of Markov processes on set partitions with a bounded number of blocks, called Lipschitz partition processes. We construct these processes explicitly by a Poisson point process on the space of Lipschitz continuous maps…
This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed…
Markovian growth-fragmentation processes introduced by Bertoin model a system of growing and splitting cells in which the size of a typical cell evolves as a Markov process $X$ without positive jumps. We find that two growth-fragmentation…
This paper provides conditions under which a non-stationary copula-based Markov process is $\beta$-mixing. We introduce, as a particular case, a convolution-based gaussian Markov process which generalizes the standard random walk allowing…
In this paper we propose a model for open Markov chains that can be interpreted as a system of non-interacting particles evolving according to the rules of a Markov chain. The number of particles in the system is not constant, because we…