{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:54Z","timestamp":1761917814310},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T00:00:00Z","timestamp":1415836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10766-014-0344-3","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T20:58:15Z","timestamp":1415998695000},"page":"1028-1053","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["PageRank Computation Using a Multiple Implicitly Restarted Arnoldi Method for Modeling Epidemic Spread"],"prefix":"10.1007","volume":"43","author":[{"given":"Zifan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nahid","family":"Emad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soufian Ben","family":"Amor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Lamure","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"344_CR1","unstructured":"Liu, Z., Emad, N., Amor, S.B., Lamure, M.: Towards modeling of epidemic spread: eigenvalue computation. Preprint for publication. URL: http:\/\/hal.archives-ouvertes.fr\/hal-01069010"},{"key":"344_CR2","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The Pagerank citation ranking: bringing order to the Web. Technical Report 1999\u201366, Stanford InfoLab (1999)"},{"key":"344_CR3","doi-asserted-by":"crossref","unstructured":"Bryan, K., Leise, T.: The $${\\$}$$ $ 25,000,000,000 eigenvector: The linear Algebra behind Google. SIAM Rev. 48(3), 569\u2013581 (2006). doi: 10.1137\/050623280 . ISSN:0036-1445","DOI":"10.1137\/050623280"},{"key":"344_CR4","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: the Science of Search Engine Rankings. Princeton University Press, Princeton, NJ, USA. ISBN:0691122024 (2006)","DOI":"10.1515\/9781400830329"},{"key":"344_CR5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/15427951.2005.10129098","volume":"2","author":"P Berkhin","year":"2005","unstructured":"Berkhin, P.: A survey on pagerank computing. Internet Math. 2, 73\u2013120 (2005)","journal-title":"Internet Math."},{"issue":"4","key":"344_CR6","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/s10543-006-0091-y","volume":"46","author":"GH Golub","year":"2006","unstructured":"Golub, G.H., Greif, C.: An Arnoldi-type algorithm for computing PageRank. BIT Numer. Math. 46(4), 759\u2013771 (2006)","journal-title":"BIT Numer. Math."},{"key":"344_CR7","doi-asserted-by":"crossref","unstructured":"Wu, G., Wei, Y.: An Arnoldi-extrapolation algorithm for computing PageRank. J. Comput. App. Math. 234(11), 3196\u20133212 (2010) (Numerical linear algebra, internet and large scale applications). ISSN:0377-0427. doi: 10.1016\/j.cam.2010.02.009 . URL: http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377042710000804","DOI":"10.1016\/j.cam.2010.02.009"},{"key":"344_CR8","unstructured":"Gleich, D., Zhukov, L., Berkhin, P.: Fast parallel PageRank: a linear system approach. Technical Report L-2004-038, Yahoo! Research Labs (2004)"},{"key":"344_CR9","doi-asserted-by":"crossref","unstructured":"Wu, G., Wei, Y.: Arnoldi versus GMRES for computing PageRank: a theoretical contribution to Google\u2019s PageRank problem. ACM Trans. Inf. Syst. 28(3), 11:1\u201311:28 (2010). ISSN:1046\u20138188. doi: 10.1145\/1777432.1777434","DOI":"10.1145\/1777432.1777434"},{"key":"344_CR10","doi-asserted-by":"crossref","unstructured":"Wu, G., Wang, Y.-C., Jin, X.-Q.: A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors. SIAM J. Sci. Comput. 34(5) (2012)","DOI":"10.1137\/110834585"},{"key":"344_CR11","unstructured":"Haveliwala, T.H., Kamvar, S.D., Kamvar, A.D.: The second eigenvalue of the Google matrix. Technical Report 2003-20, Stanford InfoLab (2003)"},{"key":"344_CR12","first-page":"120","volume":"0","author":"Z Liu","year":"2013","unstructured":"Liu, Z., Emad, N., Amor, S.B., Lamure, M.: A parallel IRAM algorithm to compute PageRank for modeling epidemic spread. Symp. Comput. Architect. High Perform. Comput. 0, 120\u2013127 (2013). doi: 10.1109\/SBAC-PAD.2013.2","journal-title":"Symp. Comput. Architect. High Perform. Comput."},{"key":"344_CR13","unstructured":"Fazeli, S.A.S., Emad, N., Liu, Z.: A key to choose subspace size in implicitly restarted Arnoldi method. J. Numer. Algorithm (2014). http:\/\/hal.archives-ouvertes.fr\/hal-01070577"},{"key":"344_CR14","unstructured":"Heroux, M., Bartlett, R., Hoekstra, V.H.R., Hu, J., Kolda, T., Lehoucq, R., Long, K., Pawlowski, R., Phipps, E., Salinger, A., Thornquist, H., Tuminaro, R., Willenbring, J., Williams, A.: An overview of Trilinos. Technical Report SAND2003-2927, Sandia National Laboratories (2003)"},{"key":"344_CR15","doi-asserted-by":"crossref","unstructured":"Catalyurek, U., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst., 10(7), 673\u2013693 (1999). doi: 10.1109\/71.780863 . ISSN 1045-9219","DOI":"10.1109\/71.780863"},{"key":"344_CR16","doi-asserted-by":"crossref","unstructured":"Marathe, M., Vullikanti, A.K.S.: Computational epidemiology. Commun. ACM 56(7), 88\u201396 (2013). ISSN:0001-0782. doi: 10.1145\/2483852.2483871","DOI":"10.1145\/2483852.2483871"},{"key":"344_CR17","doi-asserted-by":"crossref","unstructured":"Bisset, K., Chen, J., Feng, X., Anil Kumar, V.S., Marathe, M.: EpiFast: A fast algorithm for large scale realistic epidemic simulations on distributed memory systems. In: Proceedings of 23rd ACM International Conference on Supercomputing (ICS\u201909), pp. 430\u2013439 (2009)","DOI":"10.1145\/1542275.1542336"},{"key":"344_CR18","unstructured":"Bisset, K.: Urgent computing for interaction based socio-technical simulations. Invited presentation to Argonne National Laboratory, April"},{"issue":"1","key":"344_CR19","first-page":"e1000656, 01","volume":"6","author":"DL Chao","year":"2010","unstructured":"Chao, D.L., Halloran, M.E., Obenchain, V.J., Longini, I.M., Flu Jr, T.E.: A publicly available stochastic influenza epidemic simulation model. PLoS Comput. Biol. 6(1), e1000656, 01 (2010). doi: 10.1371\/journal.pcbi.1000656","journal-title":"PLoS Comput. Biol."},{"key":"344_CR20","unstructured":"Wang, Y., Chakrabarti, D., Wang, C., Faloutsos, C.: Epidemic spreading in real networks: an eigenvalue viewpoint. In: SRDS, pp. 25\u201334 (2003)"},{"issue":"2","key":"344_CR21","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.physa.2007.08.054","volume":"386","author":"JC Miller","year":"2007","unstructured":"Miller, J.C., Hyman, J.M.: Effective vaccination strategies for realistic social networks. Phys. A 386(2), 780\u2013785 (2007)","journal-title":"Phys. A"},{"issue":"2","key":"344_CR22","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1080\/15427951.2009.10129184","volume":"6","author":"RK Fan","year":"2009","unstructured":"Fan, R.K.: Chung, Paul Horn, and Alexander Tsiatas. Distributing Antidote Using PageRank Vectors. Internet Math. 6(2), 237\u2013254 (2009)","journal-title":"Internet Math."},{"issue":"5439","key":"344_CR23","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"344_CR24","unstructured":"Lee, C.P., Golub, G.H., Zenios, S.A.: A fast two-stage algorithm for computing PageRank and its extensions. Technical report, Stanford University. URL: http:\/\/www-sccm.stanford.edu\/pub\/sccm\/sccm03-15_2.pdf (2004)"},{"key":"344_CR25","doi-asserted-by":"crossref","unstructured":"Ipsen, I.C.F., Selee, T.M.: PageRank computation, with special attention to dangling nodes. SIAM J. Matrix Anal. Appl., 29(4), 1281\u20131296 (2007). doi: 10.1137\/060664331 . ISSN:0895-4798","DOI":"10.1137\/060664331"},{"key":"344_CR26","doi-asserted-by":"crossref","unstructured":"Eiron, N., McCurley, K.S., Tomlin, J.A.: Ranking the web frontier. In: Proceedings of the 13th International Conference on World Wide Web, WWW \u201904, pp. 309\u2013318, New York, NY, USA. ACM (2004). ISBN:1-58113-844-X. doi: 10.1145\/988672.988714","DOI":"10.1145\/988672.988714"},{"key":"344_CR27","doi-asserted-by":"crossref","unstructured":"Sorensen, D.C.: Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matrix Anal. Appl. 13(1), 357\u2013385 (1992). ISSN:0895\u20134798. doi: 10.1137\/0613025","DOI":"10.1137\/0613025"},{"key":"344_CR28","doi-asserted-by":"crossref","unstructured":"Sorensen, D.C.: Implicitly restarted Arnoldi\/Lanczos methods for large scale eigenvalue calculations. Technical report (1996)","DOI":"10.1007\/978-94-011-5412-3_5"},{"key":"344_CR29","doi-asserted-by":"crossref","unstructured":"Sorensen, D.C.: Numerical methods for large eigenvalue problems. Acta Numer. 11, 519\u2013584 (2002). doi: 10.1017\/S0962492902000089","DOI":"10.1017\/S0962492902000089"},{"key":"344_CR30","doi-asserted-by":"crossref","unstructured":"Watkins, D.S.: The QR algorithm revisited. SIAM Rev. 50(1), 133\u2013145 (2008). ISSN:0036-1445. doi: 10.1137\/060659454","DOI":"10.1137\/060659454"},{"key":"344_CR31","unstructured":"Bennani, M., Braconnier, T.: Stopping Criteria for Eigensolvers. Technical Report TR\/PA\/94\/22, CERFACS, Toulouse, France (1994)"},{"key":"344_CR32","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/S1064827596304162","volume":"19","author":"A Stathopoulos","year":"1996","unstructured":"Stathopoulos, A., Saad, Y.: Dynamic thick restarting of the Davidson, and the implicitly restarted Arnoldi methods. SIAM J. Sci. Comput. 19, 227\u2013245 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"344_CR33","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: The chaco user\u2019s guide: Version 2.0. Technical Report SAND94-2692, Sandia National Lab (1994)","DOI":"10.2172\/10106339"},{"key":"344_CR34","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998). ISSN:1064\u20138275. doi: 10.1137\/S1064827595287997","DOI":"10.1137\/S1064827595287997"},{"key":"344_CR35","unstructured":"Pellegrini, F.: Scotch and libScotch 5.1 user\u2019s guide. URL http:\/\/hal.archives-ouvertes.fr\/hal-00410327 . 127 pages User\u2019s manual (2008)"},{"key":"344_CR36","unstructured":"Bradley, J.T., de Jager, D., Knottenbelt, W.J., Trifunovic, A.: Hypergraph partitioning for faster parallel PageRank computation. In: EPEW\u201905, Proceedings of the 2nd European Performance Evaluation Workshop, volume 3670 of Lecture Notes in Computer Science, pp. 155\u2013171, September 2005 (2005). URL http:\/\/pubs.doc.ic.ac.uk\/hypergraph-fast-pagerank\/"},{"issue":"2","key":"344_CR37","first-page":"129","volume":"20","author":"EG Boman","year":"2012","unstructured":"Boman, E.G., \u00c7ataly\u00fcrek, \u00dc.V., Chevalier, C., Devine, K.D.: The Zoltan and Isorropia parallel toolkits for combinatorial scientific computing: partitioning, ordering and coloring. Sci. Progr. 20(2), 129\u2013150 (2012)","journal-title":"Sci. Progr."},{"key":"344_CR38","unstructured":"Isorropia: Partitioning, Coloring, and Ordering. http:\/\/trilinos.org\/docs\/r11.8\/packages\/isorropia\/doc\/html\/index.html . Trilinos Release 11.8"},{"key":"344_CR39","doi-asserted-by":"crossref","unstructured":"Bolze, R., Cappello, F., Caron, E., Dayd\u00e9, M., Desprez, F., Jeannot, E., J\u00e9gou, Y., Lanteri, S., Leduc, J., Melab, N., Mornet, G., Namyst, R., Primet, P., Quetier, B., Richard, O., Talbi, E.-G., Touche, I.: Grid\u20195000: A large scale and highly reconfigurable experimental grid testbed. Int. J. High Perform. Comput. Appl. 20(4), 481\u2013494 (2006). ISSN:1094-3420. doi: 10.1177\/1094342006070078","DOI":"10.1177\/1094342006070078"},{"key":"344_CR40","unstructured":"BA Data Sets: http:\/\/topology.eecs.umich.edu\/data.html"},{"key":"344_CR41","unstructured":"SNAP Data Sets.: http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"344_CR42","doi-asserted-by":"crossref","unstructured":"Kwak, Haewoon., Lee, Changhyun., Park, Hosung., Moon, Sue.: What is Twitter, a social network or a news media? In: WWW \u201910: Proceedings of the 19th international conference on World wide web, pp. 591\u2013600, New York, NY, USA. ACM (2010). ISBN:978-1-60558-799-8. doi: 10.1145\/1772690.1772751","DOI":"10.1145\/1772690.1772751"},{"key":"344_CR43","doi-asserted-by":"crossref","first-page":"3200","DOI":"10.1103\/PhysRevLett.86.3200","volume":"86","author":"P-S Romualdo","year":"2001","unstructured":"Romualdo, P.-S., Alessandro, V.: Epidemic spreading in scale-free networks. Phys. Rev. Lett. 86, 3200\u20133203 (2001). doi: 10.1103\/PhysRevLett.86.3200","journal-title":"Phys. Rev. Lett."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-014-0344-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-014-0344-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-014-0344-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T11:33:12Z","timestamp":1566041592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-014-0344-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":43,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["344"],"URL":"https:\/\/doi.org\/10.1007\/s10766-014-0344-3","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]}}}