Lower bounds for the Estrada index using mixing time and Laplacian spectrum
نویسندگان
چکیده
منابع مشابه
Lower Bounds for the Estrada Index Using Mixing Time and Laplacian Spectrum
The logarithm of the Estrada index has been recently proposed as a spectral measure to characterize the robustness of complex networks. We derive novel analytic lower bounds for the logarithm of the Estrada index based on the Laplacian spectrum and the mixing times of random walks on the network. The main techniques employed are some inequalities, such as the thermodynamic inequality in statist...
متن کاملLower Bounds for Estrada Index
If G is an (n,m)-graph whose spectrum consists of the numbers λ1, λ2, . . . , λn, then its Estrada index is EE(G) = ∑n i=1 e λi . We establish lower bounds for EE(G) in terms of n and m. Introduction In this paper we are concerned with simple graphs, that have no loops and no multiple or directed edges. Let G be such a graph, and let n and m be the number of its vertices and edges. Then we say ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2013
ISSN: 0035-7596
DOI: 10.1216/rmj-2013-43-6-2009