On the spectra of Markov matrices for weighted Sierpinski graphs
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/104412
Tipus de documentText en actes de congrés
Data publicació2016
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Relevant information from networked systems can be obtained by analyzing the spectra of matrices associated to their graph representations. In particular, the eigenvalues and eigenvectors of the Markov matrix and related Laplacian and normalized Laplacian matrices allow the study of structural and dynamical aspects of a network, like its synchronizability and random walks properties. In this study we obtain, in a recursive way, the spectra of Markov matrices of a family of rotationally invariant weighted Sierpinski graphs. From them we find analytic expressions for the weighted count of spanning trees and the random target access time for random walks on this family of weighted graphs.
CitacióComellas, F., Xie, P., Zhang, Z. On the spectra of Markov matrices for weighted Sierpinski graphs. A: Bordeaux Graph Workshop. "Bordeaux Graph Workshop 2016 Enseirb-Matmeca & LaBRI, Bordeaux, France November 7-10, 2016". Burdeos: 2016, p. 89-90.
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
57-comellas-final_version.pdf | 368,5Kb | Visualitza/Obre |