{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:50:27Z","timestamp":1725745827155},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400193"},{"type":"electronic","value":"9783642400209"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40020-9_21","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T01:32:37Z","timestamp":1376875957000},"page":"207-214","source":"Crossref","is-referenced-by-count":8,"title":["Studying New Classes of Graph Metrics"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Chebotarev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Distance in Graphs","author":"F. Buckley","year":"1990","unstructured":"Buckley, F., Harary, F.: Distance in Graphs. Addison-Wesley, Reading (1990)"},{"key":"21_CR2","unstructured":"Sharpe, G.E.: Solution of the (m\u2009+\u20091)-terminal resistive network problem by means of metric geometry. In: Proceedings of the First Asilomar Conference on Circuits and Systems, Pacific Grove, CA, pp. 319\u2013328 (November 1967)"},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1070\/RM1987v042n06ABEH001494","volume":"42","author":"A.D. Gvishiani","year":"1987","unstructured":"Gvishiani, A.D., Gurvich, V.A.: Metric and ultrametric spaces of resistances. Russian Mathematical Surveys\u00a042(6), 235\u2013236 (1987)","journal-title":"Russian Mathematical Surveys"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Gurvich, V.: Metric and ultrametric spaces of resistances. Discrete Applied Mathematics (2010)","DOI":"10.1016\/j.dam.2010.05.007"},{"key":"21_CR5","unstructured":"Gurvich, V.: Triangle inequality for resistances. Rutcor Research Report RRR 20-2012, RUTCOR, Rutgers University, NJ (2012)"},{"key":"21_CR6","first-page":"574","volume-title":"Proc. 21st Annual ACM Symp. on Theory of Computing","author":"A.K. Chandra","year":"1989","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: Proc. 21st Annual ACM Symp. on Theory of Computing, pp. 574\u2013586. ACM Press, Seattle (1989)"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"D.J. Klein","year":"1993","unstructured":"Klein, D.J., Randi\u0107, M.: Resistance distance. Journal of Mathematical Chemistry\u00a012, 81\u201395 (1993)","journal-title":"Journal of Mathematical Chemistry"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.aam.2010.11.001","volume":"47","author":"P. Chebotarev","year":"2011","unstructured":"Chebotarev, P.: The graph bottleneck identity. Advances in Applied Mathematics\u00a047(3), 403\u2013413 (2011)","journal-title":"Advances in Applied Mathematics"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.dam.2010.11.017","volume":"159","author":"P. Chebotarev","year":"2011","unstructured":"Chebotarev, P.: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discrete Applied Mathematics\u00a0159(5), 295\u2013302 (2011)","journal-title":"Discrete Applied Mathematics"},{"issue":"10-11","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1016\/j.dam.2012.02.015","volume":"160","author":"P. Chebotarev","year":"2012","unstructured":"Chebotarev, P.: The walk distances in graphs. Discrete Applied Mathematics\u00a0160(10-11), 1484\u20131500 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-1-4614-5128-0_7","volume-title":"Distance Geometry: Theory, Methods, and Applications","author":"P. Chebotarev","year":"2013","unstructured":"Chebotarev, P., Deza, M.: A topological interpretation of the walk distances. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications, pp. 121\u2013135. Springer, New York (2013)"},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/j.laa.2012.07.033","volume":"439","author":"P. Chebotarev","year":"2013","unstructured":"Chebotarev, P., Bapat, R.B., Balaji, R.: Simple expressions for the long walk distance. Linear Algebra and its Applications\u00a0439(4), 893\u2013898 (2013)","journal-title":"Linear Algebra and its Applications"},{"key":"21_CR13","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"21_CR14","first-page":"87","volume":"68","author":"R.B. Bapat","year":"1999","unstructured":"Bapat, R.B.: Resistance distance in graphs. The Mathematics Student\u00a068, 87\u201398 (1999)","journal-title":"The Mathematics Student"},{"key":"21_CR15","first-page":"184","volume-title":"Proceedings of the Eleventh Midwest Symposium on Circuit Theory","author":"D.J.H. Moore","year":"1968","unstructured":"Moore, D.J.H., Subak-Sharpe, G.E.: Metric transformation of an (m\u2009+\u20091)-terminal resistive network into a hyperacute angled simplex P m in Euclidean space\u00a0E m . In: Proceedings of the Eleventh Midwest Symposium on Circuit Theory, May 13-14, pp. 184\u2013192. Univ. of Notre Dame, Notre Dame (1968)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Yen, L., Saerens, M., Mantrach, A., Shimbo, M.: A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In: The 14th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Las Vegas, NV, August 24\u201327, pp. 785\u2013793 (2008)","DOI":"10.1145\/1401890.1401984"},{"key":"21_CR17","unstructured":"von Luxburg, U., Radl, A., Hein, M.: Getting lost in space: Large sample analysis of the resistance distance. In: NIPS 2010, Twenty-Fourth Annual Conference on Neural Information Processing Systems, Curran, Red Hook, NY, pp. 1\u20139 (2011)"},{"issue":"9","key":"21_CR18","first-page":"1505","volume":"58","author":"P.Y. Chebotarev","year":"1997","unstructured":"Chebotarev, P.Y., Shamis, E.V.: The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control\u00a058(9), 1505\u20131514 (1997)","journal-title":"Automation and Remote Control"},{"issue":"10","key":"21_CR19","first-page":"1443","volume":"59","author":"P.Y. Chebotarev","year":"1998","unstructured":"Chebotarev, P.Y., Shamis, E.V.: On proximity measures for graph vertices. Automation and Remote Control\u00a059(10), 1443\u20131459 (1998)","journal-title":"Automation and Remote Control"},{"key":"21_CR20","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M.M. Deza","year":"1997","unstructured":"Deza, M.M., Laurent, M.: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol.\u00a015. Springer, Berlin (1997)"},{"key":"21_CR21","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","volume-title":"Network Reliability and Algebraic Structures","author":"D.R. Shier","year":"1991","unstructured":"Shier, D.R.: Network Reliability and Algebraic Structures. Oxford University Press, New York (1991)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Chung, F., Zhao, W.: PageRank and random walks on graphs. In: Katona, G.O.H., Schrijver, A., Szonyi, T. (eds.) Fete of Combinatorics and Computer Science, pp. 43\u201362. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13580-4_3"},{"issue":"5","key":"21_CR23","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.dam.2007.08.030","volume":"156","author":"P. Chebotarev","year":"2008","unstructured":"Chebotarev, P.: Spanning forests and the golden ratio. Discrete Applied Mathematics\u00a0156(5), 813\u2013821 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L. Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika\u00a018(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"issue":"8","key":"21_CR25","first-page":"1364","volume":"61","author":"P.Y. Chebotarev","year":"2000","unstructured":"Chebotarev, P.Y., Shamis, E.V.: The forest metrics of a graph and their properties. Automation and Remote Control\u00a061(8), 1364\u20131373 (2000)","journal-title":"Automation and Remote Control"},{"issue":"11","key":"21_CR26","doi-asserted-by":"publisher","first-page":"4317","DOI":"10.1016\/j.laa.2012.01.017","volume":"436","author":"E. Estrada","year":"2012","unstructured":"Estrada, E.: The communicability distance in graphs. Linear Algebra and its Applications\u00a0436(11), 4317\u20134328 (2012)","journal-title":"Linear Algebra and its Applications"},{"key":"21_CR27","unstructured":"Alamgir, M., von Luxburg, U.: Phase transition in the family of p-resistances. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K. (eds.) Advances in Neural Information Processing Systems 24, pp. 1540\u20131548 (2011)"},{"key":"21_CR28","unstructured":"Kivim\u00e4ki, I., Shimbo, M., Saerens, M.: Developments in the theory of randomized shortest paths with a comparison of graph node distances. arXiv preprint stat.ML\/arXiv:1212.1666v1 (2012)"},{"key":"21_CR29","unstructured":"Senelle, M., Garcia-Diez, S., Mantrach, A., Shimbo, M., Saerens, M., Fouss, F.: The sum-over-forests density index: Identifying dense regions in a graph. arXiv preprint cs.LG\/arXiv:1301.0725v1 (submitted for publication, 2013)"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40020-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T20:10:56Z","timestamp":1715890256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40020-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400193","9783642400209"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40020-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}