Related papers: Between the LIL and the LSL
We address the following question: Can we expand an NIP theory by adding a linear order such that the expansion is still NIP? Easily, if acl(A)=A for all A, then this is true. Otherwise, we give counterexamples. More precisely, there is a…
This short note provides a new and simple proof of the convergence rate for Peng's law of large numbers under sublinear expectations, which improves the corresponding results in Song [15] and Fang et al. [3].
In this note, we establish a compact law of the iterated logarithm under the upper capacity for independent and identically distributed random variables in a sub-linear expectation space. For showing the result, a self-normalized law of the…
In this note we show that the Taylor series of a function in a weighted Dirichlet space is (generalized) N\"orlund summable, provided that the sequence determining the N\"orlund operator is non-decreasing and has finite upper growth rate.…
That the logarithmic distribution manifests itself in the random as well as in the deterministic (multiplication processes) has long intrigued researchers in Benford's Law. In this article it is argued that it springs from one common…
In this work we derive limit theorems for trawl processes. First,we study the asymptotic behaviour of the partial sums of the discretized trawl process $(X_{i\Delta_{n}})_{i=0}^{\lfloor nt\rfloor-1}$, under the assumption that as…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
Let i be a homomorphism of the multiplicative group into a connected reductive algebraic group over C. Let G^i be the centralizer of the image i. Let LG be the Lie algebra of G and let L_nG (n integer) be the summands in the direct sum…
The multiplex network growth literature has been confined to homogeneous growth hitherto, where the number of links that each new incoming node establishes is the same across layers. This paper focuses on heterogeneous growth. We first…
Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…
We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the…
We show the leading digits of a variety of systems satisfying certain conditions follow Benford's Law. For each system proving this involves two main ingredients. One is a structure theorem of the limiting distribution, specific to the…
For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks for bounds on $f(n)$. We resolve the…
We present a simple, unified approach to determining the growth law for the characteristic length scale, $L(t)$, in the phase ordering kinetics of a system quenched from a disordered phase to within an ordered phase. This approach, based on…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
Multivariate distributions are explored using the joint distributions of marginal sample quantiles. Limit theory for the mean of a function of order statistics is presented. The results include a multivariate central limit theorem and a…
We study the so-called nonconventional averages in the context of lattice spin systems, or equivalently random colourings of the integers. For i.i.d. colourings, we prove a large deviation principle for the number of monochromatic…
Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\lceil k/2\rceil $ cycles with consecutive odd lengths. In particular, they showed that this…
Let $(Z_i)_{i\geq 1}$ be an independent, identically distributed sequence of random variables on $\RRR^d$. Under mild conditions on the density of $Z_1$, we provide a nonstandard uniform functional limit law for the following processes on…
Query-to-communication lifting theorems, which connect the query complexity of a Boolean function to the communication complexity of an associated `lifted' function obtained by composing the function with many copies of another function…