메뉴 건너뛰기




Volumn 32, Issue 1, 2015, Pages 99-112

Inferring global network properties from egocentric data with applications to epidemics

Author keywords

Egocentric data; Epidemics; Giant component; Network

Indexed keywords

'CURRENT; ASYMPTOTICS; EGOCENTRIC DATA; GIANT COMPONENTS; GLOBAL NETWORKS; GLOBAL PROPERTIES; LARGEST CONNECTED COMPONENT; NETWORK; NETWORK PROPERTIES;

EID: 84925423836     PISSN: 14778599     EISSN: 14778602     Source Type: Journal    
DOI: 10.1093/imammb/dqt022     Document Type: Article
Times cited : (4)

References (19)
  • 2
    • 11944253901 scopus 로고    scopus 로고
    • 2nd edn. Cambridge: Cambridge University Press
    • Bollobás, B. (2001) Random Graphs, 2nd edn. Cambridge: Cambridge University Press.
    • (2001) Random Graphs
    • Bollobás, B.1
  • 3
    • 77951498127 scopus 로고    scopus 로고
    • Stochastic epidemic models: a survey
    • Britton, T. (2010) Stochastic epidemic models: a survey. Math. Biosci., 225, 24-35.
    • (2010) Math. Biosci. , vol.225 , pp. 24-35
    • Britton, T.1
  • 4
    • 39649095169 scopus 로고    scopus 로고
    • Graphs with specified degree distributions, simple epidemics and local vaccination strategies
    • Britton, T., Janson, S. & Martin-Löf, A. (2007) Graphs with specified degree distributions, simple epidemics and local vaccination strategies. Adv. Appl. Prob., 39, 922-948.
    • (2007) Adv. Appl. Prob. , vol.39 , pp. 922-948
    • Britton, T.1    Janson, S.2    Martin-Löf, A.3
  • 5
    • 84872337246 scopus 로고    scopus 로고
    • Maximizing the size of the giant
    • Britton, T. & Trapman, P. (2012) Maximizing the size of the giant. J. Appl. Prob., 49, 24-35.
    • (2012) J. Appl. Prob. , vol.49 , pp. 24-35
    • Britton, T.1    Trapman, P.2
  • 6
    • 84929729015 scopus 로고    scopus 로고
    • Cambridge: Cambridge University Press
    • Durrett, R. (2006) Random Graph Dynamics. Cambridge: Cambridge University Press.
    • (2006) Random Graph Dynamics
    • Durrett, R.1
  • 7
    • 0001540595 scopus 로고
    • On random graphs. I
    • Erd{double acute accent}os, P. & Rényi, A. (1959) On random graphs. I. Publ. Math., 6, 290-297.
    • (1959) Publ. Math. , vol.6 , pp. 290-297
    • Erdos, P.1    Rényi, A.2
  • 8
    • 0034351078 scopus 로고    scopus 로고
    • The Maki-Thompson rumour model: a detailed analysis
    • Gani, J. (2000) The Maki-Thompson rumour model: a detailed analysis. Environ. Model. Softw., 15, 721-725.
    • (2000) Environ. Model. Softw. , vol.15 , pp. 721-725
    • Gani, J.1
  • 9
    • 77949498052 scopus 로고    scopus 로고
    • Six degrees of 'Who cares?'
    • Grannis, R. (2010) Six degrees of 'Who cares?'. Amer. J. Soc., 115, 991-1017.
    • (2010) Amer. J. Soc. , vol.115 , pp. 991-1017
    • Grannis, R.1
  • 12
    • 67349200773 scopus 로고    scopus 로고
    • Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models
    • Krivitsky, P. N., Handcock, M. S., Raftery, A. E. & Hoff, P. D. (2009) Representing degree distributions, clustering, and homophily in social networks with latent cluster random effects models. Soc. Netw., 31, 204-213.
    • (2009) Soc. Netw. , vol.31 , pp. 204-213
    • Krivitsky, P.N.1    Handcock, M.S.2    Raftery, A.E.3    Hoff, P.D.4
  • 13
    • 0036788699 scopus 로고    scopus 로고
    • Egocentric and sociocentric measures of network centrality
    • Marsden, P. V. (2002) Egocentric and sociocentric measures of network centrality. Soc. Netw., 24, 407-422.
    • (2002) Soc. Netw. , vol.24 , pp. 407-422
    • Marsden, P.V.1
  • 14
    • 77549087023 scopus 로고    scopus 로고
    • Percolation and epidemics in random clustered networks
    • Miller, J. C. (2009) Percolation and epidemics in random clustered networks. Phys. Rev. E, 80, 020901.
    • (2009) Phys. Rev. E , vol.80 , pp. 020901
    • Miller, J.C.1
  • 15
    • 33646509447 scopus 로고    scopus 로고
    • Egocentric, sociocentric, or dyadic? Identifying the appropriate level of analysis in the study of organizational networks
    • Mizruchi, M. S. & Marquis, C. (2006) Egocentric, sociocentric, or dyadic? Identifying the appropriate level of analysis in the study of organizational networks. Soc. Netw., 28, 187-208.
    • (2006) Soc. Netw. , vol.28 , pp. 187-208
    • Mizruchi, M.S.1    Marquis, C.2
  • 16
    • 84925382755 scopus 로고    scopus 로고
    • Pair approximations for spatial structures?
    • Mollison, D. (2004) Pair approximations for spatial structures? Oberwolfach Rep., 1, 2625-2627.
    • (2004) Oberwolfach Rep. , vol.1 , pp. 2625-2627
    • Mollison, D.1
  • 17
    • 0032286776 scopus 로고    scopus 로고
    • The size of the largest component of a random graph on a fixed degree sequence
    • Molloy, M. & Reed, B. (1998) The size of the largest component of a random graph on a fixed degree sequence. Combin. Probab. Comput., 7, 295-306.
    • (1998) Combin. Probab. Comput. , vol.7 , pp. 295-306
    • Molloy, M.1    Reed, B.2
  • 18
    • 0038718854 scopus 로고    scopus 로고
    • The structure and function of complex networks
    • Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Rev., 45, 167-256.
    • (2003) SIAM Rev. , vol.45 , pp. 167-256
    • Newman, M.E.J.1
  • 19
    • 80052665216 scopus 로고    scopus 로고
    • Recovering social networks from individual attributes
    • Polanski, A. & McVicar, D. (2011). Recovering social networks from individual attributes. J. Math. Soc., 35, 287-311.
    • (2011) J. Math. Soc. , vol.35 , pp. 287-311
    • Polanski, A.1    McVicar, D.2


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