Spectral analysis for a family of treelike networks
From MaRDI portal
Publication:2149621
DOI10.1016/j.physa.2018.02.088MaRDI QIDQ2149621
Meifeng Dai, Yu Sun, Yufei Chen, Yue Zong, Wei Yi Su, Xiao Qian Wang
Publication date: 29 June 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2018.02.088
82-XX: Statistical mechanics, structure of matter
Related Items
CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS, Applications of Markov spectra for the weighted partition network by the substitution rule, First-order network coherence in 5-rose graphs
Cites Work
- The electrical resistance of a graph captures its commute and cover times
- Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
- Average weighted receiving time on the non-homogeneous double-weighted fractal networks
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- Spectral analysis for weighted tree-like fractals
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Complex networks: structure and dynamics
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
- SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS