Related papers: Between the LIL and the LSL

Given a Dirichlet series $L(s) = \sum a_n n^{-s}$, the asymptotic growth rate of $\sum_{n\le X} a_n$ can be determined by a Tauberian theorem. Bounds on the error term are typically controlled by the size of $|L(\sigma+it)|$ for fixed real…

We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…

We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the $O(\log\log{n})$, $O(\log^{*}n)$, $O(\log^{**}n)$, and $O(\alpha(n))$ amortized cost upper bounds. The proof of the…

In this work we consider extensions of solvable Lie algebras with naturally graded filiform nilradicals. Note that there exist two naturally graded filiform Lie algebras $n_{n, 1}$ and $Q_{2n}.$ We find all one-dimensional central…

The longest increasing subsequence (LIS) of a sequence of correlated random variables is a basic quantity with potential applications that has started to receive proper attention only recently. Here we investigate the behavior of the length…

A Lie algebra $L$ is said to be $(\Theta_{n},sl_{n})$-graded if it contains a simple subalgebra $\mathfrak{g}$ isomorphic to $sl_{n}$ such that the $\mathfrak{g}$-module $L$ decomposes into copies of the adjoint module, the trivial module,…

The now classical convergence in distribution theorem for well normalized sums ofstationary martingale increments has been extended to multi-indexed martingaleincrements (see Voln\'{y} (2019) and references in there). In the presentarticle…

In this paper, we study lower bounds of a general family of $L$-functions on the $1$-line. More precisely, we show that for any $F(s)$ in this family, there exists arbitrary large $t$ such that $F(1+it)\geq e^{\gamma_F} (\log_2 t + \log_3…

The classical law of the iterated logarithm (LIL for short)as fundamental limit theorems in probability theory play an important role in the development of probability theory and its applications. Strassen (1964) extended LIL to large…

The famous Erd\H{o}s-Gallai Theorem on the Tur\'an number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2m}{n}$ edges. In this note, we first establish a simple but novel extension of…

We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…

We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…

In this article, we discuss when one can extend an r-regular graph to an r + 1 regular by adding edges. Different conditions on the num- ber of vertices n and regularity r are developed. We derive an upper bound of r, depending on n, for…

We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these…

We compute the structure of the Lie algebras associated to two examples of branch groups, and show that one has finite width while the other, the ``Gupta-Sidki group'', has unbounded width. This answers a question by Sidki. More precisely,…

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

Degree distributions of many real networks are known to follow the Mandelbrot law, which can be considered as an extension of the power law and is determined by not only the power-law exponent, but also the shifting coefficient. Although…

We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at most (log|G|)^(2-\eps), the time it takes…

We prove a structure theorem for Lie n-algebras possessing an invariant inner product. We define the notion of a double extension of a metric Lie n-algebra by another Lie n-algebra and prove that all metric Lie n-algebras are obtained from…

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…