메뉴 건너뛰기




Volumn 133, Issue 1, 2008, Pages 169-202

Universality for the distance in finite variance random graphs

Author keywords

Branching processes; Coupling; Graph distances; Inhomogeneous random graphs; Random Graphs; Universality

Indexed keywords


EID: 52149087216     PISSN: 00224715     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10955-008-9594-z     Document Type: Article
Times cited : (63)

References (21)
  • 1
    • 24144495367 scopus 로고
    • Some martingale methods in the limit theory of supercritical branching processes
    • Advances in Probability and related Topics
    • Asmussen, S.: Some martingale methods in the limit theory of supercritical branching processes. In: Branching Processes. Advances in Probability and related Topics, pp. 1-26 (1978)
    • (1978) Branching Processes , pp. 1-26
    • Asmussen, S.1
  • 2
    • 0000664045 scopus 로고
    • The asymptotic number of labelled graphs with given degree sequences
    • 3
    • E.A. Bender E.R. Canfield 1978 The asymptotic number of labelled graphs with given degree sequences J. Comb. Theory A 24 3 296 307
    • (1978) J. Comb. Theory A , vol.24 , pp. 296-307
    • Bender, E.A.1    Canfield, E.R.2
  • 3
    • 0004219960 scopus 로고    scopus 로고
    • Cambridge University Press Cambridge
    • Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
    • (2001) Random Graphs
    • Bollobás, B.1
  • 6
    • 33750091606 scopus 로고    scopus 로고
    • Generating simple random graphs with prescribed degree distribution
    • 6
    • T. Britton M. Deijfen A. Martin-Löf 2006 Generating simple random graphs with prescribed degree distribution J. Stat. Phys. 124 6 1377 1397
    • (2006) J. Stat. Phys. , vol.124 , pp. 1377-1397
    • Britton, T.1    Deijfen, M.2    Martin-Löf, A.3
  • 7
    • 0037058980 scopus 로고    scopus 로고
    • The average distances in random graphs with expected degrees
    • 25
    • F. Chung L. Lu 2002 The average distances in random graphs with expected degrees Proc Natl. Acad. Sci. 99 25 15879 15882
    • (2002) Proc Natl. Acad. Sci. , vol.99 , pp. 15879-15882
    • Chung, F.1    Lu, L.2
  • 8
    • 0038763983 scopus 로고    scopus 로고
    • Connected components in random graphs with given expected degree sequences
    • 2
    • F. Chung L. Lu 2002 Connected components in random graphs with given expected degree sequences Ann. Comb. 6 2 125 145
    • (2002) Ann. Comb. , vol.6 , pp. 125-145
    • Chung, F.1    Lu, L.2
  • 14
    • 34249731448 scopus 로고    scopus 로고
    • Distances in random graphs with finite mean and infinite variance degrees
    • R. van der Hofstad G. Hooghiemstra D. Znamenski 2007 Distances in random graphs with finite mean and infinite variance degrees Electron. J. Probab. 12 703 766
    • (2007) Electron. J. Probab. , vol.12 , pp. 703-766
    • Van Der Hofstad, R.1    Hooghiemstra, G.2    Znamenski, D.3
  • 18
    • 0035420732 scopus 로고    scopus 로고
    • Random graphs with arbitrary degree distribution and their application
    • M.E.J. Newman S.H. Strogatz D.J. Watts 2001 Random graphs with arbitrary degree distribution and their application Phys. Rev. E 64 026118
    • (2001) Phys. Rev. e , vol.64 , pp. 026118
    • Newman, M.E.J.1    Strogatz, S.H.2    Watts, D.J.3
  • 19
    • 0242526824 scopus 로고    scopus 로고
    • On the power-law random graph model of massive data networks
    • 1-2
    • I. Norros H. Reittu 2004 On the power-law random graph model of massive data networks Perform. Eval. 55 1-2 3 23
    • (2004) Perform. Eval. , vol.55 , pp. 3-23
    • Norros, I.1    Reittu, H.2
  • 20
    • 33646150930 scopus 로고    scopus 로고
    • On a conditionally Poissonian graph process
    • 1
    • I. Norros H. Reittu 2006 On a conditionally Poissonian graph process Adv. Appl. Probab. 38 1 59 75
    • (2006) Adv. Appl. Probab. , vol.38 , pp. 59-75
    • Norros, I.1    Reittu, H.2


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