Related papers: An explicit two-source extractor with min-entropy …
We prove a uniform spectral gap for complex transfer operators near the critical line associated to overlapping $C^2$ iterated function systems on the real line satisfying a Uniform Non-Integrability (UNI) condition. Our work extends that…
We consider the inverse problem of determining an unknown vectorial source current distribution associated with the homogeneous Maxwell system. We propose a novel non-iterative reconstruction method for solving the aforementioned inverse…
We consider filters for the detection and extraction of compact sources on a background. We make a one-dimensional treatment (though a generalization to two or more dimensions is possible) assuming that the sources have a Gaussian profile…
Introduced by Lu and Yau (CMP, 1993), the martingale decomposition method is a powerful recursive strategy that has produced sharp log-Sobolev inequalities for homogeneous particle systems. However, the intractability of certain covariance…
The ongoing unprecedented exponential explosion of available computing power, has radically transformed the methods of statistical inference. What used to be a small minority of statisticians advocating for the use of priors and a strict…
We have imaged a $\sim$6 arcminute$^2$ region in the Bo\"otes Deep Field using the 350 $\mu$m-optimised second generation Submillimeter High Angular Resolution Camera (SHARC II), achieving a peak 1$\sigma$ sensitivity of $\sim$5 mJy. We…
Given a pair of intermediate $C^*$-subalgebras of a unital inclusion of simple $C^*$-algebras with a conditional expectation of finite Watatani index, we discuss the corresponding angle operator and its Fourier transform. We provide a…
In this paper we compute the leading correction to the bipartite entanglement entropy at large sub-system size, in integrable quantum field theories with diagonal scattering matrices. We find a remarkably universal result, depending only on…
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion to general discrete-time memoryless channels and shows that…
The fluctuation theorem for entropy production is a remarkable symmetry of the distribution of produced entropy that holds universally in non-equilibrium steady states with Markovian dynamics. However, in systems with slow degrees of…
The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First,…
In this work we present several quantitative results of convergence to equilibrium for the linear Boltzmann operator with soft potentials under Grad's angular cutoff assumption. This is done by an adaptation of the famous entropy method and…
In this paper, we establish the entropy-entropy production estimate for the ES-BGK model, a generalized version of the BGK model of the Boltzmann equation introduced for better approximation in the Navier-Stokes limit. Our result improves…
Given a set of discrete probability distributions, the minimum entropy coupling is the minimum entropy joint distribution that has the input distributions as its marginals. This has immediate relevance to tasks such as entropic causal…
Recent findings suggest that abnormal operating conditions of equipment in the oil and gas supply chain represent a large fraction of anthropogenic methane emissions. Thus, effective mitigation of emissions necessitates rapid identification…
De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over $n$-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping $n-1$ to $n$ bit strings), can be…
We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\mu$, admits a density over $\mathbb{R}^d$. For a semi-concave cost function…
The textbook algorithm for real-weighted single-source shortest paths takes $O(m n)$ time on a graph with $m$ edges and $n$ vertices. The breakthrough algorithm by Fineman [Fin24] takes $\tilde{O}(m n^{8/9})$ randomized time. The running…
The first results from Double Chooz with 100 days of data measured $\sin^2(2\theta_{13}) = 0.086 \pm 0.051$. Backgrounds contribute significantly to the systematic uncertainty budget. Using the incoming neutrino directionality we will…
In the analysis of any type of system, granting maximum information extraction from its data is non-trivial. Confidence in successful information extraction typically builds on prior knowledge of the studied system or on the user's…