863
个编辑
更改
跳到导航
跳到搜索
第239行：
第239行： − −
→进一步阅读
==进一步阅读==
==进一步阅读==
*实验研究和理论研究以将静态网络中的中心性概念扩展到了时空和时间网络中的动态中心<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>
*实验研究和理论研究以将静态网络中的中心性概念扩展到了时空和时间网络中的动态中心<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>
*有关加权网络的一般，请参见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>
*有关加权网络的一般，请参见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>