Related papers: Supremum of Random Dirichlet Polynomials with Sub-…

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

We prove that the expected value and median of the supremum of $L^2$ normalized random holomorphic fields of degree $n$ on $m$-dimensional K\"ahler manifolds are asymptotically of order $\sqrt{m\log n}$. This improves the prior result of…

The discrete Gaussian $D_{L- t, s}$ is the distribution that assigns to each vector $x$ in a shifted lattice $L - t$ probability proportional to $e^{-\pi \|x\|^2/s^2}$. It has long been an important tool in the study of lattices. More…

The Dirichlet form is a generalization of the Laplacian, heavily used in the study of many diffusion-like processes. In this paper we present a nonstandard representation theorem for the Dirichlet form, showing that the usual Dirichlet form…

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

We revisit the maximum range sum (MaxRS) problem: given a set $P$ of $n$ weighted points in $\mathbb{R}^d$ and a range $Q$ (typically axis-aligned $d$-box or $d$-ball), the goal is to place $Q$ to maximize the total weight of points in…

We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…

This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…

We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved…

We prove new lower bounds for the upper tail probabilities of suprema of Gaussian processes. Unlike many existing bounds, our results are not asymptotic, but supply strong information when one is only a little into the upper tail. We…

Boltzmann sampling is commonly used to uniformly sample objects of a particular size from large combinatorial sets. For this technique to be effective, one needs to prove that (1) the sampling procedure is efficient and (2) objects of the…

Let $\{\xi_n, n\in\Z^d\}$ be a $d$-dimensional array of i.i.d. Gaussian random variables and define $\SSS(A)=\sum_{n\in A} \xi_n$, where $A$ is a finite subset of $\Z^d$. We prove that the appropriately normalized maximum of…

Let $\lambda(n)$ be the Liouville function. We study the distribution of \[ \frac{1}{x^{1/2}}\sum_{x\leq n\leq 2x}\lambda(f(n)) \] over random polynomials $f$ of fixed degree $d$ and coefficients bounded in magnitude by $H$. In particular…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…

Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a $d$-regular graph is maximized by disjoint copies of…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

Deep neural network (DNN) based salient object detection in images based on high-quality labels is expensive. Alternative unsupervised approaches rely on careful selection of multiple handcrafted saliency methods to generate noisy…

We consider the model of directed polymers in a random environment introduced by Petermann : the random walk is $\mathbb{R}^d$-valued and has independent gaussian $N(0,I_d)$-increments, and the random media is a stationary centred Gaussian…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…