Related papers: A consistent Markov partition process generated fr…
We consider piecewise deterministic Markov processes with degenerate transition kernels of the "house-of-cards"-type. We use a splitting scheme based on jump times to prove the absolute continuity, as well as some regularity, of the…
In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…
Fractional Poisson processes, a rapidly growing area of non-Markovian stochastic processes, are useful in statistics to describe data from counting processes when waiting times are not exponentially distributed. We show that the fractional…
A wide class of ``counting'' problems have been studied in Computer Science. Three typical examples are the estimation of - (i) the permanent of an $n\times n$ 0-1 matrix, (ii) the partition function of certain $n-$ particle Statistical…
We consider a Markov chain on the space of (countable) partitions of the interval [0,1], obtained first by size biased sampling twice (allowing repetitions) and then merging the parts (if the sampled parts are distinct) or splitting the…
The paper is concerned with the equilibrium distributions of continuous-time density dependent Markov processes on the integers. These distributions are known typically to be approximately normal, and the approximation error, as measured in…
We study dynamical reversibility in stationary stochastic processes from an information theoretic perspective. Extending earlier work on the reversibility of Markov chains, we focus on finitary processes with arbitrarily long conditional…
The evolution of a continuous time Markov process with a finite number of states is usually calculated by the Master equation - a linear differential equations with a singular generator matrix. We derive a general method for reducing the…
We study measures on random partitions, arising from condensing stochastic particle systems with stationary product distributions. We provide fairly general conditions on the stationary weights, which lead to Poisson-Dirichlet statistics of…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
We present a machine learning model for the analysis of randomly generated discrete signals, modeled as the points of an inhomogeneous, compound Poisson point process. Like the wavelet scattering transform introduced by Mallat, our…
In this paper, we employ Markov process theory to prove asymptotic results for a class of stochastic processes which arise as solutions of a stochastic evolution inclusion and are given by the representation formula \begin{align*}…
We construct a four-parameter family of Markov processes on infinite Gelfand-Tsetlin schemes that preserve the class of central (Gibbs) measures. Any process in the family induces a Feller Markov process on the infinite-dimensional boundary…
We study some combinatorial statistics defined on the set $NC^{(mton)}(n)$ of monotonically ordered non-crossing partitions of {1,...,n}, and on the set $NC_2^{(mton)}(2n)$ of monotonically ordered non-crossing pair-partitions of…
We consider a class of semi-Markov processes (SMP) such that the embedded discrete time Markov chain may be non-homogeneous. The corresponding augmented processes are represented as semi-martingales using stochastic integral equation…
We consider randomly forced 2D Navier-Stokes equations in a bounded domain with smooth boundary. It is assumed that the random perturba- tion is non-degenerate, and its law is periodic in time and has a support localised with respect to…
We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
For a network of discrete states with a periodically driven Markovian dynamics, we develop an inference scheme for an external observer who has access to some transitions. Based on waiting-time distributions between these transitions, the…
We study Markov processes associated with stochastic differential equations, whose non-linearities are gradients of convex functionals. We prove a general result of existence of such Markov processes and a priori estimates on the transition…