Gopal K Basak, Amites Dasgupta
We construct an independent increments Gaussian process associated to a class of multicolor urn models. The construction uses random variables from the urn model which are different from the random variables for which central limit theorems are available in the two color case.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 infinite urn scheme when the balls are sequentially distributed over an infinite number of urns labelled 1,2,... so that the urn $j$ at every draw gets a ball with probability $p_j$, $\sum_j p_j=1$. We prove functional central limit theorems for discrete time and the poissonised version for the urn occupancies process, for the odd-occupancy and for the missing mass processes extending the known non-functional central limit theorems.
The purpose of this work is to establish a central limit theorem that can be applied to a particular form of Markov chains, including the number of descents in a random permutation of $\mathfrak{S}_n$, two-type generalized P{ó}lya urns, and some other urn models.
For the plain Polya urn with two colors, black and white, we prove a functional central limit theorem for the number of white balls assuming that the initial number of black balls is large. Depending on the initial number of white balls, the limit is either a pure birth process or a diffusion. We also prove analogous results for the q-Polya urn, which is an urn where, when picking a ball, the balls of one color have priority over those of the other.
The asymptotic behaviour of a generalised Pólya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real part is greater than $r/2$, the normalized urn composition is asymptotically normally distributed. However, if there is more than one large eigenvalue, the first few random draws have a non--negligible effect on the evolution of the urn process and almost sure random tendencies of order larger than $\sqrt{n}$ typically prevent a classical central limit theorem. …
The generalized Pòlya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in several applications, specifically in clinical trials. To facilitate mathematical analyses of models in these applications, we introduce an adaptive randomly reinforced urn model that uses accruing statistical information to adaptively skew the urn proportion toward specific targets. We study several probabilistic aspects that are important in implementing the…
In this paper, we prove functional limit theorems for Pólya urn processes whose number of draws and initial number of balls tend to infinity together. This is motivated by recent work of Borovkov [5], where they prove a functional limit theorem for this model when the urn has identity replacement rule. We generalize this result to arbitrary balanced replacement rules (the total number of balls added to the urn is deterministic). Three asymptotic regimes are possible depending on how one lets the number of initial balls scale with the number of draws of the urn. In each regime, we show a first …
We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized Pólya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by flipping a coin. We study the asymptotic behaviour of this urn model, and prove a law of large numbers, a central limit theorem and a functional limit theorem for the proportion of balls into the urn. A phase transition is also stated.
Central Limit Theorem for a Pólya-Friedman Mixed Urn Model
研究一种两色单抽瓮模型，采用混合替换矩阵（Friedman和Pólya替换），证明了抽取n次后1型球比例的中心极限定理，并给出大偏差不等式和重对数律的推论。
We study first order linear partial differential equations that appear, for example, in the analysis of dimishing urn models with the help of the method of characteristics and formulate sufficient conditions for a central limit theorem.
We prove a Central Limit Theorem for the sequence of random compositions of a two-color randomly reinforced urn. As a consequence, we are able to show that the distribution of the urn limit composition has no point masses.
This is a research endeavor in two parts. We study a class of balanced urn schemes on balls of two colours (say white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn, and ball addition rules are applied. We consider these multiple drawings under sampling with or without replacement. We further classify ball addition matrices according to the structure of the expected value into affine and nonaffine classes. We give a necessary and sufficient condition for a scheme to be in the affine subclass. For the affine subclass, we get explicit results for the expected value …
We give a central limit theorem, which has applications to Bayesian statistics and urn problems. The latter are investigated, by paying special attention to multicolor randomly reinforced generalized Polya urns.
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some statistical applications are discussed.
We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different colors. Then under appropriate norming the multivariate distribution of the weak limits of these linear combinations is obtained and independence and dependence issues are investigated.
In this paper we are concerned with hydrodynamics of a class of $N$-urn linear systems, which include voter models, pair-symmetric exclusion processes and binary contact path processes on $N$ urns as special cases. We show that the hydrodynamic limit of our process is driven by a $\left(C[0,1]\right)^\prime$-valued linear ordinary differential equation and the fluctuation of our process, i.e, central limit theorem from the hydrodynamic limit, is driven by a $\left(C[0, 1]\right)^\prime$-valued Ornstein-Uhlenbeck process. To derive above main results, we need several replacement lemmas. An exte…
In this paper, we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the \emph{negatively reinforced} urn scheme. We establish almost sure limit of the random configuration for any \emph{balanced} replacement matrix $R$. In particular, we show that the limiting configuration is uniform on the set of colours, if and only if, $R$ is a \emph{doubly stochastic} matrix. We further establish almost sure limit of the vector of colour counts and prove central…
We consider a variant of the randomly reinforced urn where more balls can be simultaneously drawn out and balls of different colors can be simultaneously added. More precisely, at each time-step, the conditional distribution of the number of extracted balls of a certain color given the past is assumed to be hypergeometric. We prove some central limit theorems in the sense of stable convergence and of almost sure conditional convergence, which are stronger than convergence in distribution. The proven results provide asymptotic confidence intervals for the limit proportion, whose distribution is…
We introduce a general two colour interacting urn model on a finite directed graph, where each urn at a node, reinforces all the urns in its out-neighbours according to a fixed, non-negative and balanced reinforcement matrix. We show that the fraction of balls of either colour converges almost surely to a deterministic limit if either the reinforcement is not of Pólya type or if the graph is such that every vertex with non-zero in-degree can be reached from some vertex with zero in-degree. We also obtain joint central limit theorems, with appropriate scaling, around the vector of limiting prop…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced replacement schemes associated with bounded increment random walks on it. We prove central and local limit theorems for the random color of the $n$-th selected ball and show that irrespective of the null recurrent or transient behavior of the underlying random walks, the asymptotic distribution is Gaussian after appropriate centering and scaling. We show tha…
Stochastic approximation algorithms have been the subject of an enormous body of literature, both theoretical and applied. Recently, Laruelle and Pagès (2013) presented a link between the stochastic approximation and response-adaptive designs in clinical trials based on randomized urn models investigated in Bai and Hu (1999, 2005), and derived the asymptotic normality or central limit theorem for the normalized procedure using a central limit theorem for the stochastic approximation algorithm. However, the classical central limit theorem for the stochastic approximation algorithm does not incl…
For the renormalised sums of the random $\pm 1$-colouring of the connected components of $\mathbb Z$ generated by the coalescing renewal processes in the "power law Pólya's urn" of Hammond and Sheffield we prove functional convergence towards fractional Brownian motion, closing a gap in the tightness argument of their paper. In addition, in the regime of the strong renewal theorem we gain insights into the coalescing renewal processes in the Hammond-Sheffield urn (such as the asymptotic depth of most recent common ancestors) and are able to control the coalescence probabilities of two, three a…
Limit theorems for a class of random outer measures in infinite urn schemes
本文研究了无限尿方案中一类随机外测度的极限定理，通过函数中心极限定理分析了文本概率模型的应用。
This is the second part of a two-part investigation. We continue the study of a class of balanced urn schemes on balls of two colors (white and black). At each drawing, a sample of size $m\ge 1$ is drawn from the urn and ball addition rules are applied; the special case $m=1$ of sampling only a single ball coincides with ordinary balanced urn models. We consider these multiple drawings under sampling with or without replacement. For the class of affine conditional expected value, we study the number of white balls after $n$ steps. The affine class is parametrized by $Λ$, specified by the ratio…
We investigate a special case of infinite urn schemes first considered by Karlin (1967), especially its occupancy and odd-occupancy processes. We first propose a natural randomization of these two processes and their decompositions. We then establish functional central limit theorems, showing that each randomized process and its components converge jointly to a decomposition of certain self-similar Gaussian process. In particular, the randomized occupancy process and its components converge jointly to the decomposition of a time-changed Brownian motion $\mathbb B(t^α), α\in(0,1)$, and the rand…
In this paper we are concerned with a generalized $N$-urn Ehrenfest model, where balls keeps independent random walks between $N$ boxes uniformly laid on $[0, 1]$. After a proper scaling of the transition rates function of the aforesaid random walk, we derive the hydrodynamic limit of the model, i.e., the law of large numbers which the empirical measure of the model follows, under an assumption where the initial number of balls in each box independently follows a Poisson distribution. We show that the empirical measure of the model converges weakly to a deterministic measure with density drive…
We prove a Gaussian process approximation for the sequence of random compositions of a two-color randomly reinforced urn for both the cases with the equal and unequal reinforcement means. By using the Gaussian approximation, the law of the iterated logarithm and the functional limit central limit theorem in both the stable convergence sense and the almost-sure conditional convergence sense are established. Also as a consequence, we are able to to prove that the distribution of the urn composition has no points masses both when the reinforcement means are equal and unequal under the assumption …
Infinite-color randomly reinforced urns with dominant colors
本文定义具有无界颜色数和颜色特定权重的主导 Pólya 随机强化罐，证明预测与经验分布收敛到集中于最大期望强化颜色集的随机概率测度，并给出速率及应用。
On Pólya-Young urn models and growth processes
本文推广了Pólya-Young罐模型，利用噪声增强Bessel过程局部时给出极限律，通过鞅结构得到中心极限定理和重对数律，并建立其与递增树、Stirling排列推广及带竞争中国餐馆过程的联系。
Elephant Random Walks on Coverings of Dipole Graphs
研究双极图覆盖晶格上的大象随机游走，通过多项式尿囊技术和鞅方法分析其统计性质，揭示了在扩散、临界和超扩散 regime 中的极限行为。
We prove a central limit theorem applicable to one dimensional stochastic approximation algorithms that converge to a point where the error terms of the algorithm do not vanish. We show how this applies to a certain class of these algorithms that in particular covers a generalized Pólya urn model, which is also discussed. In addition, we show how to scale these algorithms in some cases where we cannot determine the limiting distribution but expect it to be non-normal.
Complementary asymptotic analysis for a minimal random walk
本文对极小随机游走进行了补充渐近分析，提出了几乎必然中心极限定理的版本和二次强定律的推广，并基于Pólya urn方案提供了泛函极限定理的替代证明。
A functional central limit theorem for weighted occupancy processes of the Karlin model
该论文为 Karlin 模型的加权占用过程建立了泛函中心极限定理，并应用于 $(\alpha,\theta)$-座位中餐馆过程诱导的随机排列极限定理。
Conditional identity in distribution (Berti et al. (2004)) is a new type of dependence for random variables, which generalizes the well-known notion of exchangeability. In this paper, a class of random sequences, called Generalized Species Sampling Sequences, is defined and a condition to have conditional identity in distribution is given. Moreover, a class of generalized species sampling sequences that are conditionally identically distributed is introduced and studied: the Generalized Ottawa sequences (GOS). This class contains a '`randomly reinforced'' version of the Pólya urn and of the Bl…
In this article we shall derive functional limit theorems for the multi-dimensional elephant random walk (MERW) and thus extend the results provided for the one-dimensional marginal by Bercu and Laulin (2019). The MERW is a non-Markovian discrete time-random walk on $\mathbb{Z}^d$ which has a complete memory of its whole past, in allusion to the traditional saying that an elephant never forgets. As the name suggests, the MERW is a $d$-dimensional generalisation of the elephant random walk (ERW), the latter was first introduced by Schütz and Trimper in 2004. We measure the influence of the elep…
On central limit theorems for Ewens-Pitman model
本文基于中国餐馆过程研究了Ewens-Pitman模型中组件数量的中心极限定理，揭示了波动由采样效应和随机渐近频率波动两部分组成，且在极限条件下两者在给定α-多样性下条件独立。
We study discrete-time stochastic processes $(X_t)$ on $[0,\infty)$ with asymptotically zero mean drifts. Specifically, we consider the critical (Lamperti-type) situation in which the mean drift at $x$ is about $c/x$. Our focus is the recurrent case (when $c$ is not too large). We give sharp asymptotics for various functionals associated with the process and its excursions, including results on maxima and return times. These results include improvements on existing results in the literature in several respects, and also include new results on excursion sums and additive functionals of the form…
We obtain Central Limit Theorems in Functional form for a class of time-inhomogeneous interacting random walks on the simplex of probability measures over a finite set. Due to a reinforcement mechanism, the increments of the walks are correlated, forcing their convergence to the same, possibly random, limit. Random walks of this form have been introduced in the context of urn models and in stochastic approximation. We also propose an application to opinion dynamics in a random network evolving via preferential attachment. We study, in particular, random walks interacting through a mean-field r…
Functional central limit theorem for superdiffusive SDEs with stable noise
本文研究了由α-稳定过程驱动的超扩散随机微分方程的功能稳定中心极限定理。
Tree shape statistics provide valuable quantitative insights into evolutionary mechanisms underpinning phylogenetic trees, a commonly used graph representation of evolution systems ranging from viruses to species. By developing limit theorems for a version of extended Pólya urn models in which negative entries are permitted for their replacement matrices, we present strong laws of large numbers and central limit theorems for asymptotic joint distributions of two subtree counting statistics, the number of cherries and that of pitchforks, for random phylogenetic trees generated by two widely use…
We prove a central limit theorem for functionals of two independent $d$-dimensional fractional Brownian motions with the same Hurst index $H$ in $(\frac{2}{d+1},\frac{2}{d})$ using the method of moments.
The central limit theorem of martingales is the fundamental tool for studying the convergence of stochastic processes. The central limit theorem and functional central limit theorem are obtained for martingale like random variables under the sub-linear expectation by Zhang (2019). In this paper, we consider the multi-dimensional martingale like random vectors and establish a functional central limit theorem. As applications, the Lindeberg central limit theorem for independent random vectors is established, and the sufficient and necessary conditions of the central limit theorem for independent…
In this paper we study the almost sure central limit theorem started from a point for additive functionals of a stationary and ergodic Markov chain via a martingale approximation in the almost sure sense. As a consequence we derive the quenched CLT for additive functionals or reversible Markov chains.
Functional central limit theorem for subgraph counts in a dynamic random connection model
本文研究了动态随机连接模型中子图计数的函数中心极限定理，提出了一种动态扩展的累积量方法来证明紧性。
Functional central limit theorems for the dynamic elephant random walk
本文利用鞅收敛定理与Karamata正规变化理论，证明了动态大象随机游动在两种不同尺度下的泛函中心极限定理。
We prove a central limit theorem for an additive functional of the $d$-dimensional fractional Brownian motion with Hurst index $H\in(\frac{1}{2+d},\frac{1}{d})$, using the method of moments, extending the result by Papanicolaou, Stroock and Varadhan in the case of the standard Brownian motion.
In this paper, we establish some functional central limit theorems for a large class of general supercritical superprocesses with spatially dependent branching mechanisms satisfying a second moment condition. In the particular case when the state $E$ is a finite set and the underline motion is an irreducible Markov chain on $E$, our results are superprocess analogs of the functional central limit theorems of \cite{Janson} for supercritical multitype branching processes. The results of this paper are refinements of the central limit theorems in \cite{RSZ3}.
When the underlying random variables are Gaussian, the classical Central Limit Theorem (CLT) is trivial, but the functional CLT is not. The objective of the paper is to investigate the functional CLT for stationary Gaussian processes in the Wasserstein-1 metric on the space of continuous functions. Matching upper and lower bounds are established, indicating that the convergence rate is slightly faster than in the Lévy-Prokhorov metric.
Functional central limit theorem for topological functionals of Gaussian critical points
本文研究高斯临界点拓扑函数的函数中心极限定理，推导出阈值参数变化下的极限定理，并展示固定水平下的CLT及非退化方差结果。
The central limit theorem is, with the strong law of large numbers, one of the two fundamental limit theorems in probability theory. Benjamin Jourdain and Alvin Tse have extended to non-linear functionals of the empirical measure of independent and identically distributed random vectors the central limit theorem which is well known for linear functionals. The main tool permitting this extension is the linear functional derivative, one of the notions of derivation on the Wasserstein space of probability measures that have recently been developed. The purpose of this work is to generalize what h…
We prove a functional central limit theorem for integrals $\int_W f(X(t))\, dt$, where $(X(t))_{t\in\mathbb{R}^d}$ is a stationary mixing random field and the stochastic process is indexed by the function $f$, as the integration domain $W$ grows in Van Hove-sense. We discuss properties of the covariance function of the asymptotic Gaussian process.
Using the regenerative scheme of Comets, Fernández and Ferrari (2002), we establish a functional central limit theorem (FCLT) for discrete time stochastic processes (chains) with summable memory decay. Furthermore, under stronger assumptions on the memory decay, we identify the limiting variance in terms of the process only. As applications, we define classes of binary autoregressive processes and power-law Ising chains for which the FCLT is fulfilled.
The Missing Central Limit Theorems for Local Functionals of Berry's Random Wave Model
针对二维和三维Berry随机波模型，证明了在不断扩大区域上三次Hermite多项式积分的中心极限定理，填补了基于Wiener混沌分解的单色随机波积分泛函极限定理的缺失情形。
This paper develops central limit theorems (CLT's) and large deviations results for additive functionals associated with reflecting diffusions in which the functional may include a term associated with the cumulative amount of boundary reflection that has occurred. Extending the known central limit and large deviations theory for Markov processes to include additive functionals that incorporate boundary reflection is important in many applications settings in which reflecting diffusions arise, including queueing theory and economics. In particular, the paper establishes the partial differentia…
Functional Central limit theorems for microscopic and macroscopic functionals of inhomogeneous random graphs
本文针对有限类型空间上的非齐次随机图，建立了微观类型密度和宏观巨分量观测量的泛函中心极限定理，并推广到最小生成树权重。
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 theorems in the so-called thermodynamic regime. Our results are applicable to several functionals of interest in the stochastic geometry literature, including subgraph and component counts in the random geometric graphs.
We prove a functional non-central limit theorem for jump-diffusions with periodic coefficients driven by strictly stable Levy-processes with stability index bigger than one. The limit process turns out to be a strictly stable Levy process with an averaged jump-measure. Unlike in the situation where the diffusion is driven by Brownian motion, there is no drift related enhancement of diffusivity.
We consider a non-nestling random walk in a product random environment. We assume an exponential moment for the step of the walk, uniformly in the environment. We prove an invariance principle (functional central limit theorem) under almost every environment for the centered and diffusively scaled walk. The main point behind the invariance principle is that the quenched mean of the walk behaves subdiffusively.
Rate of Convergence in the Functional Central Limit Theorem for Stable Processes
本文量化了重尾随机游走经缩放后向稳定过程收敛的功能性，推广了无限维稳定随机变量的广义中心极限定理，证明了在控制随机游走与极限稳定过程及其相应仿射插值之间关系的前提下，可将多变量分布的收敛速度提升到某些函数空间中的收敛速度。
The paper establishes a functional version of the Hoeffding combinatorial central limit theorem. First, a pre-limiting Gaussian process approximation is defined, and is shown to be at a distance of the order of the Lyapounov ratio from the original random process. Distance is measured by comparison of expectations of smooth functionals of the processes, and the argument is by way of Stein's method. The pre-limiting process is then shown, under weak conditions, to converge to a Gaussian limit process. The theorem is used to describe the shape of random permutation tableaux.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。