863
个编辑
更改
跳到导航
跳到搜索
第238行：
第238行： − + − :德克·科舒茨基,凯瑟琳·安娜·莱曼,利昂·皮特斯,斯特凡·里克特,斯特凡·里克特,奥利弗·兹洛托夫斯基,《中心指数》,引用为《网络分析：方法论基础》第16-61页 − <br/> − + − :乌尔里克·布兰德斯,托马斯·埃利巴赫,计算机科学(柏林-海德 堡斯普林格 2005)+ +
→进一步阅读
==进一步阅读==
==进一步阅读==
*Koschützki, D.; Lehmann, K. A.; Peeters, L.; Richter, S.; Tenfelde-Podehl, D. and Zlotowski, O. (2005) Centrality Indices《中心指数》[https://link.springer.com/chapter/10.1007/978-3-540-31955-9_3]. In Brandes, U. and Erlebach, T. (Eds.) Network Analysis: Methodological Foundations pp. 16–61, LNCS 3418, Springer-Verlag.
*实验研究和理论研究以将静态网络中的中心性概念扩展到了时空和时间网络中的动态中心<ref>{{cite journal | last1 = Braha | first1 = D. | last2 = Bar-Yam | first2 = Y. | year = 2006 | title = From Centrality to Temporary Fame: Dynamic Centrality in Complex Networks | url = | journal = Complexity | volume = 12 | issue = 2| pages = 59–63 | doi=10.1002/cplx.20156| arxiv = physics/0611295 | bibcode = 2006Cmplx..12b..59B }}</ref>。 in the context of time-dependent and temporal networks.<ref>{{cite journal | last1 = Hill | first1 = S.A. | last2 = Braha | first2 = D. | year = 2010 | title = Dynamic Model of Time-Dependent Complex Networks | url = | journal = Physical Review E | volume = 82 | issue = 4| page = 046105 | doi=10.1103/physreve.82.046105| pmid = 21230343 | arxiv = 0901.4407 | bibcode = 2010PhRvE..82d6105H }}</ref><ref>Gross, T. and Sayama, H. (Eds.). 2009. ''Adaptive Networks: Theory, Models and Applications.'' Springer.</ref><ref>Holme, P. and Saramäki, J. 2013. ''Temporal Networks.'' Springer.</ref>
*Ulrik Brandes,Thomas Erlebach 《Network Analysis：Methodological Foundations》，《网络分析：方法论基础》[https://link.springer.com/book/10.1007/b106453#about],
*有关加权网络的一般，请参见Opsahl (2010).<ref>{{cite journal | last1 = Opsahl | first1 = Tore | last2 = Agneessens | first2 = Filip | last3 = Skvoretz | first3 = John | title = Node centrality in weighted networks: Generalizing degree and shortest paths | doi = 10.1016/j.socnet.2010.03.006 | year = 2010 | pages = 245–251 | volume = 32 | journal = Social Networks | url=http://toreopsahl.com/2010/04/21/article-node-centrality-in-weighted-networks-generalizing-degree-and-shortest-paths/ | issue = 3 }}</ref>
*集中性的概念也扩展到了团体层面。 例如, '''组件居中性''' 表示连接通过组的非组成员对的测地线比例。<ref name="group1">Everett, M. G. and Borgatti, S. P. (2005). Extending centrality. In P. J. Carrington, J. Scott and S. Wasserman (Eds.), ''Models and methods in social network analysis'' (pp. 57–76). New York: Cambridge University Press.</ref><ref name="group2">Puzis, R., Yagil, D., Elovici, Y., Braha, D. (2009).[http://necsi.edu/affiliates/braha/Internet_Research_Anonimity.pdf Collaborative attack on Internet users’ anonymity] {{Webarchive|url=https://web.archive.org/web/20131207133417/http://necsi.edu/affiliates/braha/Internet_Research_Anonimity.pdf |date=2013-12-07 }}, ''Internet Research'' '''19'''(1)</ref>
<br/>
<br/>