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

Local assortativity in weighted and directed complex networks

Author

Listed:
  • Sabek, M.
  • Pigorsch, U.

Abstract

Assortativity, i.e. the tendency of a vertex to bond with another based on their similarity, such as degree, is an important network characteristic that is well-known to be relevant for the network’s robustness against attacks. Commonly it is analyzed on the global level, i.e. for the whole network. However, the local structure of assortativity is also of interest as it allows to assess which of the network’s vertices and edges are the most endangering or the most protective ones. Hence, it is quite important to analyze the contribution of individual vertices and edges to the network’s global assortativity. For unweighted networks Piraveenan et al. (2008; 2010) and Zhang et al. (2012) suggest two allegedly different approaches to measure local assortativity. In this paper we show their equivalence and propose generalized local assortativity measures that are also applicable to weighted (un)directed networks. They allow to analyze the assortative behavior of edges and vertices as well as of entire network components. We illustrate the usefulness of our measures based on theoretical and real-world weighted networks and propose new local assortativity profiles, which provide, inter alia, information about the pattern of local assortativity with respect to edge weight.

Suggested Citation

  • Sabek, M. & Pigorsch, U., 2023. "Local assortativity in weighted and directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    • Handle: RePEc:eee:phsmap:v:630:y:2023:i:c:s0378437123007860
    DOI: 10.1016/j.physa.2023.129231
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437123007860
    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.2023.129231?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. Arcagni, Alberto & Grassi, Rosanna & Stefani, Silvana & Torriero, Anna, 2017. "Higher order assortativity in complex networks," European Journal of Operational Research, Elsevier, vol. 262(2), pages 708-719.
    2. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    3. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    4. Pigorsch, U. & Sabek, M., 2022. "Assortative mixing in weighted directed networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    5. Zhi-Xi Wu & Xin-Jian Xu & Ying-Hai Wang, 2005. "Properties of weighted structured scale-free networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 45(3), pages 385-390, June.
    6. Arcagni, Alberto & Grassi, Rosanna & Stefani, Silvana & Torriero, Anna, 2021. "Extending assortativity: An application to weighted social networks," Journal of Business Research, Elsevier, vol. 129(C), pages 774-783.
    7. D. S. Callaway & J. E. Hopcroft & J. M. Kleinberg & M. E. J. Newman & S. H. Strogatz, 2001. "Are Randomly Grown Graphs Really Random?," Working Papers 01-05-025, Santa Fe Institute.
    8. Barthélemy, Marc & Barrat, Alain & Pastor-Satorras, Romualdo & Vespignani, Alessandro, 2005. "Characterization and modeling of weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 346(1), pages 34-43.
    9. Leung, C.C. & Chau, H.F., 2007. "Weighted assortative and disassortative networks model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 378(2), pages 591-602.
    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. Ricca, Federica & Scozzari, Andrea, 2024. "Portfolio optimization through a network approach: Network assortative mixing and portfolio diversification," European Journal of Operational Research, Elsevier, vol. 312(2), pages 700-717.
    2. Ma, Qian & Ma, Jun, 2017. "Identifying and ranking influential spreaders in complex networks with consideration of spreading probability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 312-330.
    3. Reppas, Andreas I. & Spiliotis, Konstantinos & Siettos, Constantinos I., 2015. "Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 109(C), pages 186-196.
    4. Arcagni, Alberto & Cerqueti, Roy & Grassi, Rosanna, 2024. "Higher-order assortativity for directed weighted networks and Markov chains," European Journal of Operational Research, Elsevier, vol. 316(1), pages 215-227.
    5. Arcagni, Alberto & Grassi, Rosanna & Stefani, Silvana & Torriero, Anna, 2021. "Extending assortativity: An application to weighted social networks," Journal of Business Research, Elsevier, vol. 129(C), pages 774-783.
    6. Tabak, Benjamin M. & Serra, Thiago R. & Cajueiro, Daniel O., 2009. "The expectation hypothesis of interest rates and network theory: The case of Brazil," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(7), pages 1137-1149.
    7. Santiago, A. & Benito, R.M., 2009. "Local affinity in heterogeneous growing networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(14), pages 2941-2948.
    8. Liu, Yang & Wei, Bo & Du, Yuxian & Xiao, Fuyuan & Deng, Yong, 2016. "Identifying influential spreaders by weight degree centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 86(C), pages 1-7.
    9. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    10. Liang, Wei & Shi, Yuming & Huang, Qiuling, 2014. "Modeling the Chinese language as an evolving network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 268-276.
    11. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    12. 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.
    13. Yan Qiang & Bo Pei & Weili Wu & Juanjuan Zhao & Xiaolong Zhang & Yue Li & Lidong Wu, 2014. "Improvement of path analysis algorithm in social networks based on HBase," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 588-599, October.
    14. Pi, Xiaochen & Tang, Longkun & Chen, Xiangzhong, 2021. "A directed weighted scale-free network model with an adaptive evolution mechanism," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 572(C).
    15. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Shokrollahi, Arman, 2015. "Improving detection of influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 833-845.
    16. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Yi, Dongyun, 2018. "Effectively identifying multiple influential spreaders in term of the backward–forward propagation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 404-413.
    17. Stephanie Rend'on de la Torre & Jaan Kalda & Robert Kitt & Juri Engelbrecht, 2016. "On the topologic structure of economic complex networks: Empirical evidence from large scale payment network of Estonia," Papers 1602.04352, arXiv.org.
    18. Yoshiharu Maeno & Kenji Nishiguchi & Satoshi Morinaga & Hirokazu Matsushima, 2014. "Impact of credit default swaps on financial contagion," Papers 1411.1356, arXiv.org.
    19. Linda Margarita Medina Herrera & José Benito Díaz Hernández, 2011. "Caracterización y modelado de redes: el caso de la Bolsa Mexicana de Valores," Revista de Administración, Finanzas y Economía (Journal of Management, Finance and Economics), Tecnológico de Monterrey, Campus Ciudad de México, vol. 5(1), pages 23-32.
    20. Rabbani, Fereshteh & Khraisha, Tamer & Abbasi, Fatemeh & Jafari, Gholam Reza, 2021. "Memory effects on link formation in temporal networks: A fractional calculus approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(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:630:y:2023:i:c:s0378437123007860. 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: 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.