IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v28y2014i3d10.1007_s10878-014-9726-0.html
   My bibliography  Save this article

On the radius of centrality in evolving communication networks

Author

Listed:
  • Danica Vukadinović Greetham

    (University of Reading)

  • Zhivko Stoyanov

    (University of Reading)

  • Peter Grindrod

    (University of Oxford, Andrew Wiles Building)

Abstract

In this article, we investigate how the choice of the attenuation factor in an extended version of Katz centrality influences the centrality of the nodes in evolving communication networks. For given snapshots of a network, observed over a period of time, recently developed communicability indices aim to identify the best broadcasters and listeners (receivers) in the network. Here we explore the attenuation factor constraint, in relation to the spectral radius (the largest eigenvalue) of the network at any point in time and its computation in the case of large networks. We compare three different communicability measures: standard, exponential, and relaxed (where the spectral radius bound on the attenuation factor is relaxed and the adjacency matrix is normalised, in order to maintain the convergence of the measure). Furthermore, using a vitality-based measure of both standard and relaxed communicability indices, we look at the ways of establishing the most important individuals for broadcasting and receiving of messages related to community bridging roles. We compare those measures with the scores produced by an iterative version of the PageRank algorithm and illustrate our findings with three examples of real-life evolving networks: the MIT reality mining data set, consisting of daily communications between 106 individuals over the period of 1 year, a UK Twitter mentions network, constructed from the direct tweets between $$12.4$$ 12.4 k individuals during 1 week, and a subset of the Enron email data set.

Suggested Citation

  • Danica Vukadinović Greetham & Zhivko Stoyanov & Peter Grindrod, 2014. "On the radius of centrality in evolving communication networks," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 540-560, October.
    • Handle: RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-014-9726-0
    DOI: 10.1007/s10878-014-9726-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9726-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9726-0?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. Jamakovic, A. & Kooij, R.E. & van Mieghem, P. & van Dam, E.R., 2006. "Robustness of networks against viruses : The role of the spectral raduis," Other publications TiSEM 1b372c5c-dc77-45bd-824d-3, Tilburg University, School of Economics and Management.
    2. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    3. Anurat Chapanond & Mukkai S. Krishnamoorthy & Bülent Yener, 2005. "Graph Theoretic and Spectral Analysis of Enron Email Data," Computational and Mathematical Organization Theory, Springer, vol. 11(3), pages 265-281, October.
    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. Thomas J. Sargent & John Stachurski, 2022. "Economic Networks: Theory and Computation," Papers 2203.11972, arXiv.org, revised Jul 2022.
    2. Karimi, Fatemeh & Lotfi, Shahriar & Izadkhah, Habib, 2021. "Community-guided link prediction in multiplex networks," Journal of Informetrics, Elsevier, vol. 15(4).
    3. 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.
    4. 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.
    5. 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.
    6. Gabrielle Demange, 2018. "Contagion in Financial Networks: A Threat Index," Management Science, INFORMS, vol. 64(2), pages 955-970, February.
    7. 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).
    8. 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.
    9. Zhepeng Li & Xiao Fang & Xue Bai & Olivia R. Liu Sheng, 2017. "Utility-Based Link Recommendation for Online Social Networks," Management Science, INFORMS, vol. 63(6), pages 1938-1952, June.
    10. 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.
    11. Dequiedt, Vianney & Zenou, Yves, 2017. "Local and consistent centrality measures in parameterized networks," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 28-36.
    12. Jana Diesner & Terrill L. Frantz & Kathleen M. Carley, 2005. "Communication Networks from the Enron Email Corpus “It's Always About the People. Enron is no Different”," Computational and Mathematical Organization Theory, Springer, vol. 11(3), pages 201-228, October.
    13. Mauleon, Ana & Nanumyan, Mariam & Vannetelbosch, Vincent, 2024. "Ideal efforts and consensus in a multi-layer network game," LIDAM Discussion Papers CORE 2024023, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. ,, 2014. "A ranking method based on handicaps," Theoretical Economics, Econometric Society, vol. 9(3), September.
    15. Celani, Alessandro & Cerchiello, Paola & Pagnottoni, Paolo, 2024. "The topological structure of panel variance decomposition networks," Journal of Financial Stability, Elsevier, vol. 71(C).
    16. Ernest Liu & Aleh Tsyvinski, 2021. "Dynamical Structure and Spectral Properties of Input-Output Networks," Working Papers 2021-13, Princeton University. Economics Department..
    17. Richard W. Carney & Travers Barclay Child, 2015. "Business Networks and Crisis Performance: Professional, Political, and Family Ties," Tinbergen Institute Discussion Papers 15-135/V, Tinbergen Institute, revised 20 Feb 2015.
    18. Wu, Tao & Xian, Xingping & Zhong, Linfeng & Xiong, Xi & Stanley, H. Eugene, 2018. "Power iteration ranking via hybrid diffusion for vital nodes identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 802-815.
    19. Shenshen Bai & Longjie Li & Jianjun Cheng & Shijin Xu & Xiaoyun Chen, 2018. "Predicting Missing Links Based on a New Triangle Structure," Complexity, Hindawi, vol. 2018, pages 1-11, December.
    20. Michel Grabisch & Agnieszka Rusinowska, 2015. "Lattices in Social Networks with Influence," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 17(01), pages 1-18.

    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:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-014-9726-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.