File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A random-surfer web-graph model

TitleA random-surfer web-graph model
Authors
Blum, AChan, THHRwebangira, MR
KeywordsMathematical Models
Numerical Methods
Parameter Estimation
Random Processes
Issue Date2006
Citation
Proceedings Of The 8Th Workshop On Algorithm Engineering And Experiments And The 3Rd Workshop On Analytic Algorithms And Combinatorics, 2006, v. 2006, p. 238-246 How to Cite?
AbstractIn this paper we provide theoretical and experimental results on a random-surfer model for construction of a random graph. In this model, a new node connects to the existing graph by choosing a start node uniformly at random and then performing a short random walk. We show that in certain formulations, this results in the same distribution as the preferential-attachment random-graph model, and in others we give a direct analysis of power-law distribution of degrees or "virtual degrees" of the resulting graphs. We also present experimental results for a number of settings of parameters that we are not able to analyze mathematically.
Persistent Identifierhttp://hdl.handle.net/10722/92655
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorBlum, Aen_HK
dc.contributor.authorChan, THHen_HK
dc.contributor.authorRwebangira, MRen_HK
dc.date.accessioned2010-09-17T10:53:10Z-
dc.date.available2010-09-17T10:53:10Z-
dc.date.issued2006en_HK
dc.identifier.citationProceedings Of The 8Th Workshop On Algorithm Engineering And Experiments And The 3Rd Workshop On Analytic Algorithms And Combinatorics, 2006, v. 2006, p. 238-246en_HK
dc.identifier.urihttp://hdl.handle.net/10722/92655-
dc.description.abstractIn this paper we provide theoretical and experimental results on a random-surfer model for construction of a random graph. In this model, a new node connects to the existing graph by choosing a start node uniformly at random and then performing a short random walk. We show that in certain formulations, this results in the same distribution as the preferential-attachment random-graph model, and in others we give a direct analysis of power-law distribution of degrees or "virtual degrees" of the resulting graphs. We also present experimental results for a number of settings of parameters that we are not able to analyze mathematically.en_HK
dc.languageengen_HK
dc.relation.ispartofProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatoricsen_HK
dc.subjectMathematical Modelsen_HK
dc.subjectNumerical Methodsen_HK
dc.subjectParameter Estimationen_HK
dc.subjectRandom Processesen_HK
dc.titleA random-surfer web-graph modelen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailChan, THH:hubert@cs.hku.hken_HK
dc.identifier.authorityChan, THH=rp01312en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-33646838639en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33646838639&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume2006en_HK
dc.identifier.spage238en_HK
dc.identifier.epage246en_HK
dc.identifier.scopusauthoridBlum, A=7402674963en_HK
dc.identifier.scopusauthoridChan, THH=12645073600en_HK
dc.identifier.scopusauthoridRwebangira, MR=8266614300en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats