Related papers: Exchangeable partitions derived from Markovian coa…
We study the time evolution of quantum entanglement for a specific class of quantum dynamics, namely the locally scrambled quantum dynamics, where each step of the unitary evolution is drawn from a random ensemble that is invariant under…
We establish convergence to the Kingman coalescent for the genealogy of a geographically - or otherwise - structured version of the Wright-Fisher population model with fast migration. The new feature is that migration probabilities may…
This paper gives a new flavor of what Peter Jagers and his co-authors call `the path to extinction'. In a neutral population with constant size $N$, we assume that each individual at time $0$ carries a distinct type, or allele. We consider…
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…
We study a class of Markovian systems of $N$ elements taking values in $[0,1]$ that evolve in discrete time $t$ via randomized replacement rules based on the ranks of the elements. These rank-driven processes are inspired by variants of the…
We consider exchangeable Markov multi-state survival processes -- temporal processes taking values over a state-space$\mathcal{S}$ with at least one absorbing failure state $\flat \in \mathcal{S}$ that satisfy natural invariance properties…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler…
We consider a non-conserving zero-range process with hopping rate proportional to the number of particles at each site. Particles are added to the system with a site-dependent creation rate, and removed from the system with a uniform…
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…
The stochastic theory of non-relativistic quantum mechanics presented here relies heavily upon the theory of stochastic processes, with its definitions, theorems and specific vocabulary as well. Its main hypothesis states indeed that the…
We describe the onset of condensation in the simple model for the balance between selection and mutation given by Kingman in terms of a scaling limit theorem. Loosely speaking, this shows that the wave moving towards genes of maximal…
Cross-Correlation random matrices have emerged as a promising indicator of phase transitions in spin systems. The core concept is that the evolution of magnetization encapsulates thermodynamic information [R. da Silva, Int. J. Mod. Phys. C,…
We develop a new Markov chain on graph partitions that makes relatively global moves yet is computationally feasible to be used as the proposal in the Metropolis-Hastings method. Our resulting algorithm can be made reversible and able to…
We present a flexible Bayesian semiparametric mixed model for longitudinal data analysis in the presence of potentially high-dimensional categorical covariates. Building on a novel hidden Markov tensor decomposition technique, our proposed…
Fragmentation processes are part of a broad class of models describing the evolution of a system of particles which split apart at random. These models are widely used in biology, materials science and nuclear physics, and their asymptotic…
We first study crossing statistics in random connection models (RCM) built on marked Poisson point processes on $\mathbb R^d$. Under general assumptions, we show exponential tail bounds for the number of crossings of a box contained in the…
The embedding problem of Markov transition matrices into continuous-time Markov semigroups is a classic problem that regained a lot of impetus and activities in recent years. We consider it here for the following generalisation of the…
We derive the general form of a master equation describing the interaction of an arbitrary multipartite quantum system, consisting of a set of subsystems, with an environment, consisting of a large number of sub-envirobments. Each subsystem…
We consider Markov chains 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 with probability $\beta_m$ (if the sampled parts are…