IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v311y2017icp262-271.html
   My bibliography  Save this article

Two-walks degree assortativity in graphs and networks

Author

Listed:
  • Allen-Perkins, Alfonso
  • Pastor, Juan Manuel
  • Estrada, Ernesto

Abstract

Degree assortativity is the tendency for nodes of high degree (resp. low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is usually quantified by the Pearson correlation coefficient of the degree–degree correlation. Here we extend this concept to account for the effect of second neighbours to a given node in a graph. That is, we consider the two-walks degree of a node as the sum of all the degrees of its adjacent nodes. The two-walks degree assortativity of a graph is then the Pearson correlation coefficient of the two-walks degree–degree correlation. We found here analytical expression for this two-walks degree assortativity index as a function of contributing subgraphs. We then study all the 261,000 connected graphs with 9 nodes and observe the existence of assortative–assortative and disassortative–disassortative graphs according to degree and two-walks degree, respectively. More surprisingly, we observe a class of graphs which are degree disassortative and two-walks degree assortative. We explain the existence of some of these graphs due to the presence of certain topological features, such as a node of low-degree connected to high-degree ones. More importantly, we study a series of 49 real-world networks, where we observe the existence of the disassortative–assortative class in several of them. In particular, all biological networks studied here were in this class. We also conclude that no graphs/networks are possible with assortative–disassortative structure.

Suggested Citation

  • Allen-Perkins, Alfonso & Pastor, Juan Manuel & Estrada, Ernesto, 2017. "Two-walks degree assortativity in graphs and networks," Applied Mathematics and Computation, Elsevier, vol. 311(C), pages 262-271.
    • Handle: RePEc:eee:apmaco:v:311:y:2017:i:c:p:262-271
    DOI: 10.1016/j.amc.2017.05.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317303235
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.05.025?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.

    References listed on IDEAS

    as
    1. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    2. Opitz, S., 1996. "Trophic interactions in Caribbean coral reefs," Monographs, The WorldFish Center, number 11440, April.
    3. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Ronda J. & Ye, Fred Y., 2020. "Measuring similarity for clarifying layer difference in multiplex ad hoc duplex information networks," Journal of Informetrics, Elsevier, vol. 14(1).
    2. Gao, Cai & Wei, Daijun & Hu, Yong & Mahadevan, Sankaran & Deng, Yong, 2013. "A modified evidential methodology of identifying influential nodes in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5490-5500.
    3. Emerson, Isaac Arnold & Amala, Arumugam, 2017. "Protein contact maps: A binary depiction of protein 3D structures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 782-791.
    4. Faedo, Nicolás & García-Violini, Demián & Ringwood, John V., 2021. "Controlling synchronization in a complex network of nonlinear oscillators via feedback linearisation and H∞-control," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    5. Xiao‐Bing Hu & Hang Li & XiaoMei Guo & Pieter H. A. J. M. van Gelder & Peijun Shi, 2019. "Spatial Vulnerability of Network Systems under Spatially Local Hazards," Risk Analysis, John Wiley & Sons, vol. 39(1), pages 162-179, January.
    6. Ruiz Vargas, E. & Mitchell, D.G.V. & Greening, S.G. & Wahl, L.M., 2014. "Topology of whole-brain functional MRI networks: Improving the truncated scale-free model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 405(C), pages 151-158.
    7. Igor Belykh & Mateusz Bocian & Alan R. Champneys & Kevin Daley & Russell Jeter & John H. G. Macdonald & Allan McRobie, 2021. "Emergence of the London Millennium Bridge instability without synchronisation," Nature Communications, Nature, vol. 12(1), pages 1-14, December.
    8. Thomas J. Sargent & John Stachurski, 2022. "Economic Networks: Theory and Computation," Papers 2203.11972, arXiv.org, revised Jul 2022.
    9. Berahmand, Kamal & Bouyer, Asgarali & Samadi, Negin, 2018. "A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 110(C), pages 41-54.
    10. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    11. Soh, Harold & Lim, Sonja & Zhang, Tianyou & Fu, Xiuju & Lee, Gary Kee Khoon & Hung, Terence Gih Guang & Di, Pan & Prakasam, Silvester & Wong, Limsoon, 2010. "Weighted complex network analysis of travel routes on the Singapore public transportation system," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(24), pages 5852-5863.
    12. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    13. Wang, Qingyun & Duan, Zhisheng & Chen, Guanrong & Feng, Zhaosheng, 2008. "Synchronization in a class of weighted complex networks with coupling delays," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(22), pages 5616-5622.
    14. D’Errico, Marco & Battiston, Stefano & Peltonen, Tuomas & Scheicher, Martin, 2018. "How does risk flow in the credit default swap market?," Journal of Financial Stability, Elsevier, vol. 35(C), pages 53-74.
    15. Liu, Xiaodong & Patacchini, Eleonora & Zenou, Yves & Lee, Lung-Fei, 2011. "Criminal Networks: Who is the Key Player?," Research Papers in Economics 2011:7, Stockholm University, Department of Economics.
    16. Agnieszka Rusinowska & Rudolf Berghammer & Harrie de Swart & Michel Grabisch, 2011. "Social networks: Prestige, centrality, and influence (Invited paper)," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00633859, HAL.
    17. Gabrielle Demange, 2018. "Contagion in Financial Networks: A Threat Index," Management Science, INFORMS, vol. 64(2), pages 955-970, February.
    18. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    19. Yao Hongxing & Lu Yunxia, 2017. "Analyzing the Potential Influence of Shanghai Stock Market Based on Link Prediction Method," Journal of Systems Science and Information, De Gruyter, vol. 5(5), pages 446-461, October.
    20. De Montis, Andrea & Ganciu, Amedeo & Cabras, Matteo & Bardi, Antonietta & Mulas, Maurizio, 2019. "Comparative ecological network analysis: An application to Italy," Land Use Policy, Elsevier, vol. 81(C), pages 714-724.

    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:apmaco:v:311:y:2017:i:c:p:262-271. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.