Related papers: Volume entropy, systole and stable norm on graphs

We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

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.

This paper presents a formal definition of stability for node centrality measures in weighted graphs. It is shown that the commonly used measures of degree, closeness and eigenvector centrality are stable whereas betweenness centrality is…

Let $(M,g)$ be a compact manifold with Ricci curvature almost bounded from below and $\pi:\bar{M}\to M$ be a normal, Riemannian cover. We show that, for any nonnegative function $f$ on $M$, the means of $f\o\pi$ on the geodesic balls of…

We present some new nonparametric estimators of entropies and we establish almost sure consistency and central limit Theorems for some of the most important entropies in the discrete case. Our theorical results are validated by simulations.

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 family of graphs we call dual systolic graphs. This definition comes from graphs that are duals of systolic simplicial complexes. Our main result is a sharp (up to constants) isoperimetric inequality for dual systolic graphs.…

The systole of a hyperbolic surface is bounded by a logarithmic function of its genus. This bound is sharp, in that there exist sequences of surfaces with genera tending to infinity that attain logarithmically large systoles. These are…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

This chapter concerns "control volume analysis", the standard engineering tool for the analysis of flow systems, and its application to entropy balance calculations. Firstly, the principles of control volume analysis are enunciated and…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…

We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima. We reformulate the problem of computing…

We characterize the volume entropy of an arbitrary regular building as the topological pressure of the geodesic flow on an apartment. We show that the Liouville measure is not entropy maximizing measure for regular hyperbolic buildings. As…

We introduce an algorithmic model of heat conduction, the thermodynamic graph. The thermodynamic graph is analogous to meshes in the finite difference method in the sense that the calculation of temperature is carried out at the vertices of…

Given an integer homology class of a finitely presentable group, the systolic volume quantifies how tight could be a geometric realization of this class. In this paper, we study various aspects of this numerical invariant showing that it is…

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…

We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the…

We present two constructions, both inspired by ideas from graph theory, of sequences random surfaces of growing area, whose systoles grow logarithmically as a function of their area. This also allows us to prove a new lower bound on the…

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…