K. Avrachenkov, A. Mishenin, P. Gonçalves, and M. Sokol, Generalized Optimization Framework for Graph-based Semi-supervised Learning, Proceedings of the 2012 SIAM International Conference on Data Mining, pp.966-974, 2012.
DOI : 10.1137/1.9781611972825.83
URL : https://hal.archives-ouvertes.fr/inria-00633818

K. Avrachenkov, P. Gonçalves, and M. Sokol, On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods, Proccedings of WAW 2013, pp.56-67, 2013.
DOI : 10.1007/978-3-319-03536-9_5
URL : https://hal.archives-ouvertes.fr/hal-00924132

K. Avrachenkov, P. Chebotarev, and A. Mishenin, Semi-supervised learning with regularized Laplacian. Optimization Methods and Software, pp.222-236, 2017.
DOI : 10.1080/10556788.2016.1193176
URL : https://hal.archives-ouvertes.fr/hal-01184812

K. Avrachenkov, R. Van-der-hofstad, and M. Sokol, Personalized PageRank with Node-Dependent Restart, Proceedings of International Workshop on Algorithms and Models for the Web-Graph, pp.23-33, 2014.
DOI : 10.1007/978-3-319-13123-8_3
URL : https://hal.archives-ouvertes.fr/hal-01096328

L. Backstrom and J. Leskovec, Supervised random walks, Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pp.635-644, 2011.
DOI : 10.1145/1935826.1935914

D. Boley, G. Ranjan, and Z. L. Zhang, Commute times for a directed graph using an asymmetric Laplacian, Linear Algebra and its Applications, vol.435, issue.2, pp.224-242, 2011.
DOI : 10.1016/j.laa.2011.01.030
URL : https://doi.org/10.1016/j.laa.2011.01.030

P. Chebotarev, The graph bottleneck identity, Advances in Applied Mathematics, vol.47, issue.3, pp.403-413, 2011.
DOI : 10.1016/j.aam.2010.11.001
URL : https://doi.org/10.1016/j.aam.2010.11.001

P. Chebotarev, A Class of graph-geodetic distances generalizing the shortestpath and the resistance distances, Discrete Applied Mathematics, vol.47, issue.3, pp.403-413, 2011.

P. Chebotarev, The walk distances in graphs, Discrete Applied Mathematics, vol.160, issue.10-11, pp.1484-1500, 2012.
DOI : 10.1016/j.dam.2012.02.015
URL : https://doi.org/10.1016/j.dam.2012.02.015

P. Chebotarev, . Yu, and E. V. Shamis, On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix In Abstracts of the conference " Linear Algebra and its Application The Institute of Mathematics and its Applications, in conjunction with the Manchester Center for, Computational Mathematics, pp.10-12, 1995.

P. Chebotarev, . Yu, and E. V. Shamis, The matrix-forest theorem and measuring relations in small social groups, Autom. Remote Control, vol.58, issue.9, pp.1505-1514, 1997.

P. Chebotarev, . Yu, and E. V. Shamis, On a duality between metrics and ?-proximities, Autom. Remote Control, vol.59, issue.4, pp.608-612, 1998.

P. Chebotarev, . Yu, and E. V. Shamis, On proximity measures for graph vertices, Autom. Remote Control, vol.59, issue.10, pp.1443-1459, 1998.

F. Chung, Spectral graph theory, 1997.
DOI : 10.1090/cbms/092

F. Chung, The heat kernel as the pagerank of a graph, Proceedings of the National Academy of Sciences, pp.19735-19740, 2007.
DOI : 10.1002/rsa.3240040402

I. S. Dhillon, J. Fan, and Y. Guan, Efficient clustering of very large document collections. Data mining for scientific and engineering applications, pp.357-381, 2001.
DOI : 10.1007/978-1-4615-1733-7_20
URL : http://www.cs.utexas.edu/users/inderjit/public_papers/effclus.ps.gz

I. S. Dhillon, Y. Guan, and B. Kulis, Kernel k-means, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.551-556, 2004.
DOI : 10.1145/1014052.1014118

E. Estrada and N. Hatano, Statistical-mechanical approach to subgraph centrality in complex networks, Chemical Physics Letters, vol.439, issue.1-3, pp.247-251, 2007.
DOI : 10.1016/j.cplett.2007.03.098

