Related papers: Volume entropy, systole and stable norm on graphs
We consider actions of a tileable amenable group $\Gamma$ on a topological space $X$. For a continuous function on $X$, we define the entropy of the number of homologically detectable critical point of the average of that function over…
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…
We investigate the linear instability of flows that are stable according to Rayleigh's criterion for rotating fluids. Using Taylor-Couette flow as a primary test case, we develop large Reynolds number matched asymptotic expansion theories.…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
The aim of this work is to study a kind of refinement of the entropy conjecture, in the context of partially hyperbolic diffeomorphisms with one dimensional central direction, of d-dimensional torus. We start by establishing a connection…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
We consider the edge-isoperimetric problem on the graph of the infinite grid $\mathbb{N}^{2}$ in the $\ell_{\infty}$ metric. We first show that the solutions are not nested, so that techniques other than compressions have to be used. We…
We describe dimensional entropies introduced in a previous work list some of their properties and give some new proofs. These entropies allowed the definition of entropy-expanding maps. We introduce a new notion of entropy-hyperbolicity for…
We study entropies caused by the unstable part of partially hyperbolic systems. We define unstable metric entropy and unstable topological entropy, and establish a variational principle for partially hyperbolic diffeomorphsims, which states…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
By an appropriate definition, we divide the irregular set into level sets. Then we characterize the multifractal spectrum of these new pieces by calculating their entropies. We also compute the entropies of various intersections of the…
In the inhomogeneous random graph model, each vertex $i\in\{1,\ldots,n\}$ is assigned a weight $W_i\sim\text{Unif}(0,1)$, and an edge between any two vertices $i,j$ is present with probability $k(W_i,W_j)/\lambda_n\in[0,1]$, where $k$ is a…
We study the volume growth of metric balls as a function of the radius in discrete spaces, and focus on the relationship between volume growth and discrete curvature. We improve volume growth bounds under a lower bound on the so-called…
Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface…
The stability of stationary solutions of first-order systems of PDE's are considered. They may include some singular geometric terms, leading to discontinuous flux and non-conservative products. Based on several examples in Fluid Mechanics,…
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…
Let $\mathcal{H}$ be a hypergraph with $n$ vertices. Suppose that $d_1,d_2,\ldots,d_n$ are degrees of the vertices of $\mathcal{H}$. The $t$-th graph entropy based on degrees of $\mathcal{H}$ is defined as $$ I_d^t(\mathcal{H})…