Related papers: An explicit two-source extractor with min-entropy …
This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…
We use recent advances in the theory of Furstenberg sets to prove new incidence results of Szemer\'edi--Trotter strength for $\delta$-discretized structures with Cartesian product flavor. We use these results to make progress on a number of…
These notes arose from my Cambridge Part III course on Additive Combinatorics, given in Lent Term 2009. The aim was to understand the simplest proof of the Bourgain-Glibichuk-Konyagin bounds for exponential sums over subgroups. As a…
This work addresses a central challenge in the numerical analysis of the cutoff spatially homogeneous Boltzmann equation: the development of rigorously justified, accurate numerical schemes. We present (i) a novel Fourier spectral method…
The Dirichlet prior is widely used in estimating discrete distributions and functionals of discrete distributions. In terms of Shannon entropy estimation, one approach is to plug-in the Dirichlet prior smoothed distribution into the entropy…
It was recently shown by Lubetzky and Peres (2016) and by Sardari (2018) that Ramanujan graphs, i.e., graphs with the optimal spectrum, exhibit cutoff of the simple random walk in an optimal time and have an optimal almost-diameter. We show…
Exponential families form the backbone of modern statistics and machine learning, but textbooks seldom derive them from first principles in an accessible way. Although minimal sufficiency and the principle of maximum entropy, originating in…
Previous work by Rubinstein and Gao computed the n-level densities for families of quadratic Dirichlet L-functions for test functions where the sum of the supports of the Fourier transforms is at most 2, and showed agreement with random…
Due to the complexity of order statistics, the finite sample behaviour of robust statistics is generally not analytically solvable. While the Monte Carlo method can provide approximate solutions, its convergence rate is typically very slow,…
We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…
We present a method of reliably extracting the flux of individual sources from sky maps in the presence of noise and a source population in which number counts are a steeply falling function of flux. The method is an extension of a standard…
Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…
Expansion and amplification of weak randomness plays a crucial role in many security protocols. Using quantum devices, such procedure is possible even without trusting the devices used, by utilizing correlations between outcomes of parts of…
Sourav Chatterjee, Persi Diaconis, Allan Sly and Lingfu Zhang, prompted by a question of Ramis Movassagh, renewed the study of a process proposed in the early 1980s by Jean Bourgain. A state vector $v \in \mathbb R^n$, labeled with the…
In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound Chakrabarti, Jaffe, Lee, and Vincent for this class, and resolving one side of a conjecture of Gupta, Newman,…
The main contribution of the paper is proving that the Fourier spot volatility estimator introduced in [Malliavin and Mancino, 2002] is consistent and asymptotically efficient if the price process is contaminated by microstructure noise.…
We introduce 2-partitionable clutters as the simplest case of the class of $k$-partitionable clutters and study some of their combinatorial properties. In particular, we study properties of the rank of the incidence matrix of these clutters…
Estimating the entropy rate of discrete time series is a challenging problem with important applications in numerous areas including neuroscience, genomics, image processing and natural language processing. A number of approaches have been…
Building on the idea of numerically integrating differential equations satisfied by Feynman integrals, we propose a novel strategy for handling branch cuts within a numerical framework. We develop an integrator capable of evaluating a basis…