Related papers: Entropy along W_{1,+}-geodesics on graphs

We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…

We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…

Following [6,12], we study coupled map networks over arbitrary finite graphs. An estimate from below for a topological entropy of a perturbed coupled map network via a topological entropy of an unperturbed network by making use of the…

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…

In this paper we study the ergodic theory and thermodynamic formalism of the geodesic flow on non-compact pinched negatively curved manifolds. We consider two notions of entropy at infinity, the topological and the measure theoretic entropy…

We show the equivalences of several notions of entropy, like a version of the topological entropy of the geodesic flow and the Minkowski dimension of the boundary, in metric spaces with convex geodesic bicombings satisfying a uniform…

The entropy of a graph was first introduced by Rashevsky \cite{Rashevsky} and Trucco \cite{Trucco} to interpret as the structural information content of the graph and serve as a complexity measure. In this paper, we first state a number of…

The notion of entropy appears in many fields and this paper is a survey about entropies in several branches of Mathematics. We are mainly concerned with the topological and the algebraic entropy in the context of continuous endomorphisms of…

We investigate the possibility of replacing the topology of convergence in probability with convergence in $L^1$. A characterization of continuous linear functionals on the space of measurable functions is also obtained.

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.

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…

Entropy is a measure of heterogeneity widely used in applied sciences, often when data are collected over space. Recently, a number of approaches has been proposed to include spatial information in entropy. The aim of entropy is to…

In this paper we study the deformation of strictly convex real projective structures on a closed surface. Specially we study the deformation in terms of the entropy on bulging deformations. As a byproduct we construct a sequence of…

We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density…

Convexity properties of the entropy along displacement interpolations are crucial in the Lott-Sturm-Villani theory of lower bounded curvature of geodesic measure spaces. As discrete spaces fail to be geodesic, an alternate analogous theory…

Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…

We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…

We study some new isoperimetric inequalities on graphs. We etablish a relation between the volume entropy (or asymptotic volume), the systole and the first Betti number of weighted graphs. We also find bounds for the volume, associated to…

Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of a graph also known as the communicability. The walk…