English
Related papers

Related papers: Connecting Max-entropy With Computational Geometry…

200 papers

Recently, Carlip proposed a derivation of the entropy of the two-dimensional dilatonic black hole by investigating the Virasoro algebra associated with a newly introduced near-horizon conformal symmetry. We point out not only that the…

High Energy Physics - Theory · Physics 2014-11-18 Gungwon Kang , Jun-ichirou Koga , Mu-In Park

We discuss a relation between the Kantorovich-Wasserstein (KW) metric and the Kullback-Leibler (KL) divergence. The former is defined using the optimal transport problem (OTP) in the Kantorovich formulation. The latter is used to define…

Information Theory · Computer Science 2019-08-27 Roman V. Belavkin

We extend the study of finite-entanglement scaling from one-dimensional gapless models to two-dimensional systems with a Fermi surface. In particular, we show that the entanglement entropy of a contractible spatial region with linear size…

Strongly Correlated Electrons · Physics 2024-01-11 Quinten Mortier , Ming-Hao Li , Jutho Haegeman , Nick Bultinck

Given probability distributions ${\bf p}=(p_1,p_2,\ldots,p_m)$ and ${\bf q}=(q_1,q_2,\ldots, q_n)$ with $m,n\geq 2$, denote by ${\cal C}(\bf p,q)$ the set of all couplings of $\bf p,q$, a convex subset of $\R^{mn}$. Denote by ${\cal…

Probability · Mathematics 2025-05-20 Ya-Jing Ma , Feng Wang , Xian-Yuan Wu , Kai-Yuan Cai

The entanglement entropy in a quantum field theory between two regions of space has been shown in simple cases to be proportional to the volume of the hypersurface separating the regions. We prove that this is true for a free scalar field…

High Energy Physics - Theory · Physics 2008-11-26 Micheal S. Berger , Roman V. Buniy

Formalising the confrontation of opinions (models) to observations (data) is the task of Inferential Statistics. Information Theory provides us with a basic functional, the relative entropy (or Kullback-Leibler divergence), an asymmetrical…

Information Theory · Computer Science 2015-03-13 François Bavaud

Given a probability distribution ${\bf p} = (p_1, \dots, p_n)$ and an integer $1\leq m < n$, we say that ${\bf q} = (q_1, \dots, q_m)$ is a contiguous $m$-aggregation of ${\bf p}$ if there exist indices $0=i_0 < i_1 < \cdots < i_{m-1} < i_m…

Information Theory · Computer Science 2018-05-16 Ferdinando Cicalese , Ugo Vaccaro

This paper focuses on multi-block optimization problems over transport polytopes, which underlie various applications including strongly correlated quantum physics and machine learning. Conventional block coordinate descent-type methods for…

Optimization and Control · Mathematics 2024-08-27 Yukuan Hu , Mengyu Li , Xin Liu , Cheng Meng

We carry out a systematic study of entanglement entropy in relativistic quantum field theory. This is defined as the von Neumann entropy S_A=-Tr rho_A log rho_A corresponding to the reduced density matrix rho_A of a subsystem A. For the…

High Energy Physics - Theory · Physics 2011-02-16 Pasquale Calabrese , John Cardy

In connection with the Entropy Conjecture it is known that the topological entropy of a continuous graph map is bounded from below by the spectral radius of the induced map on the first homology group. We show that in the case of a…

Dynamical Systems · Mathematics 2007-05-23 João F. Alves , Roman Hric , José Sousa Ramos

Relative entropy is a fundamental class of distances between probability distributions, with widespread applications in probability theory, statistics, and machine learning. In this work, we study relative entropy from a categorical…

Logic in Computer Science · Computer Science 2026-03-06 Ralph Sarkis , Fabio Zanasi

One way of getting insight into non-Gaussian measures, posed on infinite dimensional Hilbert spaces, is to first obtain best fit Gaussian approximations, which are more amenable to numerical approximation. These Gaussians can then be used…

Numerical Analysis · Mathematics 2019-05-23 Gideon Simpson , Daniel Watkins

We combine two methods for the lossless compression of unlabeled graphs - entropy compressing adjacency lists and computing canonical names for vertices - and solve an ensuing novel optimisation problem: Minimum-Entropy Tree-Extraction…

Data Structures and Algorithms · Computer Science 2026-03-17 Ziad Ismaili Alaoui , Tamio-Vesa Nakajima , Namrata , Sebastian Wild

The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distributed storage, and space-time coding. A central problem is to…

Information Theory · Computer Science 2026-05-01 Aida Abiad , Antonina P. Khramova , Sven C. Polak , Ferdinando Zullo

We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.

chao-dyn · Physics 2009-10-22 N. J. Balmforth , E. A. Spiegel , C. Tresser

It is shown that solutions to the anisotropic least gradient problem for boundary data $f \in L^p(\partial\Omega)$ lie in $L^{\frac{Np}{N-1}}(\Omega)$; the exponent is shown to be optimal. Moreover, the solutions are shown to be locally…

Analysis of PDEs · Mathematics 2019-04-26 Wojciech Górny

Computational complexity is a particularly important objective. The idea of Landauer principle was extended through mapping three classic problems (sorting,ordered searching and max of N unordered numbers) into Maxwell demon thought…

Computational Complexity · Computer Science 2014-12-04 Feng Pan , Heng-liang Zhang , Qi Jie

Let $A = -{\rm div} \,a(\cdot) \nabla$ be a second order divergence form elliptic operator on $\R^n$ with bounded measurable real-valued coefficients and let $W$ be a cylindrical Brownian motion in a Hilbert space $H$. Our main result…

Classical Analysis and ODEs · Mathematics 2014-02-21 Pascal Auscher , Jan van Neerven , Pierre Portal

We define a one-parameter family of entropies, each assigning a real number to any probability measure on a compact metric space (or, more generally, a compact Hausdorff space with a notion of similarity between points). These entropies…

Metric Geometry · Mathematics 2020-12-17 Tom Leinster , Emily Roff

We prove existence of maximal entropy measures for an open set of non-uniformly expanding local diffeomorphisms on a compact Riemannian manifold. In this context the topological entropy coincides with the logarithm of the degree, and these…

Dynamical Systems · Mathematics 2007-05-23 Krerley Oliveira , Marcelo Viana
‹ Prev 1 8 9 10 Next ›