{"id":"https://openalex.org/W2162775012","doi":"https://doi.org/10.1109/cca.2009.5280707","title":"A randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank problem","display_name":"A randomized algorithm for finding eigenvector of stochastic matrix with application to PageRank problem","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2162775012","doi":"https://doi.org/10.1109/cca.2009.5280707","mag":"2162775012"},"language":"en","primary_location":{"id":"doi:10.1109/cca.2009.5280707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cca.2009.5280707","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Control Applications, (CCA) &amp; Intelligent Control, (ISIC)","raw_type":"proceedings-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/A5048935741","display_name":"Alexander Nazin","orcid":"https://orcid.org/0000-0001-6155-7425"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alexander Nazin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5032697658","display_name":"B. T. Polyak","orcid":"https://orcid.org/0000-0002-1898-2984"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boris Polyak","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048935741"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9072,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82215755,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"412","last_page":"416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.996999979019165,"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.996999979019165,"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.9962000250816345,"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.9948999881744385,"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.7874563932418823},{"id":"https://openalex.org/keywords/power-iteration","display_name":"Power iteration","score":0.6871408224105835},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.639390230178833},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.5745931267738342},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5446873903274536},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5214080810546875},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.49963903427124023},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.49581846594810486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49078354239463806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4860442280769348},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4793420732021332},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4360868036746979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40317073464393616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38948962092399597},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2971143126487732},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21259406208992004},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1357443928718567},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.12070697546005249}],"concepts":[{"id":"https://openalex.org/C2779172887","wikidata":"https://www.wikidata.org/wiki/Q184316","display_name":"PageRank","level":2,"score":0.7874563932418823},{"id":"https://openalex.org/C162443888","wikidata":"https://www.wikidata.org/wiki/Q1426504","display_name":"Power iteration","level":3,"score":0.6871408224105835},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.639390230178833},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.5745931267738342},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5446873903274536},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5214080810546875},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.49963903427124023},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.49581846594810486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49078354239463806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4860442280769348},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4793420732021332},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4360868036746979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40317073464393616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38948962092399597},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2971143126487732},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21259406208992004},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1357443928718567},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.12070697546005249},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cca.2009.5280707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cca.2009.5280707","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Control Applications, (CCA) &amp; Intelligent Control, (ISIC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1505731132","https://openalex.org/W1608412409","https://openalex.org/W2066636486","https://openalex.org/W2107468885","https://openalex.org/W2166365115","https://openalex.org/W2169713291","https://openalex.org/W2271295020","https://openalex.org/W3212877690","https://openalex.org/W4249513058","https://openalex.org/W4294968333"],"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,95,109],"problem":[1],"of":[2,11,80,93],"finding":[3],"the":[4,8,86,91,114],"eigenvector":[5],"corresponding":[6],"to":[7],"largest":[9],"eigenvalue":[10],"a":[12,35,67],"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,58,71,88],"data":[27],"mining.":[28],"well":[30,60],"known":[31],"power":[32],"method":[33,116],"is":[34,85,90,101,111],"typical":[36],"tool":[37],"for":[38,55,62,77,105,117],"its":[39,78],"solution.":[40],"However":[41],"randomized":[42,69],"methods":[43],"could":[44],"be":[45],"competitors":[46],"vs":[47],"standard":[48],"ones;":[49],"they":[50],"require":[51],"much":[52],"less":[53],"calculations":[54],"one":[56],"iteration":[57],"are":[59],"tailored":[61],"distributed":[63],"computations.":[64],"We":[65],"propose":[66],"new":[68],"algorithm":[70,110],"provide":[72],"an":[73],"explicit":[74],"upper":[75],"bound":[76,96],"rate":[79],"convergence":[81],"O(radicInN/n)":[82],"where":[83],"N":[84],"dimension":[87],"n":[89],"number":[92],"iterations.":[94],"looks":[97],"promising":[98],"because":[99],"radicInN":[100],"not":[102],"large":[103],"even":[104],"very":[106],"high":[107],"dimensions.":[108],"based":[112],"on":[113],"mirror-descent":[115],"convex":[118],"optimization.":[120]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}
