메뉴 건너뛰기




Volumn 67, Issue 1-2, 2012, Pages 61-64

Classical random graphs with unbounded expected degrees are locally scale-free

Author keywords

02.50.Cw; 89.75.Da; Complex Network PACS numbers: 89.75.Hc; Degree; Random Graph; Scale Free

Indexed keywords


EID: 84864505492     PISSN: 09320784     EISSN: None     Source Type: Journal    
DOI: 10.5560/ZNA.2011-0053     Document Type: Article
Times cited : (1)

References (24)
  • 1
    • 77954826067 scopus 로고    scopus 로고
    • Networks: An Introduction. Oxford University Press, Oxford 2010.
    • M. Newman, Networks: An Introduction. Oxford University Press, Oxford 2010.
    • Newman, M.1
  • 9
    • 0003948494 scopus 로고
    • Social Network Analysis
    • Cambridge University Press, Cambridge
    • S. Wasserman and K. Faust, Social Network Analysis. Cambridge University Press, Cambridge 1994.
    • (1994)
    • Wasserman, S.1    Faust, K.2
  • 12
    • 84864515877 scopus 로고    scopus 로고
    • Random Graphs. Cambridge University Press, Cambridge
    • B. Bollobás, Random Graphs. Cambridge University Press, Cambridge 2001.
    • (2001)
    • Bollobás, B.1
  • 17
    • 84922962285 scopus 로고    scopus 로고
    • Complex Networks: Structure, Robustness and Function
    • Cambridge University Press, Cambridge
    • R. Cohen and S. Havlin, Complex Networks: Structure, Robustness and Function. Cambridge University Press, Cambridge 2010.
    • (2010)
    • Cohen, R.1    Havlin, S.2
  • 18
    • 79960165408 scopus 로고    scopus 로고
    • Y. Shang, EPL 95, 28005 (2011).
    • (2011) EPL , vol.95 , pp. 28005
    • Shang, Y.1
  • 24
    • 84864511165 scopus 로고    scopus 로고
    • Local degree distribution in scale free random graphs
    • arXiv:1007.4314
    • Á. Backhausz and T. F. Móri, Local degree distribution in scale free random graphs. arXiv:1007.4314
    • Backhausz, Á.1    Móri, T.F.2


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