{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:53:00Z","timestamp":1773481980741,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319126906","type":"print"},{"value":"9783319126913","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_54","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"729-749","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Incremental Computation of Pseudo-Inverse of Laplacian"],"prefix":"10.1007","author":[{"given":"Gyan","family":"Ranjan","sequence":"first","affiliation":[]},{"given":"Zhi-Li","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Boley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"54_CR1","unstructured":"http:\/\/snap.stanford.edu\/data\/"},{"issue":"9","key":"54_CR2","first-page":"1424","volume":"61","author":"R Agaev","year":"2000","unstructured":"Agaev, R., Chebotarev, P.: The matrix of maximum out forests of a digraph and its applications. Autom. Remote Control 61(9), 1424\u20131450 (2000)","journal-title":"Autom. Remote Control"},{"issue":"5439","key":"54_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"54_CR4","volume-title":"Generalized Inverses: Theory and Applications","author":"A Ben-Israel","year":"2003","unstructured":"Ben-Israel, A., Greville, T.: Generalized Inverses: Theory and Applications, 2nd edn. Springer, New York (2003)","edition":"2"},{"key":"54_CR5","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)"},{"issue":"2","key":"54_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.laa.2011.01.030","volume":"435","author":"D Boley","year":"2011","unstructured":"Boley, D., Ranjan, G., Zhang, Z.-L.: Commute times for a directed graph using an asymmetric laplacian. Linear Algebra Appl. 435(2), 224\u2013242 (2011)","journal-title":"Linear Algebra Appl."},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Brand, M.: A random walks perspective on maximizing satisfaction and profit. In: Proceedings of 2005 SIAM International Conference Data Mining (2005)","DOI":"10.1137\/1.9781611972757.2"},{"key":"54_CR8","unstructured":"Campbell, Y.E., Davis, T.A.: Computing the sparse inverse subset: An inverse multifrontal approach. Technical report TR-95-021, Univ. of Florida, Gainesville (1995)"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. In: Proceedings of Annual ACM Symposium on Theory of Computing, pp. 574\u2013586 (1989)","DOI":"10.1145\/73007.73062"},{"issue":"9","key":"54_CR10","first-page":"1505","volume":"58","author":"P Chebotarev","year":"1997","unstructured":"Chebotarev, P., Shamis, E.: The matrix-forest theorem and measuring relations in small social groups. Autom. Remote Control 58(9), 1505\u20131514 (1997)","journal-title":"Autom. Remote Control"},{"issue":"10","key":"54_CR11","first-page":"1443","volume":"59","author":"P Chebotarev","year":"1998","unstructured":"Chebotarev, P., Shamis, E.: On proximity measures for graph vertices. Autom. Remote Control 59(10), 1443\u20131459 (1998)","journal-title":"Autom. Remote Control"},{"key":"54_CR12","doi-asserted-by":"crossref","DOI":"10.5948\/UPO9781614440222","volume-title":"Random Walks and Electric Networks","author":"PG Doyle","year":"1984","unstructured":"Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. The Mathematical Association of America, Washington, DC (1984)"},{"key":"54_CR13","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J. 23, 298\u2013305 (1973)","journal-title":"Czech. Math. J."},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss, F., Pirotte, A., Renders, J.M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19, 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"54_CR15","volume-title":"Markov Chains Theory and Applications","author":"D Isaacson","year":"1976","unstructured":"Isaacson, D., Madsen, R.: Markov Chains Theory and Applications. Wiley, New York (1976)"},{"key":"54_CR16","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/S0895479896298713","volume":"18","author":"SJ Kirkland","year":"1997","unstructured":"Kirkland, S.J., Neumann, M., Shader, B.L.: Distances in weighted trees and group inverse of laplacian matrices. SIAM J. Matrix Anal. Appl. 18, 827\u2013841 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"54_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein, D.J., Randi\u0107, M.: Resistance distance. J. Math. Chem. 12, 81\u201395 (1993)","journal-title":"J. Math. Chem."},{"issue":"4","key":"54_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"UV Luxburg","year":"2007","unstructured":"Luxburg, U.V.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007). Max Planck Institute for Biological Cybernetics. Technical report No. TR-149","journal-title":"Stat. Comput."},{"key":"54_CR19","unstructured":"Luxburg, U.V., Radl, A., Hein, M.: Getting lost in space: Large sample analysis of the commute distance. In: NIPS (2010)"},{"issue":"3","key":"54_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1137\/0124033","volume":"24","author":"CD Meyer","year":"1973","unstructured":"Meyer, C.D.: Generalized inversion of modified matrices. SIAM J. Appl. Math. 24(3), 315\u2013323 (1973)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"54_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"MEJ Newman","year":"2005","unstructured":"Newman, M.E.J.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39\u201354 (2005)","journal-title":"Soc. Netw."},{"key":"54_CR22","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1002\/qua.22323","volume":"110","author":"JL Palacios","year":"2001","unstructured":"Palacios, J.L., Renom, J.M.: Bounds for the kirchhoff index of regular graphs via the spectra of their random walks. Int. J. Quant. Chem. 110, 1637\u20131641 (2001)","journal-title":"Int. J. Quant. Chem."},{"key":"54_CR23","doi-asserted-by":"crossref","unstructured":"Ranjan, G., Zhang, Z.-L.: How to glue a robust smart-grid: a finite network theory of inter-dependent networks (extended abstract). In: Proceedings of the 7th (2011) Cyber Security and Information Intelligence Research Workshop: THEME - Energy Infrastructure Cyber Protection (CSIIRW7) (2011)","DOI":"10.1145\/2179298.2179322"},{"issue":"17","key":"54_CR24","doi-asserted-by":"publisher","first-page":"3833","DOI":"10.1016\/j.physa.2013.04.013","volume":"392","author":"G Ranjan","year":"2013","unstructured":"Ranjan, G., Zhang, Z.-L.: Geometry of complex networks and topological centrality. Physica A: Stat. Mech. Appl. 392(17), 3833\u20133845 (2013)","journal-title":"Physica A: Stat. Mech. Appl."},{"key":"54_CR25","unstructured":"Ranjan, G., Zhang, Z.-L., Boley, D.: Incremental computation of pseudo-inverse of laplacian (2013). http:\/\/arxiv.org\/abs\/1304.2300"},{"key":"54_CR26","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In: Proceedings of the Fifth International Conference Computer and Information Technology (2002)"},{"issue":"6","key":"54_CR27","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1002\/etep.255","volume":"19","author":"A Sen","year":"2008","unstructured":"Sen, A., Ghosh, P., Yang, B., Vittal, V.: A new min-cut problem with application to electric power network partitioning. Eur. Trans. Electr. Power 19(6), 778\u2013797 (2008)","journal-title":"Eur. Trans. Electr. Power"},{"key":"54_CR28","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1140\/epjb\/e2002-00368-5","volume":"30","author":"B Tadi\u0107","year":"2002","unstructured":"Tadi\u0107, B., Priezzhev, V.: Voltage distribution in growing conduction networks. Eur. Phys. J. B 30, 143\u2013146 (2002)","journal-title":"Eur. Phys. J. B"},{"key":"54_CR29","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01046996","volume":"4","author":"P Tetali","year":"1991","unstructured":"Tetali, P.: Random walks and effective resistance of networks. J. Theor. Probab. 4, 101\u2013109 (1991)","journal-title":"J. Theor. Probab."},{"key":"54_CR30","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"54_CR31","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00214-003-0460-4","volume":"110","author":"W Xiao","year":"2003","unstructured":"Xiao, W., Gutman, I.: Resistance distance and laplacian spectrum. Theoret. Chem. Acc. 110, 284\u2013289 (2003)","journal-title":"Theoret. Chem. Acc."},{"key":"54_CR32","unstructured":"Zhang, Z.-L., Ranjan, G.: On connected bi-partitions of a graph (manuscript under preparation 2014)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T03:38:33Z","timestamp":1676000313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}