相关论文: Minimal volume entropy on graphs

In the theory of surface diffeomorphisms relative to homoclinic and heteroclinic orbits, it is possible to compute a one-dimensional representative map for any irreducible isotopy class. The topological entropy of this graph representative…

For any graph, we define a rank-1 operator on a bipartite tensor product space, with components associated to the set of vertices and edges respectively. We show that the partial traces of the operator are the Laplacian and the…

This is a review on entropy in various fields of mathematics and science. Its scope is to convey a unified vision of the classical as well as some newer entropy notions to a broad audience with an intermediate background in dynamical…

We consider the problem of minimizing the number of monochromatic subgraphs of a random graph, when each node of the host graph is assigned one of the two colors. Using a recently discovered contiguity between appearance of strictly…

Carbon nanotube Y-junctions are of great interest to the next generation of innovative multi-terminal nanodevices. Topological indices are graph-theoretically based parameters that describe various structural properties of a chemical…

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…

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…

This paper studies minimal surface entropy (the exponential asymptotic growth of the number of minimal surfaces up to a given value of area) for negatively curved metrics on hyperbolic $3$-manifolds of finite volume, particularly its…

We introduce an axiomatic approach to entropies and relative entropies that relies only on minimal information-theoretic axioms, namely monotonicity under mixing and data-processing as well as additivity for product distributions. We find…

We derive mean-field information Hessian matrices on finite graphs. The "information" refers to entropy functions on the probability simplex. And the "mean-field" means nonlinear weight functions of probabilities supported on graphs. These…

In our derivation of the second law of thermodynamics from the relation of adiabatic accessibility of equilibrium states we stressed the importance of being able to scale a system's size without changing its intrinsic properties. This…

We study a notion of relative entropy for certain hypersurfaces in hyperbolic space. We relate this quantity to the renormalized area introduced by Graham-Witten[RW99]. We also obtain a monotonicity formula for relative entropy applied to…

A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…

We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into account the covert information present in the randomness of packet lengths.…

In this article, we introduce the Sharma-Mittal entropy of a graph, which is a generalization of the existing idea of the von-Neumann entropy. The well-known R{\'e}nyi, Thallis, and von-Neumann entropies can be expressed as limiting cases…

In the context of the chromatic-number problem, a critical graph is an instance where the deletion of any element would decrease the graph's chromatic number. Such instances have shown to be interesting objects of study for deepen the…

We address in this work the problem of minimizing quantum entropies under local constraints. We suppose macroscopic quantities such as the particle density, current, and kinetic energy are fixed at each point of $\Rm^d$, and look for a…

K\"orner introduced the notion of graph entropy in 1973 as the minimal code rate of a natural coding problem where not all pairs of letters can be distinguished in the alphabet. Later it turned out that it can be expressed as the solution…

The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…

In this work we provide a way to introduce a probability measure on the space of minimal fillings of finite additive metric spaces as well as an algorithm for its computation. The values of probability, got from the analytical solution,…