Cargando…
The exact Laplacian spectrum for the Dyson hierarchical network
We consider the Dyson hierarchical graph [Image: see text], that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter σ ∈ (1/2, 1]. Exploiting the deterministic recursivity through which [Image: see text] is built, we are able to derive explicitly the whole set...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5220329/ https://www.ncbi.nlm.nih.gov/pubmed/28067261 http://dx.doi.org/10.1038/srep39962 |