On the generic behavior of the metric entropy, and related quantities,of uniformly continuous maps over Polish metric spaces

In this work, we show that if f is a uniformly continuous map defined over a Polish metric space, then the set of f-invariant measures with zero metric entropy is a $G_{\delta }$ set (in the weak topology). In particular, this set is generic if the set of f-periodic measures is dense in the set of f-invariant measures. This settles a conjecture posed by Sigmund (Trans. Amer. Math. Soc. 190 (1974), 285–299), which states that the metric entropy of an invariant measure of a topological dynamical system that satisfies the periodic specification property is typically zero. We also show that if X is compact and if f is an expansive or a Lipschitz map with a dense set of periodic measures, typically the lower correlation entropy for $q\in (0,1)$ is equal to zero. Moreover, we show that if X is a compact metric space and if f is an expanding map with a dense set of periodic measures, then the set of invariant measures with packing dimension, upper rate of recurrence and upper quantitative waiting time indicator equal to zero is residual.     

Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing

We consider sequences of graphs (Gn) and define various notions of convergence related to these sequences: “left convergence” defined in terms of the densities of homomorphisms from small graphs into Gn; “right convergence” defined in terms of the densities of homomorphisms from Gn into small graphs; and convergence in a suitably defined metric.In Part I of this series, we show that left convergence is equivalent to convergence in metric, both for simple graphs Gn, and for graphs Gn with nodeweights and edgeweights. One of the main steps here is the introduction of a cut-distance comparing graphs, not necessarily of the same size. We also show how these notions of convergence provide natural formulations of Szemerédi partitions, sampling and testing of large graphs.     

Further results on the expected hitting time,the cover cost and the related invariants of graphs

A close relation between hitting times of the simple random walk on a graph, the Kirchhoff index, the resistance-centrality, and related invariants of unicyclic graphs is displayed. Combining graph transformations and some other techniques, sharp upper and lower bounds on the cover cost (resp. reverse cover cost) of a vertex in an $n$-vertex unicyclic graph are determined. All the corresponding extremal graphs are identified.