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

We generalize the definition of topological entropy due to Adler, Konheim, and McAndrew \cite{AKM} to set-valued functions from a closed subset $A$ of the interval to closed subsets of the interval. We view these set-valued functions, via…

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…

We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…

To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra…

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…

Using Matrix theory, we propose a technique on how to compute the entangle- ment entropy between a supergravity probe and modes on a spherical membrane. We demonstrate that a membrane stretched between the probe and the sphere entangles…

We study topological properties of the graph topology.

The (measure-theoretical) entropy of a diffeomorphism along an expanding invariant foliation is the rate of complexity generated by the diffeomorphism along the leaves of the foliation. We prove that this number varies upper…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

We construct ergodic probability measures with infinite metric entropy for typical continuous maps and homeomorphisms on compact manifolds. We also construct sequences of such measures that converge to a zero-entropy measure.

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)$.…

Performing signal processing over graphs requires knowledge of the underlying fixed topology. However, graphs often grow in size with new nodes appearing over time, whose connectivity is typically unknown; hence, making more challenging the…

Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into…

Coarse geometry studies metric spaces on the large scale. Our goal here is to study dynamics from a coarse point of view. To this end we introduce a coarse version of topological entropy, suitable for unbounded metric spaces, consistent…

We study damped hyperbolic equations on the infinite line. We show that on the global attracting set $G$ the $\epsilon$-entropy (per unit length) exists in the topology of $W^{1,\infty}$. We also show that the topological entropy per unit…

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

The first aims of this work are to endorse the advent of finitely additive set functions as equilibrium states and the possibility to replace the metric entropy by an upper semi-continuous map associated to a general variational principle.…

We define notions of local topological convergence and local geometric convergence for embedded graphs in $\mathbb{R}^n,$ and study their properties. The former is related to Benjamini-Schramm convergence, and the latter to weak convergence…

The entropy of a graph is a functional depending both on the graph itself and on a probability distribution on its vertex set. This graph functional originated from the problem of source coding in information theory and was introduced by J.…

Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random…