Walk entropies on graphs

Estrada, Ernesto and de la Peña, José A. and Hatano, Naomichi (2014) Walk entropies on graphs. Linear Algebra and its Applications, 443. pp. 235-244. ISSN 0024-3795 (https://doi.org/10.1016/j.laa.2013.11.009)

[thumbnail of M:\My Documents\RESEARCHPUBLICATIONS\ESTRADA\1303.6203]
Preview
 PDF. Filename: 1303.6203.pdf
Preprint
Download (653kB)| Preview

Abstract

Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly related to the walk regularity of graphs and line-graphs. They are not biased by the graph size and have significantly better correlation with the inverse participation ratio of the eigenmodes of the adjacency matrix than other graph entropies. The temperature dependence of the walk entropies is also discussed. In particular, the walk entropy of graphs is shown to be non-monotonic for regular but non-walk-regular graphs in contrast to non-regular graphs.

ORCID iDs

Estrada, Ernesto ORCID logoORCID: https://orcid.org/0000-0002-3066-7418, de la Peña, José A. and Hatano, Naomichi;
  • Item type:Article
    ID code:47235
    Dates:
    Date
    Event
    15 February 2014
    Published
    25 November 2013
    Published Online
    9 November 2013
    Accepted
    Subjects:Science > Mathematics
    Department:Faculty of Science > Mathematics and Statistics
    Depositing user: Pure Administrator
    Date deposited:19 Mar 2014 12:39
    Last modified:11 Nov 2024 10:38
    URI:https://strathprints.strath.ac.uk/id/eprint/47235
CORE (COnnecting REpositories)