The exact Laplacian spectrum for the Dyson hierarchical network

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which $\mathcal{G}$ is built, we are able to derive explicitly the whole se...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Agliari, Elena, Tavani, Flavia
Format:	Artikel
Sprache:	eng
Schlagworte:	Physics - Data Analysis, Statistics and Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!