{"id":"https://openalex.org/W2107577105","doi":"https://doi.org/10.1137/050643799","title":"Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient","display_name":"Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2107577105","doi":"https://doi.org/10.1137/050643799","mag":"2107577105"},"language":"en","primary_location":{"id":"doi:10.1137/050643799","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050643799","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Numerical Analysis","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053557735","display_name":"Konstantin Avrachenkov","orcid":"https://orcid.org/0000-0002-8124-8272"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"K. Avrachenkov","raw_affiliation_strings":["French Institute for Research in Computer Science and Automation"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"French Institute for Research in Computer Science and Automation","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087671143","display_name":"Nelly Litvak","orcid":"https://orcid.org/0000-0002-6750-3484"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. Litvak","raw_affiliation_strings":["Stochastic Operations Research"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stochastic Operations Research","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002349590","display_name":"Danil Nemirovsky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. Nemirovsky","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071119940","display_name":"Natali\u00e2 Osipova","orcid":"https://orcid.org/0000-0001-8192-2813"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"N. Osipova","raw_affiliation_strings":["INRIA Sophia Antipolis, MAESTRO team, 2004 Route des Lucioles, B. P. 93, 06902 Sophia Antipolis, France","Department of Information Technology, St. Petersburg State University, 35 Universitetskii Prospekt, Peterhof, 198504 St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Sophia Antipolis, MAESTRO team, 2004 Route des Lucioles, B. P. 93, 06902 Sophia Antipolis, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Department of Information Technology, St. Petersburg State University, 35 Universitetskii Prospekt, Peterhof, 198504 St. Petersburg, Russia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.4109,"has_fulltext":true,"cited_by_count":255,"citation_normalized_percentile":{"value":0.98670802,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"45","issue":"2","first_page":"890","last_page":"904"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9757000207901001,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9729999899864197,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.939192533493042},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.7905895113945007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6901833415031433},{"id":"https://openalex.org/keywords/power-iteration","display_name":"Power iteration","score":0.5644919276237488},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5424755811691284},{"id":"https://openalex.org/keywords/monte-carlo-integration","display_name":"Monte Carlo integration","score":0.46610885858535767},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.45111775398254395},{"id":"https://openalex.org/keywords/quasi-monte-carlo-method","display_name":"Quasi-Monte Carlo method","score":0.41874009370803833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4136584997177124},{"id":"https://openalex.org/keywords/hybrid-monte-carlo","display_name":"Hybrid Monte Carlo","score":0.39783766865730286},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.3665829002857208},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35001230239868164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2611461281776428},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.21168389916419983},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17369022965431213},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12854766845703125}],"concepts":[{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.939192533493042},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.7905895113945007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6901833415031433},{"id":"https://openalex.org/C162443888","wikidata":"https://www.wikidata.org/wiki/Q1426504","display_name":"Power iteration","level":3,"score":0.5644919276237488},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5424755811691284},{"id":"https://openalex.org/C132725507","wikidata":"https://www.wikidata.org/wiki/Q39879","display_name":"Monte Carlo integration","level":5,"score":0.46610885858535767},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.45111775398254395},{"id":"https://openalex.org/C63320529","wikidata":"https://www.wikidata.org/wiki/Q7269435","display_name":"Quasi-Monte Carlo method","level":5,"score":0.41874009370803833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4136584997177124},{"id":"https://openalex.org/C13153151","wikidata":"https://www.wikidata.org/wiki/Q1639846","display_name":"Hybrid Monte Carlo","level":4,"score":0.39783766865730286},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.3665829002857208},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35001230239868164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2611461281776428},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.21168389916419983},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17369022965431213},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12854766845703125}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/050643799","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050643799","pdf_url":null,"source":{"id":"https://openalex.org/S203348814","display_name":"SIAM Journal on Numerical Analysis","issn_l":"0036-1429","issn":["0036-1429","1095-7170"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Numerical Analysis","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/5c5ae6cc-00c1-4f14-9107-05dcb8f7dd27","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/5c5ae6cc-00c1-4f14-9107-05dcb8f7dd27","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Avrachenkov, K, Litvak, N, Nemirovsky, D & Osipova, N 2007, 'Monte Carlo methods in PageRank computation: When one iteration is sufficient', SIAM journal on numerical analysis, vol. 45, no. LNCS4549/2, 10.1137/050643799, pp. 890-904. https://doi.org/10.1137/050643799","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ris.utwente.nl:publications/92a2b83a-5bb0-4974-b99e-653828091954","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/92a2b83a-5bb0-4974-b99e-653828091954","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W90334771","https://openalex.org/W1550457191","https://openalex.org/W1854214752","https://openalex.org/W2011918288","https://openalex.org/W2014478203","https://openalex.org/W2046379078","https://openalex.org/W2069153192","https://openalex.org/W2089800021","https://openalex.org/W2096487091","https://openalex.org/W2108272874","https://openalex.org/W2129620481","https://openalex.org/W2158601853","https://openalex.org/W2161118554","https://openalex.org/W2175110005","https://openalex.org/W2293888960"],"related_works":["https://openalex.org/W4294677683","https://openalex.org/W1548972748","https://openalex.org/W590971457","https://openalex.org/W4327802989","https://openalex.org/W4367155567","https://openalex.org/W3565757","https://openalex.org/W2081255987","https://openalex.org/W2151084831","https://openalex.org/W2153934880","https://openalex.org/W86393192"],"abstract_inverted_index":{"PageRank":[0,14,43,70,97,125],"is":[1],"one":[2,52,103,118],"of":[3,21,36,54,76,95,123,129],"the":[4,34,42,45,58,69,77,83,96,124,127,130],"principle":[5],"criteria":[6],"according":[7],"to":[8,119],"which":[9,49],"Google":[10,40],"ranks":[11],"Web":[12,24,38,131],"pages.":[13],"can":[15],"be":[16],"interpreted":[17],"as":[18,126],"a":[19,23,27,37],"frequency":[20],"visiting":[22],"page":[25],"by":[26],"random":[28],"surfer,":[29],"and":[30,63,112],"thus":[31],"it":[32],"reflects":[33],"popularity":[35],"page.":[39],"computes":[41],"using":[44],"power":[46,85],"iteration":[47,86],"method,":[48],"requires":[50],"about":[51],"week":[53],"intensive":[55],"computations.":[56],"In":[57],"present":[59],"work":[60],"we":[61],"propose":[62],"analyze":[64],"Monte":[65,79,88,105,114],"Carlo\u2010type":[66],"methods":[67,81,90,107,116],"for":[68,98],"computation.":[71],"There":[72],"are":[73],"several":[74],"advantages":[75],"probabilistic":[78],"Carlo":[80,89,106,115],"over":[82],"deterministic":[84],"method:":[87],"already":[91],"provide":[92],"good":[93],"estimation":[94],"relatively":[99],"important":[100],"pages":[101],"after":[102],"iteration;":[104],"have":[108],"natural":[109],"parallel":[110],"implementation;":[111],"finally,":[113],"allow":[117],"perform":[120],"continuous":[121],"update":[122],"structure":[128],"changes.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":17},{"year":2015,"cited_by_count":20},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":13}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}