Loading...
Loading...

Go to the content (press return)

On the spectra of Markov matrices for weighted Sierpinski graphs

Author
Comellas, F.; Xie, P.; Zhang, Z.
Type of activity
Presentation of work at congresses
Name of edition
Bordeaux Graph Workshop 2016
Date of publication
2016
Presentation's date
2016-11-09
Book of congress proceedings
Bordeaux Graph Workshop 2016 Enseirb-Matmeca & LaBRI, Bordeaux, France November 7-10, 2016
First page
89
Last page
90
Project funding
Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
Repository
http://bgw.labri.fr/2016/bgw2016-booklet.pdf Open in new window
http://hdl.handle.net/2117/104412 Open in new window
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 in...
Citation
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.
Keywords
Graph spectra, Markov matrix, Sierpinski graph, random target access time, weighted spanning trees
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments