IDEAS home Printed from https://ideas.repec.org/a/spr/comaot/v20y2014i3d10.1007_s10588-013-9163-0.html
   My bibliography  Save this article

Key potential-oriented criticality analysis for complex military organization based on FINC-E model

Author

Listed:
  • Guoli Yang

    (National University of Defense Technology)

  • Weiming Zhang

    (National University of Defense Technology)

  • Baoxin Xiu

    (National University of Defense Technology)

  • Zhong Liu

    (National University of Defense Technology)

  • Jincai Huang

    (National University of Defense Technology)

Abstract

The complex social organizations, which can self-organize into the region “at the edge of chaos”, neither too ordered nor too random, now have become an interdisciplinary research topic. As a kind of special social organization, the complex military organization usually has its key entities and relations, which should be well protected in case of attacks. In order to do the criticality analysis for the military organization, finding the key entities or relations which can disrupt the functions of the organization, two problems should be seriously considered. First, the military organization should be well modeled, which can work well in the specialized military context; secondly it is critical to define and identify the key entities or relations, which should incorporate the topological centrality and weighted nodes or edges. Different from the traditional military organizations which are usually task-oriented, this paper proposes the Force, Intelligence, Networking, and C2 Extended (FINC-E) Model for complex military organization, with which a more detailed and quantitative analysis for the military organization is available. This model provides the formal representation for the nodes and edges in the military organization, which provides a highly efficient and concise network topology. In order to identify the critical nodes and edges, a method based on key potential is proposed, which acts as the measurement of criticality for the heterogeneous nodes and edges in the complex military organization. The key potential is well defined on the basis of topology structure and of the node’s or edge’s capability, which helps to transform the organization from the heterogeneity to the homogeneity. In the end, the criticality analysis case study is made for both small-world networked military organization and scale-free networked military organization, showing that the measure of key potential has the advantage over other classical measures in locating the key entities or relations for complex military organization.

Suggested Citation

  • Guoli Yang & Weiming Zhang & Baoxin Xiu & Zhong Liu & Jincai Huang, 2014. "Key potential-oriented criticality analysis for complex military organization based on FINC-E model," Computational and Mathematical Organization Theory, Springer, vol. 20(3), pages 278-301, September.
    • Handle: RePEc:spr:comaot:v:20:y:2014:i:3:d:10.1007_s10588-013-9163-0
    DOI: 10.1007/s10588-013-9163-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10588-013-9163-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/s10588-013-9163-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. 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.
    2. Gilles, Robert P. & Chakrabarti, Subhadip & Sarangi, Sudipta & Badasyan, Narine, 2006. "Critical agents in networks," Mathematical Social Sciences, Elsevier, vol. 52(3), pages 302-310, December.
    3. Stephen P. Borgatti, 2006. "Identifying sets of key players in a social network," Computational and Mathematical Organization Theory, Springer, vol. 12(1), pages 21-34, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ren, Baoan & Zhang, Yu & Chen, Jing & Shen, Lincheng, 2019. "Efficient network disruption under imperfect information: The sharpening effect of network reconstruction with no prior knowledge," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 520(C), pages 196-207.
    2. Fan, Changjun & Liu, Zhong & Lu, Xin & Xiu, Baoxin & Chen, Qing, 2017. "An efficient link prediction index for complex military organization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 572-587.

    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, Cheng & Liu, Zhonghua & Wang, Juyun & Yu, Hua & Guo, Xiaoling, 2017. "An optimal approach for the critical node problem using semidefinite programming," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 315-324.
    2. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    3. Liu, Jie & Li, Yunpeng & Ruan, Zichan & Fu, Guangyuan & Chen, Xiaowu & Sadiq, Rehan & Deng, Yong, 2015. "A new method to construct co-author networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 29-39.
    4. 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.
    5. Mark J. O. Bagley, 2019. "Networks, geography and the survival of the firm," Journal of Evolutionary Economics, Springer, vol. 29(4), pages 1173-1209, September.
    6. Hosseinali Salemi & Austin Buchanan, 2022. "Solving the Distance-Based Critical Node Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1309-1326, May.
    7. Wei, Daijun & Deng, Xinyang & Zhang, Xiaoge & Deng, Yong & Mahadevan, Sankaran, 2013. "Identifying influential nodes in weighted networks based on evidence theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2564-2575.
    8. Chaharborj, Sarkhosh Seddighi & Nabi, Khondoker Nazmoon & Feng, Koo Lee & Chaharborj, Shahriar Seddighi & Phang, Pei See, 2022. "Controlling COVID-19 transmission with isolation of influential nodes," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    9. Raddant, Matthias & Takahashi, Hiroshi, 2019. "The Japanese corporate board network," Kiel Working Papers 2130, Kiel Institute for the World Economy (IfW Kiel).
    10. Marco Di Summa & Syed Md Omar Faruk, 2023. "Critical node/edge detection problems on trees," 4OR, Springer, vol. 21(3), pages 439-455, September.
    11. Faxu Li & Hui Xu & Liang Wei & Defang Wang, 2023. "RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-13, January.
    12. Heetae Kim & Petter Holme, 2015. "Network Theory Integrated Life Cycle Assessment for an Electric Power System," Sustainability, MDPI, vol. 7(8), pages 1-15, August.
    13. Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2014. "An integer programming framework for critical elements detection in graphs," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 233-273, July.
    14. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    15. Lindquist, Matthew J. & Zenou, Yves, 2019. "Crime and Networks: 10 Policy Lessons," IZA Discussion Papers 12534, Institute of Labor Economics (IZA).
    16. AskariSichani, Omid & Jalili, Mahdi, 2015. "Influence maximization of informed agents in social networks," Applied Mathematics and Computation, Elsevier, vol. 254(C), pages 229-239.
    17. Caterina Liberati & Massimiliano Marzo & Paolo Zagaglia & Paola Zappa, 2015. "Drivers of demand and supply in the Euro interbank market: the role of “Key Players” during the recent turmoil," Financial Markets and Portfolio Management, Springer;Swiss Society for Financial Market Research, vol. 29(3), pages 207-250, August.
    18. Mishael Milaković & Simone Alfarano & Thomas Lux, 2010. "The small core of the German corporate board network," Computational and Mathematical Organization Theory, Springer, vol. 16(2), pages 201-215, June.
    19. Deb Verhoeven & Katarzyna Musial & Stuart Palmer & Sarah Taylor & Shaukat Abidi & Vejune Zemaityte & Lachlan Simpson, 2020. "Controlling for openness in the male-dominated collaborative networks of the global film industry," PLOS ONE, Public Library of Science, vol. 15(6), pages 1-23, June.
    20. Shugang Li & Ziming Wang & Beiyan Zhang & Boyi Zhu & Zhifang Wen & Zhaoxu Yu, 2022. "The Research of “Products Rapidly Attracting Users” Based on the Fully Integrated Link Prediction Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-19, July.

    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:comaot:v:20:y:2014:i:3:d:10.1007_s10588-013-9163-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.