Related papers: An explicit two-source extractor with min-entropy …
For any $N \geq 2$, we show that there are choices of diffusion rates $\{d_i\}_{i=1}^N$ such that for $N$ competing species which are ecologically identical and having distinct diffusion rates, the slowest disperser is able to competitive…
Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of…
The paper deals with the construction of images from visibilities acquired using aperture synthesis instruments: Fourier synthesis, deconvolution, and spectral interpolation/extrapolation. Its intended application is to specific situations…
We develop a quantitative version of Aubry duality and use it to obtain several sharp estimates for the dynamics of Schr\"odinger cocycles associated to a non-perturbatively small analytic potential and Diophantine frequency. In particular,…
We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…
In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on an improved version of Balas' work and can also be used to remove all the redundant…
Shannon entropy is the shortest average codeword length a lossless compressor can achieve by encoding i.i.d. symbols. However, there are cases in which the objective is to minimize the \textit{exponential} average codeword length, i.e. when…
We consider the problem of estimating Shannon's entropy $H$ from discrete data, in cases where the number of possible symbols is unknown or even countably infinite. The Pitman-Yor process, a generalization of Dirichlet process, provides a…
Two remarkable features emerge from the exact Wilsonian procedure for integrating out the high-energy scale in the Hubbard model. At low energies, the number of excitations that couple minimally to the electromagnetic gauge is less than the…
McCuaig (2001, Brace Generation, J. Graph Theory 38: 124-169) proved a generation theorem for braces, and used it as the principal induction tool to obtain a structural characterization of Pfaffian braces (2004, P{\'o}lya's Permanent…
We show that the max entropy algorithm is a randomized 1.49776 approximation for half-integral TSP, improving upon the previous known bound of 1.49993 from Karlin et al. This also improves upon the best-known approximation for half-integral…
We derive a lower bound on the smallest output entropy that can be achieved via vector quantization of a $d$-dimensional source with given expected $r$th-power distortion. Specialized to the one-dimensional case, and in the limit of…
The Shannon entropy is a fundamental measure for quantifying diversity and model complexity in fields such as information theory, ecology, and genetics. However, many existing studies assume that the number of species is known, an…
For a static time slice of AdS$_3$ we describe a particular class of minimal surfaces which form trivalent networks of geodesics. Through geometric arguments we provide evidence that these surfaces describe a measure of multipartite…
A marginal problem asks whether a given family of marginal distributions for some set of random variables arises from some joint distribution of these variables. Here we point out that the existence of such a joint distribution imposes…
Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of…
In the decremental single-source shortest paths problem, the goal is to maintain distances from a fixed source $s$ to every vertex $v$ in an $m$-edge graph undergoing edge deletions. In this paper, we conclude a long line of research on…
We generalize Gaspard's method for computing the \epsilon-entropy production rate in Hamiltonian systems to dissipative systems with attractors considered earlier by T\'el, Vollmer, and Breymann. This approach leads to a natural definition…
We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…
Model independent techniques for constructing background data templates using generative models have shown great promise for use in searches for new physics processes at the LHC. We introduce a major improvement to the CURTAINs method by…