IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v513y2019icp202-209.html
   My bibliography  Save this article

Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk

Author

Listed:
  • Dai, Meifeng
  • Liu, Jingyi
  • Chang, Jianwei
  • Tang, Donglei
  • Ju, Tingting
  • Sun, Yu
  • Su, Weiyi

Abstract

The eigenvalues of the normalized Laplacian matrix of a network provide information on its structural properties and some relevant dynamical aspects, in particular for weight-dependent walk. In order to get the eigentime identity for weight-dependent walk, we need to obtain the eigenvalues and their multiplicities of the Laplacian matrix. Firstly, the model of the weighted scale-free triangulation networks is constructed. Then, the eigenvalues and their multiplicities of transition weight matrix are presented, after the recursive relationship of those eigenvalues at two successive generations are given. Consequently, the Laplacian spectrum is obtained. Finally, the analytical expression of the eigentime identity, indicating that the eigentime identity grows sublinearly with the network order, is deduced.

Suggested Citation

  • Dai, Meifeng & Liu, Jingyi & Chang, Jianwei & Tang, Donglei & Ju, Tingting & Sun, Yu & Su, Weiyi, 2019. "Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 202-209.
  • Handle: RePEc:eee:phsmap:v:513:y:2019:i:c:p:202-209
    DOI: 10.1016/j.physa.2018.08.172
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711831121X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2018.08.172?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Jia-Bao & Zhao, Jing & Cai, Zheng-Qun, 2020. "On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:513:y:2019:i:c:p:202-209. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.