English
Related papers

Related papers: Distributional asymptotics mod 1 of $(\log_bn)$

200 papers

It is well known that central order statistics exhibit a central limit behavior and converge to a Gaussian distribution as the sample size grows. This paper strengthens this known result by establishing an entropic version of the CLT that…

Information Theory · Computer Science 2022-05-11 Martina Cardone , Alex Dytso , Cynthia Rush

Consider a standard ${\Lambda }$-coalescent that comes down from infinity. Such a coalescent starts from a configuration consisting of infinitely many blocks at time $0$, but its number of blocks $N_t$ is a finite random variable at each…

Probability · Mathematics 2015-06-05 Vlada Limic , Anna Talarczyk

We study the asymptotic consistency properties of $\alpha$-R\'enyi approximate posteriors, a class of variational Bayesian methods that approximate an intractable Bayesian posterior with a member of a tractable family of distributions, the…

Statistics Theory · Mathematics 2020-08-17 Prateek Jaiswal , Vinayak A. Rao , Harsha Honnappa

It has recently been shown that there are substantial differences in the regularity behavior of the empirical process based on scalar diffusions as compared to the classical empirical process, due to the existence of diffusion local time.…

Probability · Mathematics 2011-05-25 Angelika Rohde , Claudia Strauch

We present a simple analysis of k-means|| (Bahmani et al., PVLDB 2012) -- a distributed variant of the k-means++ algorithm (Arthur and Vassilvitskii, SODA 2007). Moreover, the bound on the number of rounds is improved from $O(\log n)$ to…

Data Structures and Algorithms · Computer Science 2020-07-03 Václav Rozhoň

This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. We develop an Accelerated…

Optimization and Control · Mathematics 2020-06-02 Guannan Qu , Na Li

We present nonasymptotic concentration inequalities for sums of independent and identically distributed random variables that yield asymptotic strong Gaussian approximations of Koml\'os, Major, and Tusn\'ady (KMT) [1975,1976]. The constants…

Probability · Mathematics 2025-10-01 Ian Waudby-Smith , Martin Larsson , Aaditya Ramdas

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…

Combinatorics · Mathematics 2015-04-10 Aleksandar Nikolov , Kunal Talwar

We survey recent results beyond equidistribution of sequences modulo one. We focus on the sequence of angles in a Euclidean lattice in $\mathbb R^2$ and on the sequence $\sqrt n\bmod1 $.

Number Theory · Mathematics 2014-10-17 Ilya Vinogradov

We study mod-$\varphi$ convergence of several probability distributions on the set of positive integers that involve Stirling numbers of both kinds and, as a consequence, derive various limit theorems for these distributions. We also derive…

Probability · Mathematics 2023-01-18 Zakhar Kabluchko , Alexander Marynych , Helmut Pitters

An integro-differential equation governing the evolution of the leading-order B-meson light-cone distribution amplitude is derived. The anomalous dimension in this equation contains a logarithm of the renormalization scale, whose…

High Energy Physics - Phenomenology · Physics 2008-11-26 Bjorn O. Lange , Matthias Neubert

Let $A_N$ be distributed according to the Haar probability measure on the orthogonal group $\mathscr{O}(N)$ for each $N\in\mathbb{N}$. It is well-known that the upper left $m_N\times k_N$ block of $\sqrt{N}A_N$ with $m_Nk_N = o(N)$…

Probability · Mathematics 2025-09-30 Philipp Tuchel

It is known that the M\"obius function in number theory is higher order oscillating. In this paper we show that there is another kind of higher order oscillating sequences in the form $(e^{2\pi i \alpha \beta^{n}g(\beta)})_{n\in \N}$, for a…

Dynamical Systems · Mathematics 2020-06-02 Shigeki Akiyama , Yunping Jiang

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson

The muliplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model for networks where network structure is believed to be shaped by features or attributes associated with individual nodes.…

Social and Information Networks · Computer Science 2018-10-25 Sikai Qu , Armand M. Makowski

We analyze the convergence rate of a simplified version of a popular Gibbs sampling method used for statistical discovery of gene regulatory binding motifs in DNA sequences. This sampler satisfies a very strong form of ergodicity (uniform).…

Statistics Theory · Mathematics 2013-03-13 Dawn B. Woodard , Jeffrey S. Rosenthal

Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of…

Information Theory · Computer Science 2008-03-10 Tadashi Wadayama

We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…

Probability · Mathematics 2007-05-23 Anatolii A. Puhalskii

This report studies local asymptotics of P-splines with $p$th degree B-splines and a $m$th order difference penalty. Earlier work with $p$ and $m$ restricted is extended to the general case. Asymptotically, penalized splines are kernel…

Statistics Theory · Mathematics 2012-06-12 Luo Xiao , Yingxing Li , Tatiyana V. Apanasovich , David Ruppert

We analyze the behavior of stochastic approximation algorithms where iterates, in expectation, progress towards an objective at each step. When progress is proportional to the step size of the algorithm, we prove exponential concentration…

Machine Learning · Statistics 2024-03-26 Kody Law , Neil Walton , Shangda Yang