Skip to main content

A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity

  • Conference paper
  • First Online:
Complex Networks and Their Applications VII (COMPLEX NETWORKS 2018)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 812))

Included in the following conference series:

Abstract

In this paper, we propose a new centrality measure for the purpose of estimating and recommending installation sites of evacuation facilities that many residents can reach even in the situation where roads are blocked by natural disasters. In the proposed centrality, we model the probabilistically occurring road blockage by the link cut of the graph, and quantify the degree of connectivity of each node by the expectation value of the number of reachable nodes under uncertain connectivity. In a large-scale network, since the number of combinations of disconnecting links is enormous, it is difficult to strictly calculate the expected value. Therefore, approximate connectivity is calculated by an efficient algorithm based on simulation. Furthermore, in order to estimate multiple installation sites, we propose a method of defining and maximizing the degree of connectivity for a node group rather than a single node. From this, it can be expected that duplication of nodes covered by the extracted nodes can be eliminated, so that a practical candidate site of evacuation facility can be estimated. We evaluate the effectiveness and efficiency of the proposed method compared with the method based on distance between nodes and the method based on link density, using real road networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10,008 (2008)

    Google Scholar 

  2. Chen, P.Y., Hero, A.O.: Deep community detection. IEEE Trans. Signal Process. 63(21), 5706–5719 (2015)

    Google Scholar 

  3. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 066,111+ (2004). https://doi.org/10.1103/PhysRevE.70.066111

    Google Scholar 

  4. Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036,125+ (2006)

    Google Scholar 

  5. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002). https://doi.org/10.1073/pnas.122653799

    Google Scholar 

  6. Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pp. 731–740. ACM, New York (2002). https://doi.org/10.1145/509907.510012

  7. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. ii: the p-medians. SIAM J. Appl. Math. 37(3), 539–560 (1979)

    Google Scholar 

  8. von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–416 (2007)

    Google Scholar 

  9. Montis, D.A., Barthelemy, M., Chessa, A., Vespignani, A.: The structure of interurban traffic: a weighted network analysis. Environ. Plan. B Plan. Des. 34(5), 905–924 (2007)

    Google Scholar 

  10. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)

    Google Scholar 

  11. Park, K., Yilmaz, A.: A social network analysis approach to analyze road networks. In: Proceedings of the ASPRS Annual Conference 2010 (2010)

    Google Scholar 

  12. Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269–287 (1983)

    Google Scholar 

  13. Tabata, K., Nakamura, A., Kudo, M.: An efficient approximate algorithm for the 1-median problem on a graph. IEICE Trans. Inf. Syst. E100.D(5), 994–1002 (2017). https://doi.org/10.1587/transinf.2016EDP7398

    Google Scholar 

Download references

Acknowledgement

This work was supported by JSPS Grant-in-Aid for Scientific Research (No.17H01826).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Takayasu Fushimi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fushimi, T., Saito, K., Ikeda, T., Kazama, K. (2019). A New Group Centrality Measure for Maximizing the Connectedness of Network Under Uncertain Connectivity. In: Aiello, L., Cherifi, C., Cherifi, H., Lambiotte, R., Lió, P., Rocha, L. (eds) Complex Networks and Their Applications VII. COMPLEX NETWORKS 2018. Studies in Computational Intelligence, vol 812. Springer, Cham. https://doi.org/10.1007/978-3-030-05411-3_1

Download citation

Publish with us

Policies and ethics