Stefan Gerhold, Martin Zeiner
We consider Kemp's q-analogue of the binomial distribution. Several convergence results involving the classical binomial, the Heine, the discrete normal, and the Poisson distribution are established. Some of them are q-analogues of classical convergence properties. Besides elementary estimates, we apply Mellin transform asymptotics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We propose an extension of the Cox-Ross-Rubinstein (CRR) model based on $q$-binomial (or Kemp) random walks, with application to default with logistic failure rates. This model allows us to consider time-dependent switching probabilities varying according to a trend parameter on a non-self-similar binomial tree. In particular, it includes tilt and stretch parameters that control increment sizes. Option pricing formulas are written using $q$-binomial coefficients, and we study the convergence of this model to a Black-Scholes type formula in continuous time. A convergence rate of order $O(N^{-1/…
We analyze the convergence of expected utility under the approximation of the Black-Scholes model by binomial models. In a recent paper by D. Kreps and W. Schachermayer a surprising and somewhat counter-intuitive example was given: such a convergence may, in general, fail to hold true. This counterexample is based on a binomial model where the i.i.d. logarithmic one-step increments have strictly positive third moments. This is the case, when the up-tick of the log-price is larger than the down-tick. In the paper by D. Kreps and W. Schachermayer it was left as an open question how things behave…
The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive linear operators. The proofs in these papers are given using probabilistic methods. We use similar methods, but in analytic terms. In this way we recover some known results and establish several new ones. In particular, we enlarge the list of the limit operators and give characterizations of them.
Strong Convergence of Multiplicative Brownian Motions on the General Linear Group
本文证明了一般线性群上由Driver-Hall-Kemp引入的乘法布朗运动族在维数趋于无穷时，其有限维边缘分布几乎必然强收敛到Hall-Ho引入的自由乘法布朗运动，推广了酉群情形的已有结果。
For a family of linear preferential attachment graphs, we provide rates of convergence for the total variation distance between the degree of a randomly chosen vertex and an appropriate power law distribution as the number of vertices tends to infinity. Our proof uses a new formulation of Stein's method for the negative binomial distribution, which stems from a distributional transformation that has the negative binomial distributions as the only fixed points.
Quantitative Limit Theorems for Cox-Poisson and Cox-Binomial Point Processes
本文采用Stein方法，分别建立了二维平面上Cox-Poisson过程和单位球面上Cox-二项过程向Poisson点过程收敛的显式速率界，为相关逼近误差提供精确控制，可应用于随机几何与空间统计领域。
The convergence of the expectations of Betti numbers of Čech complexes built on binomial point processes in the thermodynamic regime is established.
Narayana numbers appear in many places in combinatorics and probability, and it is known that they are asymptotically normal. Using Stein's method of exchangeable pairs, we provide an error of approximation in total variation to a symmetric binomial distribution of order~$n^{-1}$, which also implies a Kolmogorov bound of order~$n^{-1/2}$ for the normal approximation. Our exchangeable pair is based on a birth-death chain and has remarkable properties, which allow us to perform some otherwise tricky moment computations. Although our main interest is in Narayana numbers, we show that our main abs…
We present a novel reshuffling exchange model and investigate its long time behavior. In this model, two individuals are picked randomly, and their wealth $X_i$ and $X_j$ are redistributed by flipping a sequence of fair coins leading to a binomial distribution denoted $B \circ (X_i+X_j)$. This dynamics can be considered as a natural variant of the so-called uniform reshuffling model in econophysics [2,14]. As the number of individuals goes to infinity, we derive its mean-field limit, which links the stochastic dynamics to a deterministic infinite system of ordinary differential equations. The …
Poisson approximation by coupling
本文利用耦合技术证明二项分布可被泊松分布近似，推广了经典结果，仅需初等概率知识。
In this paper we study a wide and flexible family of discrete distributions, the so-called generalized negative binomial (GNB) distributions that are mixed Poisson distributions in which the mixing laws belong to the class of generalized gamma (GG) distributions. The latter was introduced by E. W. Stacy as a special family of lifetime distributions containing gamma, exponential power and Weibull distributions. These distributions seem to be very promising in the statistical description of many real phenomena being very convenient and almost universal models for the description of statistical r…
We study convexity properties of Rényi entropy as function of $α>0$ on finite alphabets. We also describe robustness of the Rényi entropy on finite alphabets, and it turns out that the rate of respective convergence depends on initial alphabet. We establish convergence of the disturbed entropy when the initial distribution is uniform but the number of events increases to $\infty$ and prove that limit of Rényi entropy of binomial distribution is equal to Rényi entropy of Poisson distribution.
In this paper we establish lower bounds on information divergence from a distribution to certain important classes of distributions as Gaussian, exponential, Gamma, Poisson, geometric, and binomial. These lower bounds are tight and for several convergence theorems where a rate of convergence can be computed, this rate is determined by the lower bounds proved in this paper. General techniques for getting lower bounds in terms of moments are developed.
An analogue of the Berry-Esseen inequality is proved for the speed of convergence of free additive convolutions of bounded probability measures. The obtained rate of convergence is of the order n^{-1/2}, the same as in the classical case. An example with binomial measures shows that this estimate cannot be improved without imposing further restrictions on convolved measures.
Revisiting De Moivre-Laplace
本文通过替换级数展开论证为基本不等式，提供了一个适合本科生的概率论课程中理解的德莫弗-拉普拉斯定理证明，并获得非渐近的二项分布与高斯分布不等式。
In earlier stages in the introduction to asymptotic methods in probability theory, the weak convergence of sequences $(X_n)_{n\geq 1}$ of Binomial of random variables (\textit{rv}'s) to a Poisson law is classical and easy-to prove. A version of such a result concerning sequences $(Y_n)_{n\geq 1}$ of negative binomial \textit{rv}'s also exists. In both cases, $X_n$ and $Y_n-n$ are by-row sums $S_n[X]$ and $S_n[Y]$ of arrays of Bernoulli \textit{rv}'s and corrected geometric \textit{rv}'s respectively. When considered in the general frame of asymptotic theorems of by-row sums of \textit{rv}'s of…
Orthogonal Dice
本文提出自然数上均值等于方差的正交骰子分布族，揭示其丢番图方程解结构、自相似性及泊松极限性质，并用于构造布朗运动及对有界计数系统建模。
For 0 < x < 1, take the binary expansion with infinitely many 0's, replace each 0 with -1, this gives the polarized binary expansion of x. Let R_i(x) be the ith "polarized bit" and let S_n(x) be the sum of the first n R_i(x). {S_n} is the Z-valued random walk on (0,1). Normalize, by dividing each S_n by the square root of n: the resulting sequence converges weakly to the standard normal distribution on (0,1). The quantiles of S_n are random variables on (0,1), denoted S*_n, which are equal in distribution to the S_n, Skorokhod showed that the sequence of normalized quantiles converges almost s…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。