相关论文: Notes on the values of the volume entropy

Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…

This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.

Quantifying the complexity of large graphs requires measures that extend beyond predefined structural features and scale efficiently with graph size. This work adopts a generative perspective, modeling large networks as exchangeable graphs…

We introduce the notion of relative volume entropy for two spacetimes with preferred compact spacelike foliations. This is accomplished by applying the notion of Kullback-Leibler divergence to the volume elements induced on spacelike…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

In this paper it is proven that the volume entropy of a riemannian metric evolving by the Ricci flow, if does not collapse, nondecreases. Therefore, it provides a sufficient condition for a solution to collapse. Then, for the limit…

It is shown that for any ensemble, whether classical or quantum, continuous or discrete, there is only one measure of the "volume" of the ensemble that is compatible with several basic geometric postulates. This volume measure is thus a…

A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…

Starting with an entropy that includes volumetric, area and length terms as well as logarithmic contributions, we derive the corresponding modified Newtonian gravity and derive the expression for planetary orbits. We calculate the shift of…

Entropy of matter in a very strong gravity depends on cross-sectional area of the container of the system -- is being further bolstered by calculating entropy of a monoatomic gas kept under uniform strong gravity at Newtonian scale. This…

We consider an entropy-type invariant which measures the polynomial volume growth of submanifolds under the iterates of a map, and we establish sharp uniform lower bounds of this invariant for the following classes of symplectomorphisms of…

We define a Bowen-Series like map for every geometric presentation of a co-compact surface group and we prove that the volume entropy of the presentation is the topological entropy of this particular (circle) map. Finally we find the…

The paper describes an approach to measuring convergence of an algorithm to its result in terms of an entropy-like function of partitions of its inputs of a given length. The goal is to look at the algorithmic data processing from the…

We study evolution equations on metric graphs with reservoirs, that is graphs where a one-dimensional interval is associated to each edge and, in addition, the vertices are able to store and exchange mass with these intervals. Focusing on…

In this paper we study the geodesic flow for a particular class of Riemannian non-compact manifolds with variable pinched negative sectional curvature. For a sequence of invariant measures we are able to prove results relating the loss of…

We study the pressure of the "edge-triangle model", which is equivalent to the cumulant generating function of triangles in the Erd\"os-R\'enyi random graph. By analyzing finite graphs of increasing volume, as well as the graphon…

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…

The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…