Centrality measure in weighted networks based on an amoeboid algorithm

Journal of Information and Computational Science

Volumn 9, Issue 2, 2012, Pages 369-376

  Zhang, Yajuan ^a   Zhang, Zili ^a   Wei, Daijun ^a   Deng, Yong ^a,b  

^a SOUTHWEST UNIVERSITY   (China)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

Amoeboid algorithm; Centrality measures; Physarum centrality; Weighted networks

Indexed keywords

CENTRALITY MEASURES; PHYSARUM; SHORTEST PATH; WEIGHTED NETWORKS;

CRITICALITY (NUCLEAR FISSION);

ALGORITHMS;

EID: 84863011403     PISSN: 15487741     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. M. E. J. Newman, The structure and function of complex networks, SIAM Review, Vol. 45, No. 2, 2003, 167-256
2. L. C. Freeman, Centrality in social networks: Conceptual clarification, Social Networks, Vol. 1, No. 3, 1978, 215-239
3. A. Landherr, B. Friedl, J. Heidemann, A critical review of centrality measures in social networks, Business & Information Systems Engineering, Vol. 2, No. 6, 2010, 371-385
4. M. E. J. Newman, A measure of between centrality based on random walks, Social Networks, Vol. 27, 2005, 39-54
5. Y. Deng, F. T. S. Chan, Y. Wu, D. Wang, A new linguistic MCDM method based on multiple-criterion data fusion, Expert Systems with Applications, Vol. 38, 2011, 6985C6993
6. Y. Deng, W. Jiang, R. Sadiq, Modeling contaminant intrusion in water distribution networks: A new similarity-based DST method, Expert Systems with Applications, Vol. 38, No. 1, 2011, 571-578
7. Y. Deng, F. T. S. Chan, A new fuzzy dempster MCDM method and its application in supplier selectio, Expert Systems with Applications, Vol. 38, No. 8, 2010, 9854-9861
8. Y. Deng, X. Y. Su, D. Wang, Q. Li, Target recognition based on fuzzy dempster data fusion method, Defence Science Journal, Vol. 60, No. 5, 2010, 525-530
9. A. Barrat, M. Barthéleḿy, R. Pastor-Satorras, A. Vespignani, The architecture of complex weighted networks, Proceedings of the National Academy of Sciences, Vol. 101, No. 11, 2004, 3747-3752
10. M. E. J. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, Vol. 64, No. 1, 2001, 016132
11. T. Opsahl, F. Agneessens, J. Skvoretz, Node centrality in weighted networks: Generalizing degree and shortest paths, Social Network, Vol. 32, No. 3, 2010, 245-251
12. L. C. Freeman, S. P. Borgatti, D. R. White, Centrality in valued graphs: A measure of betweenness based on network flow, Social Networks, Vol. 13, No. 2, 1991, 141-154
13. T. Nakagaki, H. Yamada, M. Hara, Smart network solutions in an amoeboid organism, Biophysical Chemistry, Vol. 107, 2004, 1-5
14. H. Zhou, Z. Zhang, Y. Wu, T. Qian, Bio-inspired dynamic composition and reconfiguration of service-oriented internetware systems, Proceedings of the 2nd International Conference on Swarm Intelligence, Vol. 6728, 2011, 364-373
15. Y. Zhang, Z. Zhang, Y. Deng. An improved maze solving algorithm based on an amoeboid organism, Proceedings of the 23rd Chinese Control and Decision Conference, 2011, 1440-1443
16. A. Tero, S. Takagi, T. Saigusa, K. Ito, D. P. Bebber, M. D. Fricker, K. Yumiki, R. Kobayashi, T. Nakagaki, Rules for biologically inspired adaptive network design, Science, Vol. 327, 2010, 439-442
17. A. Tero, R. Kobayashi, T. Nakagaki, A mathematical model for adaptive transport network in path finding by true slime mold, Journal of Theoretical Biology, Vol. 244, 2007, 553-564
18. H. R. Bernard, P. Killworth, L. Sailer, Informant accuracy in social network data V, Social Science Research, Vol. 11, 1982, 30-66
19. A. K. Romney, S. Weller, Predicting informant accuracy from patterns of recall among individuals, Social Networks, Vol. 6, 1984, 59-78
20. S. P. Borgatti, NetDraw: Graph visualization software, Harvard: Analytic Technologies, 2002