اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Central Limit Theorem for Repeating Patterns
175
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This note gives a central limit theorem for the length of the longest subsequence of a random permutation which follows some repeating pattern. This includes the case of any fixed pattern of ups and downs which has at least one of each, such as the alternating case considered by Stanley in [2] and Widom in [3]. In every case considered the convergence in the limit of long permutations is to normal with mean and variance linear in the length of the permutations.
قيم البحث
اقرأ أيضاً
If L is a partition of n, the rank of L is the size of the largest part minus the number of parts. Under the uniform distribution on partitions, Bringmann, Mahlburg, and Rhoades showed that the rank statistic has a limiting distribution. We identify
the limit as the difference between two independent extreme value distributions and as the distribution of B(T) where B(t) is standard Brownian motion and T is the first time that an independent three-dimensional Brownian motion hits the unit sphere. The same limit holds for the crank.
We establish a central limit theorem for (a sequence of) multivariate martingales which dimension potentially grows with the length $n$ of the martingale. A consequence of the results are Gaussian couplings and a multiplier bootstrap for the maximum
of a multivariate martingale whose dimensionality $d$ can be as large as $e^{n^c}$ for some $c>0$. We also develop new anti-concentration bounds for the maximum component of a high-dimensional Gaussian vector, which we believe is of independent interest. The results are applicable to a variety of settings. We fully develop its use to the estimation of context tree models (or variable length Markov chains) for discrete stationary time series. Specifically, we provide a bootstrap-based rule to tune several regularization parameters in a theoretically valid Lepski-type method. Such bootstrap-based approach accounts for the correlation structure and leads to potentially smaller penalty choices, which in turn improve the estimation of the transition probabilities.
We consider the probability distributions of values in the complex plane attained by Fourier sums of the form sum_{j=1}^n a_j exp(-2pi i j nu) /sqrt{n} when the frequency nu is drawn uniformly at random from an interval of length 1. If the coefficien
ts a_j are i.i.d. drawn with finite third moment, the distance of these distributions to an isotropic two-dimensional Gaussian on C converges in probability to zero for any pseudometric on the set of distributions for which the distance between empirical distributions and the underlying distribution converges to zero in probability.
We address the problem of proving a Central Limit Theorem for the empirical optimal transport cost, $sqrt{n}{mathcal{T}_c(P_n,Q)-mathcal{W}_c(P,Q)}$, in the semi discrete case, i.e when the distribution $P$ is finitely supported. We show that the asy
mptotic distribution is the supremun of a centered Gaussian process which is Gaussian under some additional conditions on the probability $Q$ and on the cost. Such results imply the central limit theorem for the $p$-Wassertein distance, for $pgeq 1$. Finally, the semidiscrete framework provides a control on the second derivative of the dual formulation, which yields the first central limit theorem for the optimal transport potentials.
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 particles, we prove a
central limit theorem for the density of the particles, together with upper bounds for the density of the most populated site and the replica overlap.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
