The Library
Walk entropy and walk-regularity
Tools
Tools
Tools
Kloster, Kyle, Králʼ, Daniel and Sullivan, Blair D. (2018) Walk entropy and walk-regularity. Linear Algebra and Its Applications . doi:10.1016/j.laa.2018.02.009 (In Press)
|
PDF
WRAP-walk-entropy-walk-regulartity-Kral-2018.pdf - Accepted Version - Requires a PDF viewer. Download (455Kb) | Preview |
Official URL: https://doi.org/10.1016/j.laa.2018.02.009
Abstract
A graph is said to be walk-regular if, for each ℓ≥1, every vertex is contained in the same number of closed walks of length ℓ. We construct a 24-vertex graph H4 that is not walk-regular yet has maximized walk entropy, SV(H4,β)=log24, for some β>0. This graph is a counterexample to a conjecture of Benzi [Linear Algebra Appl.~443 (2014), 395--399, Conjecture 3.1]. We also show that there exist infinitely many temperatures β0>0 so that SV(G,β0)=lognG if and only if a graph G is walk-regular.
| Item Type: | Journal Article | ||||||
|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||||
| Divisions: | Faculty of Science > Mathematics | ||||||
| Library of Congress Subject Headings (LCSH): | Graph theory., Entropy, Algebras, Linear. | ||||||
| Journal or Publication Title: | Linear Algebra and Its Applications | ||||||
| Publisher: | Elsevier Inc | ||||||
| ISSN: | 0024-3795 | ||||||
| Official Date: | 9 February 2018 | ||||||
| Dates: |
|
||||||
| Date of first compliant deposit: | 8 February 2018 | ||||||
| DOI: | 10.1016/j.laa.2018.02.009 | ||||||
| Status: | Peer Reviewed | ||||||
| Publication Status: | In Press | ||||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