E. Estrada and N. Hatano, Communicability in complex networks, Physical Review E, vol.78, issue.3, p.36111, 2008.
DOI : 10.1073/pnas.0406024101
URL : http://arxiv.org/pdf/0707.0756

E. Estrada and G. Silver, Accounting for the role of long walks on networks via a new matrix function, Journal of Mathematical Analysis and Applications, vol.449, issue.2, pp.1581-1600, 2017.
DOI : 10.1016/j.jmaa.2016.12.062

F. Fouss, L. Yen, A. Pirotte, and M. Saerens, An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task, Sixth International Conference on Data Mining (ICDM'06), pp.863-868, 2006.
DOI : 10.1109/ICDM.2006.18

F. Fouss, M. Saerens, and M. Shimbo, Algorithms and Models for Network Data and Link Analysis, 2016.
DOI : 10.1017/CBO9781316418321

V. Ivashkin and P. Chebotarev, Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?, Models, Algorithms , and Technologies for Network Analysis Proceedings in Mathematics & Statistics, 2017.
DOI : 10.1086/jar.33.4.3629752

K. Jacobsen and J. Tien, A generalized inverse for graphs with absorption. ArXiv preprint arXiv, pp.1611-02233, 2016.
DOI : 10.1016/j.laa.2017.09.029

L. Katz, A new status index derived from sociometric analysis, Psychometrika, vol.13, issue.1, pp.39-43, 1953.
DOI : 10.1007/BF02289026

S. J. Kirkland and M. Neumann, Group Inverses of M-matrices and Their Applications, 2012.

I. Kivimäki, M. Shimbo, and M. Saerens, Developments in the theory of randomized shortest paths with a comparison of graph node distances. Physica A: Statistical Mechanics and its Applications, p.600616, 2014.

R. I. Kondor and J. Lafferty, Diffusion kernels on graphs and other discrete input spaces, Proceedings of ICML, pp.315-322, 2002.

C. Lenart, A Generalized Distance in Graphs and Centered Partitions, SIAM Journal on Discrete Mathematics, vol.11, issue.2, pp.293-304, 1998.
DOI : 10.1137/S089548019426303X

D. Liben-nowell and J. Kleinberg, The link-prediction problem for social networks, Journal of the American Society for Information Science and Technology, vol.393, issue.7, pp.1019-1031, 2007.
DOI : 10.1017/CBO9780511814075

I. J. Schoenberg, Remarks to Maurice Frechet's Article ``Sur La Definition Axiomatique D'Une Classe D'Espace Distances Vectoriellement Applicable Sur L'Espace De Hilbert, The Annals of Mathematics, vol.36, issue.3, pp.724-732, 1935.
DOI : 10.2307/1968654

I. J. Schoenberg, Metric spaces and positive definite functions. Transactions of the, pp.522-536, 1938.
DOI : 10.1090/s0002-9947-1938-1501980-0
URL : http://www.convexoptimization.com/TOOLS/Schoenberg3.pdf

J. Kandola, J. Shawe-taylor, and N. Cristianini, Learning semantic similarity, Neural Information Processing Systems 15 (NIPS 15, 2002.

J. Shawe-taylor and N. Cristianini, Kernel Methods for Pattern Analysis, 2004.
DOI : 10.1017/CBO9780511809682

A. J. Smola and R. Kondor, Kernels and Regularization on Graphs, Learning Theory and Kernel Machines, pp.144-158, 2003.
DOI : 10.1007/978-3-540-45167-9_12
URL : http://mlg.anu.edu.au/~smola/./papers/SmoKon03.ps

F. Sommer, F. Fouss, and M. Saerens, Comparison of Graph Node Distances on Clustering Tasks, Lecture Notes in Computer Science LNCS, vol.33, issue.3, 2016.
DOI : 10.1086/jar.33.4.3629752

S. V. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt, Graph kernels, Journal of Machine Learning Research, vol.11, pp.1201-1242, 2010.

U. Von-luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1017/CBO9780511810633

D. Zhou, B. Schölkopf, and T. Hofmann, Semi-supervised learning on directed graphs, Proceeedings of NIPS, pp.1633-1640, 2004.

K. Müller, S. Mika, G. Rätsch, K. Tsuda, and B. Schölkopf, An introduction to kernel-based learning algorithms, IEEE Transactions on Neural Networks, vol.12, issue.2, pp.181-202, 2001.
DOI : 10.1109/72.914517