Related papers: Central limit approximations for Markov population…
The processes of interplant competition within a field are still poorly understood. However, they explain a large part of the heterogeneity in a field and may have longer-term consequences, especially in mixed stands. Modeling can help to…
Our motivation comes from the large population approximation of individual based models in population dynamics and population genetics. We propose a general method to investigate scaling limits of finite dimensional population size Markov…
The large-time asymptotics of the solutions to a class of degenerate parabolic cross-diffusion systems is analyzed. The equations model the interaction of an arbitrary number of population species in a bounded domain with no-flux boundary…
The goal of this paper is to describe conditions which guarantee a central limit theorem for random variables, which distributions are controled by hidden Markov chains. We proved that when a Markov chain is ergodic and random variables…
We derive a central limit theorem for a spatial $\Lambda$-Fleming-Viot model with fluctuating population size. At each reproduction, a proportion of the population dies and is replaced by a not necessarily equal mass of new individuals. The…
This paper develops new limit theory for data that are generated by networks or more generally display cross-sectional dependence structures that are governed by observable and unobservable characteristics. Strategic network formation…
We consider a supercritical general branching population where the lifetimes of individuals are i.i.d. with arbitrary distribution and each individual gives birth to new individuals at Poisson times independently from each others. The…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
Our purpose is to prove central limit theorem for countable nonhomogeneous Markov chain under the condition of uniform convergence of transition probability matrices for countable nonhomogeneous Markov chain in Ces\`aro sense. Furthermore,…
Adaptive and interacting Markov Chains Monte Carlo (MCMC) algorithms are a novel class of non-Markovian algorithms aimed at improving the simulation efficiency for complicated target distributions. In this paper, we study a general…
In this paper we study the central limit theorem for additive functionals of stationary Markov chains with general state space by using a new idea involving conditioning with respect to both the past and future of the chain. Practically, we…
A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered…
We study a multilayer SIR model with two levels of mixing, namely a global level which is uniformly mixing, and a local level with two layers distinguishing household and workplace contacts, respectively. We establish the large population…
We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…
We consider the approximation of the equilibrium of a metapopulation model, in which a finite number of patches are randomly distributed over a bounded subset $\Omega$ of Euclidean space. The approximation is good when a large number of…
Empirical processes for stationary, causal sequences are considered. We establish empirical central limit theorems for classes of indicators of left half lines, absolutely continuous functions and piecewise differentiable functions. Sample…
We consider the Fleming--Viot particle system associated with a continuous-time Markov chain in a finite space. Assuming irreducibility, it is known that the particle system possesses a unique stationary distribution, under which its…
We consider supercritical branching random walks on transitive graphs and we prove a law of large numbers for the mean displacement of the ensemble of particles, and a Stam-type central limit theorem for the empirical distributions, thus…
We provide a many-to-few formula in the general setting of non-local branching Markov processes. This formula allows one to compute expectations of k-fold sums over functions of the population at k different times. The result generalises…
We consider a class of interacting particle systems with values in $[0,\8)^{\zd}$, of which the binary contact path process is an example. For $d \ge 3$ and under a certain square integrability condition on the total number of the…