EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 244 (2020) EPJ Web Conf., 244 (2020) 01004 References
Open Access
Issue
EPJ Web Conf.
Volume 244, 2020
Complexity and Disorder Meetings 2018-2019-2020
Article Number 01004
Number of page(s) 17
DOI https://doi.org/10.1051/epjconf/202024401004
Published online 15 October 2020
  1. Adilson E. Motter, Ying-Cheng Lai, (2002), Cascade-based attacks on complex networks, Physical Review, E66, 065102 [Google Scholar]
  2. Albert, R., Jeong H., Barabasi A. L., (2000), Error and attack tolerance of complex networks, Nature, 406, 378-82. [CrossRef] [PubMed] [Google Scholar]
  3. Anthonisse, J.M. (1971). The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde. Stichting Mathematisch Centrum. [Google Scholar]
  4. Bavelas A., (1948), A mathematical model for group structure, Applied Anthropology, 7:16-30. [Google Scholar]
  5. Berge C., (1962), The Theory of Graphs, Methuen & Co, London, translated from the french edition published in 1958 by Dunod. (p. 203) [Google Scholar]
  6. Bidart C., Charbonneau J., 2011, “How to Generate Personal Networks: Issues and Tools for a Sociological Perspective”, Field Methods, Vol. 23, n03, pp. 266-286. [CrossRef] [Google Scholar]
  7. Bidart C., Degenne A., Grossetti M., 2011, La vie en réseau. Dynamique des relations sociales, Paris, PUF. [Google Scholar]
  8. Bidart C., Degenne A., Grossetti M., 2018, Personal Networks Typologiesa: A Structural Approach, Social Networks., 54, 1-11. [CrossRef] [Google Scholar]
  9. Borgatti S.P., Everett M.G., (2006), A Graphtheoretic perspective on centrality, Social Networks, 28, 466-484. [CrossRef] [Google Scholar]
  10. Brandes U., (2008), On variants of shortest-path Betweenness centrality and their generic computation, Social Networks 30 (2), 136-145. [CrossRef] [Google Scholar]
  11. Brandes U., Borgatti S.P., Freeman L.C., (2016), Maintaining the duality of closeness and betweenness centrality, Social Networks, 44, 153-159 [CrossRef] [Google Scholar]
  12. Burt R. S., (1992), Structural Holes: The Social Structure of Competition, Harvard University Press, Cambridge. [Google Scholar]
  13. Burt R. S., (2007), Brokerage and Closure: An introduction to Social Capital, Oxford University Press, New York. [Google Scholar]
  14. Cunningham P., Harrigan M., Wu G., O’Callaghan D., 2013, Characterizing egonetworks using motifs, Network Science, 1(2), 170-190. [Google Scholar]
  15. De Nooy W., Mrvar A., Batagelj V., (2005), Exploratory Social Network Analysis with Pajek, Cambridge University Press. [CrossRef] [Google Scholar]
  16. Everett M. G., Borgatti S. P., (2005), Ego network betweenness, Social Networks 27 31-38. [CrossRef] [Google Scholar]
  17. Everett M. G.,Valente T.H., (2016), Bridging, brokerage and betweenness, Social Networks, 44, 202-208. [CrossRef] [PubMed] [Google Scholar]
  18. Everett, M. G., & Borgatti, S. P., (1999). The centrality of groups and classes. Journal of Mathematical Sociology. 23(3): 181-201. [CrossRef] [Google Scholar]
  19. Flament C. (1962), L’analyse de similitude, Cahiers du Centre de recherche opérationnelle, Bruxelles, 4-2, 63-97 [Google Scholar]
  20. Freeman L., (1977), A set of measures of centrality based on betweenness, Sociometry, 40-1, 35-41. [CrossRef] [Google Scholar]
  21. Freeman L., (1978), Centrality in Social Networks, Conceptual Clarification, Social Networks 1, 215-239. [CrossRef] [Google Scholar]
  22. Freeman L. C., (1982), Centered graphs andthe structure of Ego networks, Mathematical Social Sciences 3, 291-304. [CrossRef] [Google Scholar]
  23. Gould R. V., Fernandez R. M., (1989), Structures of mediation : a formal approach to Brokerage in transaction Networks, Sociological Methodology, 19, 89-126. [CrossRef] [Google Scholar]
  24. Milo R., Shen-Orr S., Itzkovitz S. Kashtan N., Chklovskii D. Alon U., 2002, Network Motifsa: Simple Building Blocks of complex Networks, Science, 298, October 2002, 824-827. [CrossRef] [PubMed] [Google Scholar]
  25. Newman M. E. J., 2003, The structure and function of complex networks, 2003, Review of the Society for Industrial and Applied Mathematics (SIAM), vol 45, n0 2, 167-256. [Google Scholar]
  26. Newman M.E.J., Girvan M., (2003). Finding and evaluating community structure in networks, Stat. Mech., 11 [Google Scholar]
  27. Petter Holme, Beom Jun Kim, Chang No Yoon, Seung Kee Han, (2002) , Attack Vulnerability of complex Networks, PACS numbers 89.75.Fb, 89.75.Hc, 89.65.-s [Google Scholar]
  28. Ravasz E., Barabasi A. L., 2008, Hierarchical organization in complex networks, PACS numbers: 89.75.-k, 89.20.Hh, 05.65.+b Références [Google Scholar]
  29. Rosenstiehl P., (1967), L’arbre minimum d’un graphe. in “Theory of Graphs, International Symposium,” pp. 357-368. [Google Scholar]
  30. Gordon & Breach, New York. Sur S., Ganguly N., Mukherjee A., 2016, Brokerage-based attack on real world temporal networks, Network Science 4(4), 446-459. [Google Scholar]
  31. Yong Li, Wenguo Li, Yi Tan, Fang Liu, Yijia Cao, Kwang Y. Lee, (2017), Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks, Scientific Reports, 7, 46491; doi:10.1038/srep46491. Zhe-Ming LU, Xin-Feng Li, (2016), Attack Vulnerability of Network Controlability, PLoS ONE 11(9): e0162289. doi: 10.137/journal.pone.0162289 [CrossRef] [PubMed] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.