메뉴 건너뛰기




Volumn , Issue , 2010, Pages 390-403

Estimating and sampling graphs with multidimensional random walks

Author keywords

Assortativity; Estimates; Frontier sampling; Global clustering coefficient; MCMC; Power laws; Random walks

Indexed keywords

COMPLEX NETWORKS; DATA MINING; ESTIMATION; GRAPH THEORY; RANDOM ERRORS; RANDOM PROCESSES; SAMPLING;

EID: 78650856898     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1879141.1879192     Document Type: Conference Paper
Times cited : (308)

References (38)
  • 1
    • 68549135094 scopus 로고    scopus 로고
    • On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs
    • Dimitris Achlioptas, Aaron Clauset, David Kempe, and Cristopher Moore. On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. J. ACM, 56(4):1-28, 2009.
    • (2009) J. ACM , vol.56 , Issue.4 , pp. 1-28
    • Achlioptas, D.1    Clauset, A.2    Kempe, D.3    Moore, C.4
  • 2
    • 36049047725 scopus 로고    scopus 로고
    • The power of choice in random walks: An empirical study
    • Chen Avin and Bhaskar Krishnamachari. The power of choice in random walks: An empirical study. Comput. Netw., 52(1):44-60, 2008.
    • (2008) Comput. Netw. , vol.52 , Issue.1 , pp. 44-60
    • Chen, A.1    Bhaskar, K.2
  • 4
    • 56349136928 scopus 로고    scopus 로고
    • Random sampling from a search engine's index
    • Ziv Bar-Yossef and Maxim Gurevich. Random sampling from a search engine's index. J. ACM, 55(5):1-74, 2008.
    • (2008) J. ACM , vol.55 , Issue.5 , pp. 1-74
    • Bar-Yossef, Z.1    Gurevich, M.2
  • 5
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.
    • (1999) Science , vol.286 , pp. 509-512
    • Barabási, A.-L.1    Albert, R.2
  • 6
    • 33846885044 scopus 로고    scopus 로고
    • Optimizing random walk search algorithms in p2p networks
    • Nabhendra Bisnik and Alhussein A. Abouzeid. Optimizing random walk search algorithms in p2p networks. Computer Networks, 51(6):1499-1514, 2007.
    • (2007) Computer Networks , vol.51 , Issue.6 , pp. 1499-1514
    • Bisnik, N.1    Abouzeid, A.A.2
  • 9
    • 0032673977 scopus 로고    scopus 로고
    • Lifting Markov chains to speed up mixing
    • Fang Chen, László Lovász, and Igor Pak. Lifting Markov chains to speed up mixing. In Proc. of STOC, pages 275-281, 1999.
    • (1999) Proc. of STOC , pp. 275-281
    • Chen, F.1    Lovász, L.2    Pak, I.3
  • 11
    • 70349313631 scopus 로고    scopus 로고
    • Inferring friendship network structure by using mobile phone data
    • August
    • Nathan Eagle, Alex S. Pentland, and David Lazer. Inferring friendship network structure by using mobile phone data. PNAS, 106(36):15274-15278, August 2009.
    • (2009) PNAS , vol.106 , Issue.36 , pp. 15274-15278
    • Eagle, N.1    Pentland, A.S.2    Lazer, D.3
  • 14
    • 84972511893 scopus 로고
    • Practical markov chain Monte Carlo
    • Charles J. Geyer. Practical Markov Chain Monte Carlo. Statistical Science, 7(4):473-483, 1992.
    • (1992) Statistical Science , vol.7 , Issue.4 , pp. 473-483
    • Geyer, C.J.1
  • 15
    • 78650115969 scopus 로고    scopus 로고
    • A walk in Facebook: Uniform sampling of users in online social networks
    • March
    • Minas Gjoka, Maciej Kurant, Carter T. Butts, and Athina Markopoulou. A walk in Facebook: Uniform sampling of users in online social networks. In Proc. of the IEEE Infocom, March 2010.
    • (2010) Proc. of the IEEE Infocom
    • Gjoka, M.1    Kurant, M.2    Butts, C.T.3    Markopoulou, A.4
  • 16
    • 28244494114 scopus 로고    scopus 로고
    • Random walks in peer-to-peer networks: Algorithms and evaluation
    • March
    • Christos Gkantsidis, Milena Mihail, and Amin Saberi. Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval., 63(3):241-263, March 2006.
    • (2006) Perform. Eval. , vol.63 , Issue.3 , pp. 241-263
    • Gkantsidis, C.1    Mihail, M.2    Saberi, A.3
  • 19
    • 33749581229 scopus 로고    scopus 로고
    • Sampling from large graphs
    • Jure Leskovec and Christos Faloutsos. Sampling from large graphs. In Proc. of the KDD, pages 631-636, 2006.
    • (2006) Proc. of the KDD , pp. 631-636
    • Leskovec, J.1    Faloutsos, C.2
  • 20
    • 52949106331 scopus 로고    scopus 로고
    • Statistical properties of community structure in large social and information networks
    • Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, and Michael W. Mahoney. Statistical properties of community structure in large social and information networks. In Proc. of the WWW, pages 695-704, 2008.
    • (2008) Proc. of the WWW , pp. 695-704
    • Leskovec, J.1    Lang, K.J.2    Dasgupta, A.3    Mahoney, M.W.4
  • 22
    • 0006217743 scopus 로고
    • Random walks on graphs: A survey
    • L. Lovász. Random walks on graphs: a survey. Combinatorics, 2:1-46, 1993.
    • (1993) Combinatorics , vol.2 , pp. 1-46
    • Lovász, L.1
  • 23
    • 33748700606 scopus 로고    scopus 로고
    • Peer counting and sampling in overlay networks: Random walk methods
    • Laurent Massoulié, Erwan Le Merrer, Anne-Marie Kermarrec, and Ayalvadi Ganesh. Peer counting and sampling in overlay networks: random walk methods. In Proc. of the PODC, pages 123-132, 2006.
    • (2006) Proc. of the PODC , pp. 123-132
    • Massoulié, L.1    Le Merrer, E.2    Kermarrec, A.-M.3    Ganesh, A.4
  • 27
    • 18744389789 scopus 로고    scopus 로고
    • Assortative mixing in networks
    • Oct
    • M. E. J. Newman. Assortative mixing in networks. Phys. Rev. Lett., 89(20):208701, Oct 2002.
    • (2002) Phys. Rev. Lett. , vol.89 , Issue.20 , pp. 208701
    • Newman, M.E.J.1
  • 28
    • 0038718854 scopus 로고    scopus 로고
    • The structure and function of complex networks
    • M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
    • (2003) SIAM Review , vol.45 , Issue.2 , pp. 167-256
    • Newman, M.E.J.1
  • 34
    • 27844434308 scopus 로고    scopus 로고
    • Approximating clustering-coefficient and transitivity
    • Thomas Schank and Dorothea Wagner. Approximating clustering-coefficient and transitivity. Journal of Graph Algorithms and Applications, 9(2):265-275, 2004.
    • (2004) Journal of Graph Algorithms and Applications , vol.9 , Issue.2 , pp. 265-275
    • Schank, T.1    Wagner, D.2
  • 35
    • 67349214053 scopus 로고    scopus 로고
    • On unbiased sampling for unstructured peer-to-peer networks
    • Daniel Stutzbach, Reza Rejaie, Nick Duffield, Subhabrata Sen, and Walter Willinger. On unbiased sampling for unstructured peer-to-peer networks. IEEE/ACM Trans. Netw., 17(2):377-390, 2009.
    • (2009) IEEE/ACM Trans. Netw. , vol.17 , Issue.2 , pp. 377-390
    • Stutzbach, D.1    Rejaie, R.2    Duffield, N.3    Sen, S.4    Willinger, W.5
  • 36
    • 77956874564 scopus 로고    scopus 로고
    • Probability based estimation theory for Respondent-Driven Sampling
    • Erik Volz and Douglas D. Heckathorn. Probability based estimation theory for Respondent-Driven Sampling. Journal of Official Statistics, 2008.
    • (2008) Journal of Official Statistics
    • Volz, E.1    Heckathorn, D.D.2
  • 37
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of "small world" networks
    • June
    • D.J. Watts and S.H. Strogatz. Collective dynamics of "small world" networks. Nature, 393:440-442, June 1998.
    • (1998) Nature , vol.393 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 38
    • 33748057130 scopus 로고    scopus 로고
    • Random walk based node sampling in self-organizing networks
    • Ming Zhong and Kai Shen. Random walk based node sampling in self-organizing networks. SIGOPS Oper. Syst. Rev., 40(3):49-55, 2006.
    • (2006) SIGOPS Oper. Syst. Rev. , vol.40 , Issue.3 , pp. 49-55
    • Zhong, M.1    Shen, K.2


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