English
Related papers

Related papers: An explicit two-source extractor with min-entropy …

200 papers

It is supposed that the exponential multiplier in the method of the non-equilibrium statistical operator (Zubarev`s approach) can be considered as a distribution density of the past lifetime of the system, and can be replaced by an…

Statistical Mechanics · Physics 2009-10-26 V. V. Ryazanov

The min-entropy is a widely used metric to quantify the randomness of generated random numbers, which measures the difficulty of guessing the most likely output. It is difficult to accurately estimate the min-entropy of a non-independent…

Information Theory · Computer Science 2021-12-20 Jiheon Woo , Chanhee Yoo , Young-Sik Kim , Yuval Cassuto , Yongjune Kim

The recent line of study on randomness extractors has been a great success, resulting in exciting new techniques, new connections, and breakthroughs to long standing open problems in several seemingly different topics. These include seeded…

Computational Complexity · Computer Science 2018-04-12 Xin Li

In their 2016 article `Meetings with Lambert $\mathcal{W}$ and Other Special Functions in Optimization and Analysis', Borwein and Lindstrom considered the minimization of an entropy functional utilizing the weighted average of the negative…

Optimization and Control · Mathematics 2018-07-25 Heinz H. Bauschke , Scott B. Lindstrom

Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…

Information Theory · Computer Science 2015-01-14 Alexander Schönhuth

We obtain a power saving in the error term for a semigroup congruence lattice point count related to continued fractions. This is done by adapting arguments from recent work of Oh and Winter (2014) that give uniform bounds for certain…

Number Theory · Mathematics 2015-02-10 Michael Magee , Hee Oh , Dale Winter

We study the problem of extracting randomness from somewhere-random sources, and related combinatorial phenomena: partition analogues of Shearer's lemma on projections. A somewhere-random source is a tuple $(X_1, \ldots, X_t)$ of (possibly…

Combinatorics · Mathematics 2023-06-30 Swastik Kopparty , Vishvajeet N

The remaining min-entropy of a secret generated by fuzzy extraction from a Physical Unclonable Function is typically estimated under the assumption of independent and identically distributed PUF responses, but this assumption does not hold…

Signal Processing · Electrical Eng. & Systems 2020-01-23 Florian Wilde , Christoph Frisch , Michael Pehl

This study focuses on statistical inference for the class of quasi-infinitely divisible (QID) distributions, which was recently introduced by Lindner, Pan and Sato (2018). The paper presents a Fourier approach, based on the analogue of the…

Methodology · Statistics 2026-03-23 Vladimir Panov , Anton Ryabchenko

Consider the set of all sequences of $n$ outcomes, each taking one of $m$ values, that satisfy a number of linear constraints. If $m$ is fixed while $n$ increases, most sequences that satisfy the constraints result in frequency vectors…

Information Theory · Computer Science 2016-11-18 Kostas N. Oikonomou , Peter D. Grunwald

It is usually assumed that $4D$ instantons can only arise in non-Abelian theories. In this paper we re-examine this conventional wisdom by explicitly constructing instantons in an Abelian gauge theory: ${\rm QED}_4$ with $N_f$ flavors of…

High Energy Physics - Theory · Physics 2024-06-26 Csaba Csáki , Rotem Ovadia , Ofri Telem , John Terning , Shimon Yankielowicz

This text contains an alternative presentation, and in certain cases an improvement, of the "hyperbolic dispersive estimate" that was proved by Anantharaman and Nonnenmacher and used to make progress towards the quantum unique ergodicity…

Analysis of PDEs · Mathematics 2010-07-27 Nalini Anantharaman

An "entropy increasing to the maximum" result analogous to the entropic central limit theorem (Barron 1986; Artstein et al. 2004) is obtained in the discrete setting. This involves the thinning operation and a Poisson limit. Monotonic…

Information Theory · Computer Science 2009-11-18 Yaming Yu

For over five decades the procedure termed maximum-entropy (M-E) has been used to sharpen structure in spectra, optical and otherwise. However, this is a contradiction: by modifying data, this approach violates the fundamental M-E…

Applied Physics · Physics 2021-03-10 Long V. Le , Tae J. Kim , Young D. Kim , D. E. Aspnes

We demonstrate two new approaches that have been developed to aid the production of future hard X-ray catalogs, and specifically to reduce the reliance on human intervention during the detection of faint excesses in maps that also contain…

High Energy Astrophysical Phenomena · Physics 2022-01-19 V. A. Lepingwell , A. J. Bird , S. R. Gunn

Compressed Counting (CC)} was recently proposed for approximating the $\alpha$th frequency moments of data streams, for $0<\alpha \leq 2$. Under the relaxed strict-Turnstile model, CC dramatically improves the standard algorithm based on…

Data Structures and Algorithms · Computer Science 2008-08-21 Ping Li

We study the Borwein--Bailey--Girgensohn sinusoidal series S_BBG = sum_{n=1}^\infty (1/n) * ((2+sin n)/3)^n, originally posed as an open problem by Borwein, Bailey, and Girgensohn, whose convergence was established by Boppana using the…

General Mathematics · Mathematics 2026-03-19 Carlos Lopez Zapata

We describe the application of the `low-$\nu$' method to the extraction of the neutrino flux at MiniBooNE energies. As an example, we extract the relative energy dependence of the flux from published MiniBooNE quasielastic scattering cross…

High Energy Physics - Experiment · Physics 2015-06-05 A. Bodek , U. Sarica , K. S. Kuzmin , V. A. Naumov

We consider finite blocklength lossy compression of information sources whose components are independent but non-identically distributed. Crucially, Gaussian sources with memory and quadratic distortion can be cast in this form. We show…

Information Theory · Computer Science 2026-02-11 Eyyup Tasci , Victoria Kostina

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain…

Combinatorics · Mathematics 2007-05-23 I. P. Goulden , Luis G. Serrano