English
Related papers

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

200 papers

The cutoff phenomenon is an abrupt transition from out of equilibrium to equilibrium undergone by certain Markov processes in the limit where the size of the state space tends to infinity: instead of decaying gradually over time, their…

Probability · Mathematics 2023-07-20 Justin Salez

In this paper we present a model independent analysis method following Bayesian statistics to analyse data from a generic counting experiment and apply it to the search for neutrinos from point sources. We discuss a test statistic defined…

High Energy Astrophysical Phenomena · Physics 2015-06-12 D. Bose , L. Brayeur , M. Casier , K. D. de Vries , G. Golup , N. van Eijndhoven

A theorem of L. Caffarelli implies the existence of a map pushing forward a source Gaussian measure to a target measure which is more log-concave than the source one, which contracts Euclidean distance (in fact, Caffarelli showed that the…

Analysis of PDEs · Mathematics 2011-07-20 Young-Heon Kim , Emanuel Milman

This article establishes the cutoff phenomenon in the Wasserstein distance for systems of nonlinear ordinary differential equations with a unique coercive stable fixed point subject to general additive Markovian noise in the limit of small…

Probability · Mathematics 2023-05-05 Gerardo Barrera , Michael A. Högele , Juan Carlos Pardo

Boshernitzan found a decay condition on the measure of cylinder sets that implies unique ergodicity for minimal subshifts. Interest in the properties of subshifts satisfying this condition has grown recently, due to a connection with the…

Dynamical Systems · Mathematics 2020-06-04 Van Cyr , Bryna Kra

We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford and Fulkerson [1]. We proceed as follows: We select one…

General Mathematics · Mathematics 2010-01-13 Dhananjay P. Mehendale

We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…

Probability · Mathematics 2025-06-11 Umberto De Ambroggio

We develop the method of Maximum Entropy (ME) as a technique to generate approximations to probability distributions. The central results consist in (a) justifying the use of relative entropy as the uniquely natural criterion to select a…

Statistical Mechanics · Physics 2007-07-24 Chih-Yuan Tseng , Ariel Caticha

We describe a construction of explicit affine extractors over large finite fields with exponentially small error and linear output length. Our construction relies on a deep theorem of Deligne giving tight estimates for exponential sums over…

Computational Complexity · Computer Science 2014-01-27 Jean Bourgain , Zeev Dvir , Ethan Leeman

Using the ideas of E.I. Gordon we present and farther advance an approach, based on nonstandard analysis, to simultaneous approximations of locally compact abelian groups and their duals by (hyper)finite abelian groups, as well as to…

Classical Analysis and ODEs · Mathematics 2019-04-02 Pavol Zlatos

Taking only the characteristics as absolute, in the spirit of Arnold's "Geometrical Methods in the Theory of Ordinary Differential Equations" (Springer, 1988), we give an independent of coordinates formulation of general variational entropy…

Analysis of PDEs · Mathematics 2009-12-07 Gheorghe Minea

$2^K$ factorial designs are widely adopted by statisticians and the broader scientific community. In this short note, under the potential outcomes framework (Neyman, 1923; Rubin, 1974), we adopt the partial identification approach and…

Methodology · Statistics 2019-07-18 Jiannan Lu

A new method is presented for the analysis of small angle neutron scattering data from quasi-2D systems such as flux lattices, Skyrmion lattices, and aligned liquid crystals. A significant increase in signal to noise ratio, and a natural…

Other Condensed Matter · Physics 2014-07-23 Alexander T. Holmes

In this paper, we give an easy proof of the main results of Andrews and Clutterbuck's paper [J. Amer. Math. Soc. 24 (2011), no. 3, 899--916], which gives both a sharp lower bound for the spectral gap of a Schr\"oinger operator and a sharp…

Analysis of PDEs · Mathematics 2014-07-03 Yue He

For source sequences of length L symbols we proposed to use a more realistic value to the usual benchmark of number of code letters by source letters. Our idea is based on a quantifier of information fluctuation of a source, F(U), which…

Information Theory · Computer Science 2019-09-27 H. M. de Oliveira , Raydonal Ospina

An iterative randomness extraction algorithm which generalized the Von Neumann's extraction algorithm is detailed, analyzed and implemented in standard C++. Given a sequence of independently and identically distributed biased Bernoulli…

Information Theory · Computer Science 2021-01-08 Claude Gravel

The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…

Information Theory · Computer Science 2025-07-29 Jiachuan Ye , Shitong Wu , Lingyi Chen , Wenyi Zhang , Huihui Wu , Hao Wu

This paper presents a method for reconstructing an acoustic source located in a two-layered medium from multi-frequency phased or phaseless far-field patterns measured on the upper hemisphere. The interface between the two media is assumed…

Numerical Analysis · Mathematics 2024-12-10 Yan Chang , Yukun Guo , Yue Zhao

Scientific modeling applications often require estimating a distribution of parameters consistent with a dataset of observations - an inference task also known as source distribution estimation. This problem can be ill-posed, however, since…

Machine Learning · Computer Science 2024-12-02 Julius Vetter , Guy Moss , Cornelius Schröder , Richard Gao , Jakob H. Macke

This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. Tight general achievability and converse bounds are derived that hold at…

Information Theory · Computer Science 2016-11-15 Victoria Kostina , Sergio Verdú
‹ Prev 1 8 9 10 Next ›