Related papers: Volume entropy, systole and stable norm on graphs
We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…
We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…
Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…
The persistent Betti numbers are used in topological data analysis to infer the scales at which topological features appear and disappear in the filtration of a topological space. Most commonly by means of the corresponding barcode or…
We will discuss theoretical and experimental results concerning comparison of entropy of pseudo-Anosov maps and volume of their mapping tori. Recent study of Weil-Petersson geometry of the Teichm\"uller space tells us that they admit linear…
In this work we study the asymptotic traffic flow in Gromov's hyperbolic graphs. We prove that under certain mild hypotheses the traffic flow in a hyperbolic graph tends to pass through a finite set of highly congested nodes. These nodes…
We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality…
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
In this article, we discuss the problem of establishing relations between information measures assessed for network structures. Two types of entropy based measures namely, the Shannon entropy and its generalization, the R\'{e}nyi entropy…
We obtain the asymptotic orders of entropy numbers of Sobolev classes on the unit sphere with Dunkl weight which associates with the finite reflection group. Moreover, the asymptotic order of entropy numbers of weighted Sobolev classes on…
We prove a sharp bound between sampling numbers and entropy numbers in the uniform norm for bounded convex sets of bounded functions.
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 obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
A relation between the conformal anomaly and the logarithmic term in the entanglement entropy is known to exist for CFT's in even dimensions. In odd dimensions the local anomaly and the logarithmic term in the entropy are absent. As was…
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
Stochastic dynamical systems consisting of non-invertible continuous maps on an interval are studied. It is proved that if they satisfy the recently introduced so-called $\mu$-injectivity and some mild assumptions, then proximality,…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…