On a lemma of Gromov and the entropy of a graph

DOI10.1006/EUJC.2002.0567MaRDI QIDQ1864577zbMATH OpenOpenAlexWikidataFDO

Authors Fabio Scarabotti

Publication date 18 March 2003

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.2002.0567

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 167195
• Some applications of directed graphs to matrix theory and entropy theory of dynamical systems
• Note on von Neumann and Rényi entropies of a graph
• scientific article; zbMATH DE number 1564004
• On the possible values of the entropy of undirected graphs

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Endomorphisms of symbolic algebraic varieties

Cited in

(4)

• On the entropy of regular languages.
• Growth and ergodicity of context-free languages II: The linear case
• Viscoelastic properties of networks
• An entropic proof of cutoff on Ramanujan graphs

This page was built for publication: On a lemma of Gromov and the entropy of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864577)