메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Analysing information flows and key mediators through temporal centrality metrics

Author keywords

Complex networks; Information diffusion; Key mediators; Social networks; Temporal centrality; Temporal graphs; Temporal metrics

Indexed keywords

COMPLEX NETWORKS; INFORMATION DIFFUSION; KEY MEDIATORS; SOCIAL NETWORKS; TEMPORAL CENTRALITY; TEMPORAL GRAPHS; TEMPORAL METRICS;

EID: 77958028567     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1852658.1852661     Document Type: Conference Paper
Times cited : (166)

References (22)
  • 1
    • 1642308591 scopus 로고    scopus 로고
    • The architecture of complex weighted networks
    • Mar
    • A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani. The architecture of complex weighted networks. PNAS, 101(11):3747-3752, Mar. 2004.
    • (2004) PNAS , vol.101 , Issue.11 , pp. 3747-3752
    • Barrat, A.1    Barthélemy, M.2    Pastor-Satorras, R.3    Vespignani, A.4
  • 5
    • 60549103853 scopus 로고    scopus 로고
    • Complex brain networks: Graph theoretical analysis of structural and functional systems
    • Mar
    • E. Bullmore and O. Sporns. Complex brain networks: graph theoretical analysis of structural and functional systems. Nat. Rev. Neurosci., 10(3):186-198, Mar. 2009.
    • (2009) Nat. Rev. Neurosci. , vol.10 , Issue.3 , pp. 186-198
    • Bullmore, E.1    Sporns, O.2
  • 6
  • 9
    • 63049119529 scopus 로고    scopus 로고
    • Social network analysis for information ow in disconnected Delay-Tolerant MANETs
    • E. Daly and M. Haahr. Social network analysis for information ow in disconnected Delay-Tolerant MANETs. IEEE Transactions on Mobile Computing, 8(5):606-621, 2009.
    • (2009) IEEE Transactions on Mobile Computing , vol.8 , Issue.5 , pp. 606-621
    • Daly, E.1    Haahr, M.2
  • 10
    • 33847112108 scopus 로고    scopus 로고
    • Scale-free topology of e-mail networks
    • H. Ebel, L. Mielsch, and S. Bornholdt. Scale-free Topology of E-mail Networks. Phys. Rev. E, 66(3):035103, 2002.
    • (2002) Phys. Rev. e , vol.66 , Issue.3 , pp. 035103
    • Ebel, H.1    Mielsch, L.2    Bornholdt, S.3
  • 13
    • 4944247593 scopus 로고    scopus 로고
    • Congestion and centrality in traffc flow on complex networks
    • P. Holmes. Congestion and centrality in traffc flow on complex networks. Advances in Complex Systems, 6(2):163-176, 2003.
    • (2003) Advances in Complex Systems , vol.6 , Issue.2 , pp. 163-176
    • Holmes, P.1
  • 14
    • 45049086094 scopus 로고    scopus 로고
    • Identifying important species: Linking structure and function in ecological networks
    • Aug
    • F. Jordan, T. A. Okey, B. Bauer, and S. Libralato. Identifying important species: Linking structure and function in ecological networks. Ecological Modelling, 216(1):75-80, Aug. 2008.
    • (2008) Ecological Modelling , vol.216 , Issue.1 , pp. 75-80
    • Jordan, F.1    Okey, T.A.2    Bauer, B.3    Libralato, S.4
  • 15
  • 16
    • 0002282074 scopus 로고
    • A new measure of rank correlation
    • M. G. Kendall. A new measure of rank correlation. Biometrika, 30(1-2):81-93, 1938.
    • (1938) Biometrika , vol.30 , Issue.1-2 , pp. 81-93
    • Kendall, M.G.1
  • 17
    • 0242540464 scopus 로고    scopus 로고
    • Bursty and hierarchical structure in streams
    • Edmonton, Alberta, Canada, ACM
    • J. Kleinberg. Bursty and hierarchical structure in streams. In Proceedings of SIGKDD '02, pages 91-101, Edmonton, Alberta, Canada, 2002. ACM.
    • (2002) Proceedings of SIGKDD '02 , pp. 91-101
    • Kleinberg, J.1
  • 18
    • 13944252976 scopus 로고    scopus 로고
    • A measure of betweenness centrality based on random walks
    • M. J. Newman. A measure of betweenness centrality based on random walks. Social Networks, 27(1):39-54, 2005.
    • (2005) Social Networks , vol.27 , Issue.1 , pp. 39-54
    • Newman, M.J.1
  • 19
    • 84958155918 scopus 로고    scopus 로고
    • Discovering important nodes through graph entropy the case of Enron email database
    • Chicago, Illinois, ACM
    • J. Shetty and J. Adibi. Discovering important nodes through graph entropy the case of Enron email database. In Proceedings of the 3rd International Workshop on Link Discovery, pages 74-81, Chicago, Illinois, 2005. ACM.
    • (2005) Proceedings of the 3rd International Workshop on Link Discovery , pp. 74-81
    • Shetty, J.1    Adibi, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.