Minimal volume entropy on graphs

Abstract

Among the normalized metrics on a graph, we show the existence and the uniqueness of an entropy-minimizing metric, and give explicit formulas for the minimal volume entropy and the metric realizing it.

13 pages, latex

Cited by in corpus (7)

• The Patterson-Sullivan embedding and minimal volume entropy for outer space
• Transport Networks Revisited: Why Dual Graphs?
• Markov Chain Methods For Analyzing Complex Transport Networks
• Ghetto of Venice: Access to the Target Node and the Random Target Access Time
• Modelling Complex Networks: Cameo Graphs And Transport Processes
• On the absence of McShane-type identities for the outer space
• Scale-free Segregation in Transport Networks