Estrada's walk-regularity conjecture at temperature one
Estrada's walk-regularity conjecture at temperature one
Let be a simple graph, let be its number of vertices, and let denote its walk entropy at temperature . The graph is walk-regular when every vertex is contained in the same number of closed walks of every length. Estrada's conjecture. A graph is walk-regular if and only if
The paper proves that some positive temperature has this characterization, but does not identify such a temperature explicitly; temperature 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.