Estrada index of dynamic random graphs

Yi lun Shang

doi:10.1007/s11766-023-3727-7

Estrada index of dynamic random graphs

Yi lun Shang^*

^*Corresponding author for this work

Computer Information Sciences Department

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

1 Downloads (Pure)

Abstract

The Estrada index of a graph G on n vertices is defined by EE(G)=∑i=1neλi , where λ ₁, λ ₂, ⋯, λ_n are the adjacency eigenvalues of G. We define two general types of dynamic graphs evolving according to continuous-time Markov processes with their stationary distributions matching the Erdös-Rényi random graph and the random graph with given expected degrees, respectively. We formulate some new estimates and upper and lower bounds for the Estrada indices of these dynamic graphs.

Original language	English
Pages (from-to)	159-165
Number of pages	7
Journal	Applied Mathematics
Volume	38
Issue number	2
Early online date	23 Jun 2023
DOIs	https://doi.org/10.1007/s11766-023-3727-7
Publication status	Published - Jun 2023

Keywords

05C50
05C80
eigenvalue
Estrada index
Markov process
temporary graph

Access to Document

10.1007/s11766-023-3727-7

dynamicAccepted author manuscript, 161 KB

Cite this

@article{101d5ca8727a40fc994f3cf3af47f63b,

title = "Estrada index of dynamic random graphs",

abstract = "The Estrada index of a graph G on n vertices is defined by EE(G)=∑i=1neλi , where λ 1, λ 2, ⋯, λn are the adjacency eigenvalues of G. We define two general types of dynamic graphs evolving according to continuous-time Markov processes with their stationary distributions matching the Erd{\"o}s-R{\'e}nyi random graph and the random graph with given expected degrees, respectively. We formulate some new estimates and upper and lower bounds for the Estrada indices of these dynamic graphs.",

keywords = "05C50, 05C80, eigenvalue, Estrada index, Markov process, temporary graph",

author = "Shang, {Yi lun}",

note = "Funding information: Supported by a starting grant of Northumbria University.",

year = "2023",

month = jun,

doi = "10.1007/s11766-023-3727-7",

language = "English",

volume = "38",

pages = "159--165",

journal = "Applied Mathematics",

issn = "1005-1031",

publisher = "Springer",

number = "2",

}

TY - JOUR

T1 - Estrada index of dynamic random graphs

AU - Shang, Yi lun

N1 - Funding information: Supported by a starting grant of Northumbria University.

PY - 2023/6

Y1 - 2023/6

N2 - The Estrada index of a graph G on n vertices is defined by EE(G)=∑i=1neλi , where λ 1, λ 2, ⋯, λn are the adjacency eigenvalues of G. We define two general types of dynamic graphs evolving according to continuous-time Markov processes with their stationary distributions matching the Erdös-Rényi random graph and the random graph with given expected degrees, respectively. We formulate some new estimates and upper and lower bounds for the Estrada indices of these dynamic graphs.

AB - The Estrada index of a graph G on n vertices is defined by EE(G)=∑i=1neλi , where λ 1, λ 2, ⋯, λn are the adjacency eigenvalues of G. We define two general types of dynamic graphs evolving according to continuous-time Markov processes with their stationary distributions matching the Erdös-Rényi random graph and the random graph with given expected degrees, respectively. We formulate some new estimates and upper and lower bounds for the Estrada indices of these dynamic graphs.

KW - 05C50

KW - 05C80

KW - eigenvalue

KW - Estrada index

KW - Markov process

KW - temporary graph

UR - http://www.scopus.com/inward/record.url?scp=85163046604&partnerID=8YFLogxK

U2 - 10.1007/s11766-023-3727-7

DO - 10.1007/s11766-023-3727-7

M3 - Article

AN - SCOPUS:85163046604

SN - 1005-1031

VL - 38

SP - 159

EP - 165

JO - Applied Mathematics

JF - Applied Mathematics

IS - 2

ER -

Estrada index of dynamic random graphs

Abstract

Keywords

Access to Document

Other files and links

Cite this