English
Related papers

Related papers: Takacs' asymptotic theorem and its applications: A…

200 papers

We will use a discrete analogue of the classical \emph{Laplace} method to show that for infinitely many positive integers $n$, the main term of the asymptotic expansions of scaled confluent basic hypergeometric functions, including the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Ruiming Zhang

We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…

Combinatorics · Mathematics 2014-11-14 Igor Kortchemski

We study the tail behavior of the distribution of the sum of asymptotically independent risks whose marginal distributions belong to the maximal domain of attraction of the Gumbel distribution. We impose conditions on the distribution of…

Probability · Mathematics 2009-06-29 Abhimanyu Mitra , Sidney I. Resnick

Stochastic processes play a key role for modeling a huge variety of transport problems out of equilibrium, with manifold applications throughout the natural and social sciences. To formulate models of stochastic dynamics the conventional…

Statistical Mechanics · Physics 2022-07-25 Massimiliano Giona , Andrea Cairoli , Rainer Klages

There remain theoretical gaps in deep neural network estimators for the nonparametric Cox proportional hazards model. In particular, it is unclear how gradient-based optimization error propagates to population risk under partial likelihood,…

Machine Learning · Statistics 2026-03-26 Sattwik Ghosal , Xuran Meng , Yi Li

We consider a positive stationary generalized Ornstein--Uhlenbeck process \[V_t=\mathrm{e}^{-\xi_t}\biggl(\int_0^t\mathrm{e}^{\xi_{s-}}\ ,\mathrm{d}\eta_s+V_0\biggr)\qquadfor t\geq0,\] and the increments of the integrated generalized…

Statistics Theory · Mathematics 2010-02-24 Vicky Fasen

We appeal to results from combinatorial random matrix theory to deduce that various random graph $\mathrm{C}^*$-algebras are asymptotically almost surely Kirchberg algebras with trivial $K_1$. This in particular implies that, with high…

Operator Algebras · Mathematics 2025-05-22 Bhishan Jacelon , Igor Khavkine

While classical chaos has been successfully characterized with consistent theories and intuitive techniques, such as with the use of Lyapunov exponents, quantum chaos is still poorly understood, as well as its relation with multi-partite…

We reconsider a classical, well-studied problem from applied probability. This is the max-sum equivalence of randomly weighted sums, and the originality is because we manage to include interdependence among the primary random variables, as…

Let $A_kA_{k-1}\cdots A_1$ be product of some nonnegative 2-by-2 matrices. In general, its elements are hard to evaluate. Under some conditions, we show that $\forall i,j\in\{1,2\},$ $(A_kA_{k-1}\cdots A_1)_{i,j}\sim…

Probability · Mathematics 2021-02-02 Hongyan Sun , Hua-Ming Wang

In this paper we study the asymptotic behavior of a random uniform parking function $\pi_n$ of size $n$. We show that the first $k_n$ places $\pi_n(1),\dots,\pi_n(k_n)$ of $\pi_n$ are asymptotically i.i.d. and uniform on $\{1,2,\dots,n\}$,…

Probability · Mathematics 2021-08-20 Etienne Bellin

The article studies the almost surely asymptotics of extreme values $\bar{\xi}_n = \max_{1\leq i \leq n} \xi_i$, where $ \xi , \xi_1 , \xi_2 , \ldots$ are discrete identically distributed random variables. One of the main results on this…

Probability · Mathematics 2025-03-27 Kateryna Akbash , Ivan Matsak

Recently, a new decoding rule called jar decoding was proposed; under jar decoding, a non-asymptotic achievable tradeoff between the coding rate and word error probability was also established for any discrete input memoryless channel with…

Information Theory · Computer Science 2012-04-18 En-Hui Yang , Jin Meng

The asymptotic form of the average probability to count $N$ indistinguishable identical particles in a small number $r \ll N$ of binned-together output ports of a $M$-port Haar-random unitary network, proposed recently in \textit{Scientific…

Quantum Physics · Physics 2017-12-06 V. S. Shchesnovich

For a family of random walks $\{S^{(a)}\}$ satisfying $\mathbf{E}S_1^{(a)}=-a<0$ we consider ladder epochs $\tau^{(a)}=\min\{k\geq1: S_k^{(a)}<0\}$. We study the asymptotic, as $a\to0$, behaviour of $\mathbf{P}(\tau^{(a)}>n)$ in the case…

Probability · Mathematics 2009-05-11 Vitali Wachtel

By a classical principle of analysis, sufficiently thin subsequences of general sequences of functions behave like sequences of independent random variables. This observation not only explains the remarkable properties of lacunary…

Number Theory · Mathematics 2014-01-13 Christoph Aistleitner , Istvan Berkes , Robert Tichy

We study the asymptotic behavior of random variables of the form \begin{equation*} E_{\alpha}^i\left(x_1,\ldots,x_n\right)=\sum_{\left(b,d\right)\in \mathit{PH}_i\left(x_1,\ldots,x_n\right)} \left(d-b\right)^{\alpha} \end{equation*} where…

Probability · Mathematics 2018-09-07 Benjamin Schweinhart

Consider the random quadratic form $T_n=\sum_{1 \leq u < v \leq n} a_{uv} X_u X_v$, where $((a_{uv}))_{1 \leq u, v \leq n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal, and $X_1,$ $X_2, \ldots, X_n$ are i.i.d.…

Probability · Mathematics 2019-12-30 Bhaswar B. Bhattacharya , Somabha Mukherjee , Sumit Mukherjee

Cloning, or approximate cloning, is one of basic operations in quantum information processing. In this paper, we deal with cloning of classical states, or probability distribution in asymptotic setting. We study the quality of the…

Quantum Physics · Physics 2011-11-22 Keiji Matsumoto

One of the questions of distribution of prime numbers is considered in the article. It is shown what error is obtained from the assumption that the asymptotic density of a sequence of primes is a probability. Various forms of an analogue of…

General Mathematics · Mathematics 2020-12-17 Victor Volfson