Related papers: The peak sidelobe level of random binary sequences

For a sequence $\{X_{n}, \, n \geqslant 1 \}$ of nonnegative random variables where $\max[\min(X_{n} - s,t),0]$, $t > s \geqslant 0$, satisfy a moment inequality, sufficient conditions are given under which $\sum_{k=1}^n (X_k - \mathbb{E}…

We refine a uniform algebraic approach for deriving upper bounds on reset thresholds of synchronizing automata. We express the condition that an automaton is synchronizing in terms of linear algebra, and obtain upper bounds for the reset…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…

We consider a (random permutation model) binary search tree with n nodes and give asymptotics on the loglog scale for the height H_n and saturation level h_n of the tree as n\to\infty, both almost surely and in probability. We then consider…

In this work, we consider symmetric random Toeplitz matrices $T_n$ generated by i.i.d. zero mean random variables ${X_k}$ satisfying the moment conditions: $E|X_k|^2=1$ and $\E|X_1|^n \le n^{\sqrt{n}}$ for all $n\ge 3$. We prove that the…

In a remarkable paper, Peter Hall [{\it On the rate of convergence of normal extremes}, J. App. Prob, {\bf 16} (1979) 433--439] proved that the supremum norm distance between the distribution function of the normalized maximum of $n$…

In this paper, we investigate the following question: How often is a random matrix normal? We consider a random $n\times n$ matrix, $M_n$, whose entries are i.i.d. Rademacher random variables (taking values $\{ \pm1 \}$ with probability…

Let $X_1,\ldots,X_n$ be independent identically distributed random vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…

This paper shows that the normalized maximum likelihood~(NML) code-length calculated in [1] is an upper bound on the NML code-length strictly calculated for the Gaussian Mixture Model. When we use this upper bound on the NML code-length, we…

For a sequence $\{X_{n}, \, n \geqslant 1 \}$ of random variables satisfying $\mathbb{E} \lvert X_{n} \rvert < \infty$ for all $n \geqslant 1$, a maximal inequality is established, and used to obtain strong law of large numbers for…

The sharpest known high probability generalization bounds for uniformly stable algorithms (Feldman, Vondr\'{a}k, 2018, 2019), (Bousquet, Klochkov, Zhivotovskiy, 2020) contain a generally inevitable sampling error term of order…

We consider the set M_n of all n-truncated power moment sequences of probability measures on [0,1]. We endow this set with the uniform probability. Picking randomly a point in M_n, we show that the upper canonical measure associated with…

We study the maximum of the random assignment process on rectangular matrices. We derive first-order asymptotics for the expected maximum, prove a law of large numbers under mild tail assumptions, and obtain exponential upper bounds for the…

Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are $n$ of them and they are revealed one by one. However, we do not know their values but only their relative ranks. We want to stop on recently…

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

We consider a problem of approximating the size of the largest clique in a graph, with a monotone circuit. Concretely, we focus on distinguishing a random Erd\H{o}s-Renyi graph $\mathcal{G}_{n,p}$, with $p=n^{-\frac{2}{\alpha-1}}$ chosen…

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Jakimiuk et al. (2024) have proved that, if $X$ is an ultra log-concave random variable with integral mean, then $$\max_n \mathbb{P}\{X=n\} \geq \max_n \mathbb{P} \{Z=n\}\,,$$ where $Z$ is a Poisson random variable with the parameter…