Related papers: A functional central limit theorem for a Markov-mo…
Using the regenerative scheme of Comets, Fern\'andez and Ferrari (2002), we establish a functional central limit theorem (FCLT) for discrete time stochastic processes (chains) with summable memory decay. Furthermore, under stronger…
We present limit theorems for a sequence of Piecewise Deterministic Markov Processes (PDMPs) taking values in a separable Hilbert space. This class of processes provides a rigorous framework for stochastic spatial models in which discrete…
We present normal approximation results at the process level for local functionals defined on dynamic Poisson processes in $\mathbb{R}^d$. The dynamics we study here are those of a Markov birth-death process. We prove functional limit…
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
We obtain functional central limit theorems for both discrete time expressions of the form $1/\sqrt{N}\sum_{n=1}^{[Nt]}(F(X(q_1(n)),\ldots, X(q_{\ell}(n)))-\bar{F})$ and similar expressions in the continuous time where the sum is replaced…
We consider a finite-state, continuous-time Markov process, represented in the "linear framework" by a directed graph with labelled edges which specifies the infinitesimal generator of the process. If the graph is strongly connected, the…
In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…
In this short communication we present a (functional) central limit theorem for the idle process of a one-sided reflected Ornstein-Uhlenbeck proces.
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 growing open Jackson networks where each station is a single-server queue that follows the first-come first-served discipline with Poisson arrivals and exponentially distributed service times, characterized by node-specific rates.…
If $(X^N)_{N=1,2,...}$ is a sequence of Markov processes which solve the martingale problems for some operators $(G^N)_{N=1,2,...}$, it is a classical task to derive a limit result as $N\to\infty$, in particular a weak process limit with…
In this paper, we establish a spatial central limit theorem for a large class of supercritical branching, not necessarily symmetric, Markov processes with spatially dependent branching mechanisms satisfying a second moment condition. This…
We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions…
In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…
We consider a renewal process that is conditioned on the number of events in a fixed time horizon. We prove that a centered and scaled version of this process converges to a Brownian bridge, as the number of events grows large, which relies…
A functional limit theorem is established for the partial-sum process of a class of stationary sequences which exhibit both heavy tails and long-range dependence. The stationary sequence is constructed using multiple stochastic integrals…
This paper establishes limit theorems for a class of stochastic hybrid systems (continuous deterministic dynamic coupled with jump Markov processes) in the fluid limit (small jumps at high frequency), thus extending known results for jump…
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…
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…
We consider a tandem queue with coupled processors, which is subject to global breakdowns. When the network is in the operating mode and both queues are non empty, the total service capacity is shared among the stations according to fixed…