Walk entropies in graphs
From MaRDI portal
Publication:2438485
DOI10.1016/j.laa.2013.11.009zbMath1282.05111arXiv1303.6203OpenAlexW2038551613MaRDI QIDQ2438485
Naomichi Hatano, Ernesto Estrada, José Antonio de la Peña
Publication date: 5 March 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.6203
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Random walks on graphs (05C81)
Related Items (9)
The many facets of the Estrada indices of graphs and networks ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Concentric network symmetry ⋮ Subgraph centrality and walk-regularity ⋮ A note on walk entropies in graphs ⋮ Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations ⋮ Walk entropy and walk-regularity ⋮ Maximum walk entropy implies walk regularity ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
Cites Work
- Unnamed Item
- A history of graph entropy measures
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Information processing in complex networks: Graph entropy and information functionals
- Feasibility conditions for the existence of walk-regular graphs
- Families of line-graphs and their quantization
- The tripartite separability of density matrices of graphs
- Bose–Hubbard model on two-dimensional line graphs
- Tensor 2-sums and entanglement
- Central limit theorems for large graphs: Method of quantum decomposition
- The problem of deficiency indices for discrete Schrödinger operators on locally finite graphs
- The stability of ferromagnetism in the Hubbard model on two-dimensional line graphs
This page was built for publication: Walk entropies in graphs