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

A centrality notion for graphs based on Tukey depth

Author

Listed:
  • Cerdeira, J. Orestes
  • Silva, Pedro C.

Abstract

Centrality on graphs aims at ranking vertices in terms of their contribution to facilitate the communication flow in the network. Tukey depth is one of most widely used statistical measures to assess the centrality of a point within a cloud of points in the multidimensional space. In this paper we propose and discuss how to adapt Tukey depth to develop a novel centrality index for vertices of a graph. We present some properties of the indices on several classes of graphs, show that computing the indices is NP-hard, extend the indices to assess the centrality of group of vertices and give 0/1 linear formulations to calculate them.

Suggested Citation

  • Cerdeira, J. Orestes & Silva, Pedro C., 2021. "A centrality notion for graphs based on Tukey depth," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    • Handle: RePEc:eee:apmaco:v:409:y:2021:i:c:s0096300321004987
    DOI: 10.1016/j.amc.2021.126409
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321004987
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2021.126409?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. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    2. Xiaohui Liu, 2017. "Fast implementation of the Tukey depth," Computational Statistics, Springer, vol. 32(4), pages 1395-1410, December.
    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. Jiang, Lincheng & Zhao, Xiang & Ge, Bin & Xiao, Weidong & Ruan, Yirun, 2019. "An efficient algorithm for mining a set of influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 516(C), pages 58-65.
    2. Zhou, Jing & Li, Wei & Wang, Jiaxin & Ding, Shuai & Xia, Chengyi, 2019. "Default prediction in P2P lending from high-dimensional data based on machine learning," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).
    3. Keng, Ying Ying & Kwa, Kiam Heong & Ratnavelu, Kurunathan, 2021. "Centrality analysis in a drug network and its application to drug repositioning," Applied Mathematics and Computation, Elsevier, vol. 395(C).
    4. Wang, Yufang & Wang, Haiyan & Zhang, Shuhua, 2020. "Prediction of daily PM2.5 concentration in China using data-driven ordinary differential equations," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    5. Zhang, Jun-li & Fu, Yan-jun & Cheng, Lan & Yang, Yun-yun, 2021. "Identifying multiple influential spreaders based on maximum connected component decomposition method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 571(C).
    6. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    7. Li, Xiaopeng & Sun, Shiwen & Xia, Chengyi, 2019. "Reputation-based adaptive adjustment of link weight among individuals promotes the cooperation in spatial social dilemmas," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 810-820.
    8. Wang, Zhishuang & Guo, Quantong & Sun, Shiwen & Xia, Chengyi, 2019. "The impact of awareness diffusion on SIR-like epidemics in multiplex networks," Applied Mathematics and Computation, Elsevier, vol. 349(C), pages 134-147.
    9. P.B., Divya & Lekha, Divya Sindhu & Johnson, T.P. & Balakrishnan, Kannan, 2022. "Vulnerability of link-weighted complex networks in central attacks and fallback strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 590(C).
    10. Lili Xu & Fanrui Su & Jie Zhang & Na Zhang, 2022. "High-Speed Rail Network Structural Characteristics and Evolution in China," Mathematics, MDPI, vol. 10(18), pages 1-17, September.
    11. Liu, Xiaoxiao & Sun, Shiwen & Wang, Jiawei & Xia, Chengyi, 2019. "Onion structure optimizes attack robustness of interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 535(C).
    12. Teqi Dai & Tiantian Ding & Qingfang Liu & Bingxin Liu, 2022. "Node Centrality Comparison between Bus Line and Passenger Flow Networks in Beijing," Sustainability, MDPI, vol. 14(22), pages 1-14, November.
    13. Xu, Paiheng & Zhang, Rong & Deng, Yong, 2018. "A novel visibility graph transformation of time series into weighted networks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 201-208.
    14. Wang, Wei & Cai, Kaiquan & Du, Wenbo & Wu, Xin & Tong, Lu (Carol) & Zhu, Xi & Cao, Xianbin, 2020. "Analysis of the Chinese railway system as a complex network," Chaos, Solitons & Fractals, Elsevier, vol. 130(C).
    15. Li, Huichun & Zhang, Xue & Zhao, Chengli, 2021. "Explaining social events through community evolution on temporal networks," Applied Mathematics and Computation, Elsevier, vol. 404(C).
    16. Wei Shao & Yijun Zuo, 2020. "Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm," Computational Statistics, Springer, vol. 35(1), pages 203-226, March.
    17. Ramsay, Kelly & Durocher, Stéphane & Leblanc, Alexandre, 2019. "Integrated rank-weighted depth," Journal of Multivariate Analysis, Elsevier, vol. 173(C), pages 51-69.
    18. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    19. Federico Karagulian & Gaetano Valenti & Carlo Liberto & Matteo Corazza, 2022. "A Methodology to Estimate Functional Vulnerability Using Floating Car Data," Sustainability, MDPI, vol. 15(1), pages 1-15, December.
    20. Agryzkov, Taras & Tortosa, Leandro & Vicent, Jose F., 2019. "A variant of the current flow betweenness centrality and its application in urban networks," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 600-615.

    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:409:y:2021:i:c:s0096300321004987. 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.