English
Related papers

Related papers: Notes on the values of the volume entropy

200 papers

Entropy functionals are computed for non-stationary distributions of particles of Lorentz gas and hard disks. The distributions consisting of beams of particles are found to have the largest amount of entropy and entropy increase. The…

Statistical Mechanics · Physics 2007-05-23 Maurice Courbage , Seyed Majid Saberi Fathi

In nonequilibrium thermodynamics macroscopic entropy creation plays an important role. Here we study, from various viewpoints, its relation with the phase space contraction, which has been recently proposed as an apparently alternative…

Statistical Mechanics · Physics 2007-05-23 Giovanni Gallavotti

Entropy is a measure of self-information which is used to quantify losses. Entropy was developed in thermodynamics, but is also used to compare probabilities based on their deviating information content. Corresponding model uncertainty is…

Probability · Mathematics 2018-01-23 Alois Pichler , Ruben Schlotter

How to evaluate the importance of nodes is essential in research of complex network. There are many methods proposed for solving this problem, but they still have room to be improved. In this paper, a new approach called local volume…

Social and Information Networks · Computer Science 2022-03-28 Hanwen Li , Qiuyan Shang , Fangzheng Duan , Yong Deng

We study the Weyl formula for the asymptotic number of eigenvalues of the Laplace-Beltrami operator with Dirichlet boundary condition on a Riemannian manifold in the context of geometric flows. Assuming the eigenvalues to be the energies of…

Mathematical Physics · Physics 2023-12-18 Parikshit Dutta , Arghya Chattopadhyay

In this short note, we analyze geometric properties of orbit spaces of certain involutions in dimensions four, five, and six. We consider constructions of $\mathcal{F}$-structures on manifolds of dimension at least four that allows us to…

Differential Geometry · Mathematics 2014-08-08 Rafael Torres

In this paper, we investigate a conformally flat and complete manifold $(M,g)=(\mathbb{R}^n,e^{2u}|dx|^2)$ with finite total Q-curvature. We introduce a new volume entropy, incorporating the background Euclidean metric, and demonstrate that…

Differential Geometry · Mathematics 2024-06-18 Mingxiang Li

We show that the systolic constant, the minimal entropy, and the spherical volume of a manifold depend only on the image of the fundamental class under the classifying map of the universal covering. Moreover, we compute the systolic…

Geometric Topology · Mathematics 2008-01-07 Michael Brunnbauer

Our aim is to study the Total Variation Flow in Metric Graphs. First, we define the functions of bounded variation in Metric Graphs and their total variation, we also give an integration by parts formula. We prove existence and uniqueness…

Analysis of PDEs · Mathematics 2021-12-28 Jose M. Mazon

The entropy of a spherically symmetric distribution of matter in self-equilibrium is calculated. When gravitational effects are neglected, the entropy of the system is proportional to its volume. As effects due to gravitational…

General Relativity and Quantum Cosmology · Physics 2010-05-12 Jonathan Oppenheim

We give entropy estimates for two canonical non commutative shifts on $C^*$-algebras associated to some topological graphs $E=(E^0,E^1,s,r)$, defined using a basis of the corresponding Hilbert bimodule $H(E)$. We compare their entropies…

Operator Algebras · Mathematics 2009-01-05 Valentin Deaconu

Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…

Probability · Mathematics 2021-03-23 Endre Csóka , Viktor Harangi , Bálint Virág

Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…

Combinatorics · Mathematics 2021-03-17 Delio Mugnolo

We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…

Spectral Theory · Mathematics 2024-03-19 James B. Kennedy , Delio Mugnolo , Matthias Täufer

Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…

Disordered Systems and Neural Networks · Physics 2007-05-23 M. Bauer , D. Bernard

The one-body free volume, which determines the entropy of a hard disk system, has extensive (cavity) and intensive (cell) contributions. So far these contributions have not been unified and considered separately. The presented theory…

Soft Condensed Matter · Physics 2024-04-22 V. M. Pergamenshchik

We propose a method to evaluate the entropy density and entropy flux in a vacuum gap between two half-spaces that takes into account influence of near-field effects, i.e., interference, diffraction, and tunneling of waves. The method…

Mesoscale and Nanoscale Physics · Physics 2013-08-21 Arvind Narayanaswamy , Yi Zheng

The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these…

Dynamical Systems · Mathematics 2025-10-23 Samuel Koovely , Alexandre Bovet

The trace over the degrees of freedom located in a subset of the space transforms the vacuum state into a density matrix with non zero entropy. This geometric entropy is believed to be deeply related to the entropy of black holes. Indeed,…

High Energy Physics - Theory · Physics 2014-11-18 H. Casini

An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. When k = 1 the complexity of the problem is polynomial. In this paper, we further find the…

Data Structures and Algorithms · Computer Science 2020-08-14 M. H. Khalifeh , A. -H. Esfahanian
‹ Prev 1 8 9 10 Next ›