Related papers: The structure of combinatorial Markov processes

We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

Motivated by L\'{e}vy's characterization of Brownian motion on the line, we propose an analogue of Brownian motion that has as its state space an arbitrary closed subset of the line that is unbounded above and below: such a process will be…

We study two equivalent characterizations of the strong Feller property for a Markov process and of the associated sub-Markovian semigroup. One is described in terms of locally uniform absolute continuity, whereas the other uses local…

Motivated by networked systems in random environment and controlled hybrid stochastic dynamic systems, this work focuses on modeling and analysis of a class of switching diffusions consisting of continuous and discrete components. Novel…

Consider the set of functions $f_{\theta}(x)=|\theta -x|$ on $\mathbb{R}$. Define a Markov process that starts with a point $x_0 \in \mathbb{R}$ and continues with $x_{k+1}=f_{\theta_{k+1}}(x_{k})$ with each $\theta _{k+1}$ picked from a…

This work focuses on a class of functional stochastic Hamiltonian systems with singular coefficients and state-dependent switching, in which the switching process has a countably infinite state space. First, by Girsanov's transformation, we…

We define a general class of random systems of horizontal and vertical weighted broken lines on the quarter plane whose distribution are proved to be translation invariant. This invariance stems from a reversibility property of the model.…

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…

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…

This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…

We show that a one-dimensional regular continuous Markov process \(\X\) with scale function \(s\) is a Feller--Dynkin process precisely if the space transformed process \(s (X)\) is a martingale when stopped at the boundaries of its state…

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…

We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…

We provide a rather explicit formula for the resolvent of a~concatenation of $N$ processes in terms of their exit laws and certain probability measures characterizing the way the processes are concatenated. As an application, we prove an…

We consider a model for which every site of $\mathbb{N}$ is assigned a fitness in $[0,1]$. At every discrete time all the sites are updated and each site samples a uniform on $[0,1]$, independently of everything else. At every discrete time…

This work focuses on a class of regime-switching jump diffusion processes, which is a two component Markov processes $(X(t),\Lambda(t))$, where $\Lambda(t)$ is a component representing discrete events taking values in a countably infinite…

Kingman derived the Ewens sampling formula for random partitions from the genealogy model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process. M\"ohle described the recursion which…

We construct admissible circulant Laplacian matrix functions as generators for strictly increasing random walks on the integer line. These Laplacian matrix functions refer to a certain class of Bernstein functions. The approach has…

Let X and Y be time-homogeneous Markov processes with common state space E, and assume that the transition kernels of X and Y admit densities with respect to suitable reference measures. We show that if there is a time t>0 such that, for…