Related papers: Entropy along W_{1,+}-geodesics on graphs
We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…
In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…
We study the entanglement entropy as a probe of the proximity effect of a superconducting system by using the gauge/gravity duality in a fully back-reacted gravity system. While the entanglement entropy in the superconducting phase is less…
Let M be a closed 3-dimensional graph manifold. We prove that h(g)>1 for each geometrization g of M, where h(g) is the topological entropy of geodesic flow of g.
We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…
The concept of entropy rate for a dynamical process on a graph is introduced. We study diffusion processes where the node degrees are used as a local information by the random walkers. We describe analitically and numerically how the degree…
We study entanglement entropy (EE) for a Maxwell field in 2+1 dimensions. We do numerical calculations in two dimensional lattices. This gives a concrete example of the general results of our recent work on entropy for lattice gauge fields…
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…
The first part of the paper explains how to encode a one-cocycle and a two-cocycle on a group $G$ with values in its representation by networks of planar trivalent graphs with edges labelled by elements of $G$, elements of the…
The paper considers the behaviour of the number of paths of length $N$ on graphs with two heavy roots. Such vertices can be entropic traps. Numerical analysis is carried out for graphs with different degrees of root vertices. In the…
We consider partially hyperbolic diffeomorphisms $f$ with a one-dimensional central direction such that the unstable entropy exceeds the stable entropy. Our main result proves that such maps have a finite number of ergodic measures of…
Entropy is a quantity for counting physical degrees of freedom in a system. At a finite temperature, one can use thermal entropy to study thermodynamical properties. At zero temperature, entanglement entropy is expected to provide a…
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
In this note a notion of generalized topological entropy for arbitrary subsets of the space of all sequences in a compact topological space is introduced. It is shown that for a continuous map on a compact space the generalized topological…
The graph entropy describes the structural information of graph. Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
Given a compact topological dynamical system (X, f) with positive entropy and upper semi-continuous entropy map, and any closed invariant subset $Y \subset X$ with positive entropy, we show that there exists a continuous roof function such…
We give an upper bound for the topological entropy of maps on inverse limit spaces in terms of their set-valued components. In a special case of a diagonal map on the inverse limit space $\underleftarrow{\lim}(I,f)$, where every diagonal…
We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we…