Estrada's walk-regularity conjecture at temperature one

Let GG be a simple graph, let nGn_G be its number of vertices, and let SV(G,β)S^V(G,\beta) denote its walk entropy at temperature β0\beta\geq0. The graph GG is walk-regular when every vertex is contained in the same number of closed walks of every length. Estrada's conjecture. A graph GG is walk-regular if and only if

SV(G,1)=lognG.S^V(G,1)=\log n_G.

The paper proves that some positive temperature has this characterization, but does not identify such a temperature explicitly; temperature 11 is presented as an open conjectural choice.

Sources & referencesView supporting material

Primary source

Kyle Kloster, Daniel Král' and Blair D. Sullivan, “Walk entropy and walk-regularity”, arXiv:1708.09700 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.