{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T18:39:19Z","timestamp":1784313559494,"version":"3.55.0"},"reference-count":55,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"vor","delay-in-days":15,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271518"],"award-info":[{"award-number":["12271518"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2023J01354"],"award-info":[{"award-number":["2023J01354"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>\n                    Higher\u2010order Markov chain plays an important role in high\u2010dimensional data analysis and modeling multi\u2010relational problems. As an application, higher\u2010order PageRank is a generalization to Google's PageRank. For this problem, the challenge is how to solve higher\u2010order PageRank both rapidly and accurately. Extrapolation methods are effectively accelerating techniques for large\u2010scale scientific computations. As far as we know, there are no extrapolation accelerated methods for higher\u2010order PageRank problem. One reason is that the stationary distribution of the higher\u2010order PageRank problem is a large\u2010scale and dense dataset, and existing extrapolation methods cannot apply to this problem directly. Sparse higher\u2010order PageRank generated by the sparse power method is a good alternative to higher\u2010order PageRank, in which the dense higher\u2010order PageRank is approximated by using a combination of a\n                    <jats:italic>sparse component<\/jats:italic>\n                    and a\n                    <jats:italic>rank\u2010one component<\/jats:italic>\n                    . In this work, we propose a sparse power method with extrapolation. The idea is to run the extrapolation method on the rank\u2010one component and get the weighting coefficients first, and then apply the coefficients to both the sparse component and the rank\u2010one component simultaneously. However, the difficulty is to show why this works theoretically. To settle this problem, we demonstrate the rationality of our strategy, and prove that the proposed method can converge faster than the original sparse power method. Extensive numerical experiments on both real\u2010world and synthetic database illustrate the efficiency of the proposed method, and show the effectiveness of our theoretical results.\n                  <\/jats:p>","DOI":"10.1002\/nla.70042","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T02:37:16Z","timestamp":1760668636000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Sparse Power Method With Extrapolation for the Higher\u2010Order Pagerank Problem"],"prefix":"10.1002","volume":"32","author":[{"given":"Sheng\u2010Wei","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Mathematics China University of Mining and Technology  Xuzhou Jiangsu People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Mathematics China University of Mining and Technology  Xuzhou Jiangsu People's Republic of China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2025,10,16]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1086\/225469"},{"key":"e_1_2_9_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.14"},{"key":"e_1_2_9_4_1","unstructured":"C.Klymko D.Gleich andT.Kolda \u201cUsing Triangles to Improve Community Detection in Directed Networks \u201d arXiv preprint arXiv:1404.58742014."},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02985759"},{"key":"e_1_2_9_6_1","volume-title":"The Pagerank Citation Ranking: Bringing Order to the Web","author":"Page L.","year":"1999"},{"key":"e_1_2_9_7_1","volume-title":"Markov Chains: models, algorithms and applications","author":"Ching W.\u2010K.","year":"2006"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2007.05.021"},{"key":"e_1_2_9_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2007.06.006"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/140985160"},{"key":"e_1_2_9_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-023-02146-0"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2013.777436"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2023.11.019"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2432"},{"key":"e_1_2_9_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2260"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2177"},{"key":"e_1_2_9_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.116192"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-024-01823-x"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-022-01786-z"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2280"},{"key":"e_1_2_9_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2499"},{"key":"e_1_2_9_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2379"},{"key":"e_1_2_9_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2107"},{"key":"e_1_2_9_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2020.05.022"},{"key":"e_1_2_9_25_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2022.2158292"},{"key":"e_1_2_9_26_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129131"},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479804441407"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-08-02086-3"},{"key":"e_1_2_9_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2005.01.015"},{"key":"e_1_2_9_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2017.10.008"},{"key":"e_1_2_9_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-024-02460-1"},{"key":"e_1_2_9_32_1","doi-asserted-by":"publisher","DOI":"10.1216\/JIE-2019-31-1-29"},{"key":"e_1_2_9_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-9274(96)00019-0"},{"key":"e_1_2_9_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-014-9879-z"},{"key":"e_1_2_9_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-020-01013-5"},{"key":"e_1_2_9_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(97)81112-3"},{"key":"e_1_2_9_37_1","unstructured":"P.Boef P.K\u00fcrschner X.Liu et al. \u201cGeneralizing Reduced Rank Extrapolation to Low\u2010Rank Matrix Sequence \u201d arXiv preprint arXiv:2502.09165 2025."},{"key":"e_1_2_9_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/0713060"},{"key":"e_1_2_9_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-734250-4.50028-X"},{"key":"e_1_2_9_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(77)90004-4"},{"key":"e_1_2_9_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/140976649"},{"key":"e_1_2_9_42_1","doi-asserted-by":"crossref","unstructured":"W. J.Stewart \u201cProbability Markov Chains Queues and Simulation: The Mathematical Basis of Performance Modeling \u201d Princeton University Press (2009).","DOI":"10.1515\/9781400832811"},{"key":"e_1_2_9_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1029042"},{"key":"e_1_2_9_44_1","doi-asserted-by":"publisher","DOI":"10.2307\/2002183"},{"key":"e_1_2_9_45_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1962-0145647-X"},{"key":"e_1_2_9_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575753"},{"key":"e_1_2_9_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/0723014"},{"key":"e_1_2_9_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2007.11.027"},{"key":"e_1_2_9_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2011.01.005"},{"key":"e_1_2_9_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_2_9_51_1","unstructured":"E.Voorhees \u201cTrec: Experiment and Evaluation in Information Retrieval \u201d2005."},{"key":"e_1_2_9_52_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsos.150526"},{"key":"e_1_2_9_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-64410-3"},{"key":"e_1_2_9_54_1","volume-title":"Matrix Perturbation Theory","author":"Stewart G. W.","year":"1990"},{"key":"e_1_2_9_55_1","first-page":"7736","article-title":"An Inverse\u2010Free Block\u2010SOR Method With Randomly Sampling for Temporal Multiplex PageRank Problems","volume":"35","author":"Wu G.","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_9_56_1","doi-asserted-by":"publisher","DOI":"10.11650\/tjm\/180303"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.70042","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/nla.70042","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.70042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:29:48Z","timestamp":1775791788000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.70042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10.1002\/nla.70042"],"URL":"https:\/\/doi.org\/10.1002\/nla.70042","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"2025-04-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70042"}}