{"id":"https://openalex.org/W2118921825","doi":"https://doi.org/10.1109/cdc.2009.5400036","title":"Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank","display_name":"Adaptive randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2118921825","doi":"https://doi.org/10.1109/cdc.2009.5400036","mag":"2118921825"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2009.5400036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2009.5400036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5048935741","display_name":"Alexander Nazin","orcid":"https://orcid.org/0000-0001-6155-7425"},"institutions":[{"id":"https://openalex.org/I4210157430","display_name":"V. A. Trapeznikov Institute of Control Sciences","ror":"https://ror.org/05f3yt521","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210157430","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Nazin","raw_affiliation_strings":["Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences, Russian Academy of Science, Moscow, Russia","Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences RAS, 65 Profsoyuznaya str., 117997 Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences, Russian Academy of Science, Moscow, Russia","institution_ids":["https://openalex.org/I4210157430"]},{"raw_affiliation_string":"Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences RAS, 65 Profsoyuznaya str., 117997 Moscow, Russia","institution_ids":["https://openalex.org/I4210157430"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032697658","display_name":"B. T. Polyak","orcid":"https://orcid.org/0000-0002-1898-2984"},"institutions":[{"id":"https://openalex.org/I4210157430","display_name":"V. A. Trapeznikov Institute of Control Sciences","ror":"https://ror.org/05f3yt521","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210157430","https://openalex.org/I4210164537"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Boris Polyak","raw_affiliation_strings":["Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences, Russian Academy of Science, Moscow, Russia","Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences RAS, 65 Profsoyuznaya str., 117997 Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences, Russian Academy of Science, Moscow, Russia","institution_ids":["https://openalex.org/I4210157430"]},{"raw_affiliation_string":"Laboratory for Adaptive and Robust Control Systems, Institute of Control Sciences RAS, 65 Profsoyuznaya str., 117997 Moscow, Russia","institution_ids":["https://openalex.org/I4210157430"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210157430"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pagerank","display_name":"PageRank","score":0.7046279907226562},{"id":"https://openalex.org/keywords/power-iteration","display_name":"Power iteration","score":0.6483411192893982},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5692622661590576},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5628340840339661},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.5351131558418274},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5294990539550781},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5168840885162354},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.49190711975097656},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.48154503107070923},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4779103696346283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44759705662727356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3932243585586548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36690646409988403},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2295522391796112},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21187305450439453},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1429728865623474},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.0966787338256836}],"concepts":[{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.7046279907226562},{"id":"https://openalex.org/C162443888","wikidata":"https://www.wikidata.org/wiki/Q1426504","display_name":"Power iteration","level":3,"score":0.6483411192893982},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5692622661590576},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5628340840339661},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.5351131558418274},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5294990539550781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5168840885162354},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.49190711975097656},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.48154503107070923},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4779103696346283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44759705662727356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3932243585586548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36690646409988403},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2295522391796112},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21187305450439453},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1429728865623474},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0966787338256836},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2009.5400036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2009.5400036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W351120675","https://openalex.org/W1505731132","https://openalex.org/W1608412409","https://openalex.org/W2061036439","https://openalex.org/W2066636486","https://openalex.org/W2107468885","https://openalex.org/W2162775012","https://openalex.org/W2166365115","https://openalex.org/W2169713291","https://openalex.org/W2271295020","https://openalex.org/W2917201179","https://openalex.org/W3005287603","https://openalex.org/W3212877690","https://openalex.org/W4249513058","https://openalex.org/W4294968333","https://openalex.org/W4301435544","https://openalex.org/W6684502036"],"related_works":["https://openalex.org/W2054215488","https://openalex.org/W2550303287","https://openalex.org/W2075171612","https://openalex.org/W2373471710","https://openalex.org/W2391020693","https://openalex.org/W2811510744","https://openalex.org/W2769537721","https://openalex.org/W3124338227","https://openalex.org/W4247585808","https://openalex.org/W2161118554"],"abstract_inverted_index":{"The":[0,29,94,108],"problem":[1],"of":[2,11,79,92],"finding":[3],"the":[4,8,85,90,114],"eigenvector":[5],"corresponding":[6],"to":[7],"largest":[9],"eigenvalue":[10],"a":[12,34,65],"stochastic":[13,119],"matrix":[14],"has":[15],"numerous":[16],"applications":[17],"in":[18],"ranking":[19],"search":[20],"results,":[21],"multi-agent":[22],"consensus,":[23],"networked":[24],"control":[25],"and":[26,57,70,87],"data":[27],"mining.":[28],"well-known":[30],"power":[31],"method":[32,116],"is":[33,84,89,100,111],"typical":[35],"tool":[36],"for":[37,54,60,76,104,117],"its":[38,77],"solution.":[39],"However":[40],"randomized":[41,68],"methods":[42],"could":[43],"be":[44],"competitors":[45],"vs":[46],"standard":[47],"ones;":[48],"they":[49],"require":[50],"much":[51],"less":[52],"calculations":[53],"one":[55],"iteration":[56],"are":[58],"well-tailored":[59],"distributed":[61],"computations.":[62],"We":[63],"propose":[64],"novel":[66],"adaptive":[67],"algorithm":[69,110],"provide":[71],"an":[72],"explicit":[73],"upper":[74],"bound":[75,95],"rate":[78],"convergence":[80],"O(\u00bf(lnN/n)),":[81],"where":[82],"N":[83],"dimension":[86],"n":[88],"number":[91],"iterations.":[93],"looks":[96],"promising":[97],"because":[98],"\u00bf(lnN)":[99],"not":[101],"large":[102],"even":[103],"very":[105],"high":[106],"dimensions.":[107],"proposed":[109],"based":[112],"on":[113],"mirror-descent":[115],"convex":[118],"optimization.":[120]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}