A note on walk entropies in graphs

被引：8

作者：

Benzi, Michele ^{[1
]}

机构：

[1] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2014年 / 445卷

基金：

美国国家科学基金会;

关键词：

Entropy measures; Graph walks; Walk-regular graphs; CENTRALITY;

D O I：

10.1016/j.laa.2013.12.014

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The concept of walk entropy of a graph has been recently introduced in E. Estrada et al. (2014) [4]. In that paper the authors formulated two conjectures about walk entropies. In the present note we prove the first of these two conjectures and propose a stronger form of it. (C) 2013 Elsevier Inc. All rights reserved.

引用

页码：395 / 399

页数：5

共 11 条

[1]

[Anonymous], 2012, STRUCTURE COMPLEX NE, DOI DOI 10.1093/ACPROF:OSO/9780199591756.001.0001

[2]

[Anonymous], GRAD TEXTS MATH

[3]

[Anonymous], 1987, Basic complex analysis

[4]

BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631

[5] Subgraph centrality in complex networks -: art. no. 056103 [J].

Estrada, E ;

Rodríguez-Velázquez, JA .

PHYSICAL REVIEW E, 2005, 71 (05)

[6]

Estrada E., WORKING PAPER

[7] Walk entropies in graphs [J].

Estrada, Ernesto ;

de la Pena, Jose A. ;

Hatano, Naomichi .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 443 :235-244

[8] The physics of communicability in complex networks [J].

Estrada, Ernesto ;

Hatano, Naomichi ;

Benzi, Michele .

PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2012, 514 (03) :89-119

[9] Network Properties Revealed through Matrix Functions [J].

Estrada, Ernesto ;

Higham, Desmond J. .

SIAM REVIEW, 2010, 52 (04) :696-714

[10]

Rombach M. Puck, ARXIV13053146

← 1 2 →