Related papers: A functional limit theorem for nested Karlin's occ…
In this paper, we utilize the framework of Markov processes to attain a more probabilistic perspective on the theory of transfer operators. In doing so, we establish a functional central limit theorem (FLCT) for an $O(N)$ model associated…
The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1...W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the…
Let $(X_k,\xi_k)_{k\in \mathbb {N}}$ be a sequence of independent copies of a pair $(X,\xi)$ where $X$ is a random process with paths in the Skorokhod space $D[0,\infty)$ and $\xi$ is a positive random variable. The random process with…
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…
The main result of this paper is a functional limit theorem for the sine-process. In particular, we study the limit distribution, in the space of trajectories, for the number of particles in a growing interval. The sine-process has the…
We establish limit theorems for re-scaled occupation time fluctuations of a sequence of branching particle systems in $\R^d$ with anisotropic space motion and weakly degenerate splitting ability. In the case of large dimensions, our limit…
Functional limit theorems for scaled fluctuations of occupation time processes of a sequence of critical branching particle systems in $\R^d$ with anisotropic space motions and strongly degenerated splitting abilities are proved in the…
A controlled branching process (CBP) is a modification of the standard Bienaym\'e-Galton-Watson process in which the number of progenitors in each generation is determined by a random mechanism. We consider a CBP starting from a random…
We introduce a new basic model for independent and identical distributed sequence on the canonical space $(\mathbb{R}^\mathbb{N},\mathcal{B}(\mathbb{R}^\mathbb{N}))$ via probability kernels with model uncertainty. Thanks to the well-defined…
We study three families of labelled plane trees. In all these trees, the root is labelled 0, and the labels of two adjacent nodes differ by $0, 1$ or -1. One part of the paper is devoted to enumerative results. For each family, and for all…
The study of {\em balls-into-bins processes} or {\em occupancy problems} has a long history. These processes can be used to translate realistic problems into mathematical ones in a natural way. In general, the goal of a balls-into-bins…
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…
We study occupancy counts for the critical nearest-neighbor branching random walk on the $d$-dimensional lattice, conditioned on non-extinction. For $d\geq 3$, Lalley and Zheng (2011) showed that the properly scaled joint distribution of…
We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.
We study the limit fluctuations of the rescaled occupation time process of a branching particle system in $\mathbb{R}^d$, where the particles are subject to symmetric $\alpha$-stable migration ($0<\alpha\leq2$), critical binary branching,…
This paper considers a class of non-Markovian discrete-time random processes on a finite state space {1,...,d}. The transition probabilities at each time are influenced by the number of times each state has been visited and by a fixed a…
Let $\{X_k:k\ge1\}$ be a linear process with values in the separable Hilbert space $L_2(\mu)$ given by $X_k=\sum_{j=0}^\infty(j+1)^{-D}\varepsilon_{k-j}$ for each $k\ge1$, where $D$ is defined by $Df=\{d(s)f(s):s\in\mathbb S\}$ for each…
We introduce a new class of balanced allocation processes which are primarily characterized by ``filling'' underloaded bins. A prototypical example is the Packing process: At each round we only take one bin sample, if the load is below the…
A Galton-Watson process in varying environment is a discrete time branching process where the offspring distributions vary among generations. Based on a two-spine decomposition technique, we provide a probabilistic argument of a Yaglom-type…
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…