Related papers: The peak sidelobe level of random binary sequences

In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \subseteq {1,2,...,n}$ of leaves…

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…

Let $\{X, X_{n}; n \geq 1 \}$ be a sequence of i.i.d. $\mathbf{B}$-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. This note is devoted to study the classical central limitr theorem for subsequences of sums of…

The modularity of a graph is a parameter that measures its community structure; the higher its value (between $0$ and $1$), the more clustered the graph is. In this paper we show that the modularity of a random $3$-regular graph is at least…

We study the spectral norm of random lifts of matrices. Given an $n\times n$ symmetric matrix $A$, and a centered distribution $\pi$ on $k\times k\ (k\ge 2)$ symmetric matrices with spectral norm at most $1$, let the matrix random lift…

For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the maximum possible size of $r$-multiple-free…

Let $X_1$, $X_2$,... be a sequence of independent random variables with common distribution function $F$ in the domain of attraction of a Gumbel extreme value distribution and for each integer $n\geq 1$, let $X_{1,n} \leq ... X_{n,n}$…

We consider the branch-length estimation problem on a bifurcating tree: a character evolves along the edges of a binary tree according to a two-state symmetric Markov process, and we seek to recover the edge transition probabilities from…

In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…

In this work, we present an $\Omega\left(\min\{\log \Delta, \sqrt{\log n}\}\right)$ lower bound for Maximal Matching (MM) in $\Delta$-ary trees against randomized algorithms. By a folklore reduction, the same lower bound applies to Maximal…

Given a super-critical branching random walk on $\mathbb{R}$ started from the origin, let $Z\_n(\cdot)$ be the counting measure which counts the number of individuals at the $n$-th generation located in a given set. Under some mild…

For a set $A$ of $n$ people and a set $B$ of $m$ items, with each person having a preference list that ranks all items from most wanted to least wanted, we consider the problem of matching every person with a unique item. A matching $M$ is…

Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\…

We study $|A + A|$ as a random variable, where $A \subseteq \{0, \dots, N\}$ is a random subset such that each $0 \le n \le N$ is included with probability $0 < p < 1$, and where $A + A$ is the set of sums $a + b$ for $a,b$ in $A$. Lazarev,…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

This paper quantifies the asymptotic order of the largest singular value of a centered random matrix built from the path of a Block Markov Chain (BMC). In a BMC there are $n$ labeled states, each state is associated to one of $K$ clusters,…

We investigate the maximal size of an increasing subset among points randomly sampled from certain probability densities. Kerov and Vershik's celebrated result states that the largest increasing subset among $N$ uniformly random points on…

Let $\{X_{\mathbf{n}} : \mathbf{n}\in\mathbb{Z}^d\}$ be a weakly dependent stationary field with maxima $M_{A} := \sup\{X_{\mathbf{i}} : \mathbf{i}\in A\}$ for finite $A\subset\mathbb{Z}^d$ and $M_{\mathbf{n}} := \sup\{X_{\mathbf{i}} :…

Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large…