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.
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.
URL : https://hal.archives-ouvertes.fr/hal-00924132

K. Avrachenkov, P. Chebotarev, and A. Mishenin, Semisupervised learning with regularized Laplacian, Optimization Methods and Software, vol.32, issue.2, pp.222-236, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01648135

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.
URL : https://hal.archives-ouvertes.fr/hal-01052482

L. Backstrom and J. Leskovec, Supervised random walks: predicting and recommending links in social networks, Proceedings of ACM WSDM 2011, pp.635-644, 2011.

F. Buckley and F. Harary, Distance in Graphs, 1990.

O. Chapelle, B. Schölkopf, and A. Zien, Semi-Supervised Learning, 2006.

P. Chebotarev, The graph bottleneck identity, Advances in Applied Mathematics, vol.47, pp.403-413, 2011.

P. Chebotarev, A Class of graph-geodetic distances generalizing the shortest-path and the resistance distances, Discrete Applied Mathematics, vol.159, issue.5, pp.295-302, 2011.

P. Chebotarev, The walk distances in graphs, Discrete Applied Mathematics, vol.160, pp.1484-1500, 2012.

P. Chebotarev, Studying new classes of graph metrics, Proceedings of the SEE Conference, vol.8085, pp.207-214, 2013.

P. Chebotarev, . Yu, and E. V. Shamis, On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix, The Institute of Mathematics and its Applications, in conjunction with the Manchester Center for Computational Mathematics, pp.6-7, 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, p.1501, 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.

F. Chung, The heat kernel as the pagerank of a graph, Proceedings of the National Academy of Sciences, vol.104, issue.50, pp.19735-19740, 2007.

M. Deza and P. Chebotarev, , 2011.

M. M. Deza and E. Deza, Encyclopedia of Distances, 2016.

I. S. Dhillon, J. Fan, and Y. Guan, Efficient clustering of very large document collections. Data mining for scientific and engineering applications, vol.2, pp.357-381, 2001.

I. S. Dhillon, Y. Guan, and B. Kulis, Kernel k-means: spectral clustering and normalized cuts, Proceedings of ACM KDD, pp.551-556, 2004.

E. Estrada and N. Hatano, Statistical-mechanical approach to subgraph centrality in complex networks, Chem. Phys. Lett, vol.439, pp.247-251, 2007.

E. Estrada and N. Hatano, Communicability in complex networks, Physical Review E, vol.77, issue.3, p.36111, 2008.

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, pp.1581-1600, 2017.

F. Fouss, L. Yen, A. Pirotte, and M. Saerens, An experimental investigation of graph kernels on a collaborative recommendation task, Proceedings of the Sixth International Conference on Data Mining (ICDM'06), pp.863-868, 2006.

F. Fouss, M. Saerens, and M. Shimbo, Algorithms and Models for Network Data and Link Analysis, 2016.

R. A. Horn and C. R. Johnson, Matrix Analysis, 2013.

V. Ivashkin and P. Chebotarev, Do logarithmic proximity measures outperform plain ones in graph clustering? In: Models, Algorithms, and Technologies for Network Analysis, Proceedings in Mathematics & Statistics, vol.197, pp.87-105, 2017.

K. A. Jacobsen and J. H. Tien, A generalized inverse for graphs with absorption, Linear Algebra and its Applications, vol.537, pp.118-147, 2018.

J. Kandola, J. Shawe-taylor, and N. Cristianini, Learning semantic similarity, Advances in Neural Information Processing Systems 15 (NIPS 15, pp.673-680, 2003.

L. Katz, A new status index derived from sociometric analysis, Psychometrika, vol.18, issue.1, pp.39-43, 1953.

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, vol.393, pp.600-616, 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.

D. Liben-nowell and J. Kleinberg, The link-prediction problem for social networks, Journal of the Association for Information Science and Technology, vol.58, issue.7, pp.1019-1031, 2007.

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.

L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank citation ranking: Bringing order to the web, 1999.

I. J. Schoenberg, Remarks to Maurice Fréchet's article "Sur la définition axiomatique d'une classe d'espace distanciés vectoriellement applicable sur l'espace de Hilbert, Ann. Math, vol.36, issue.3, pp.724-732, 1935.

I. J. Schoenberg, Metric spaces and positive definite functions, Transactions of the American Mathematical Society, vol.44, issue.3, pp.522-536, 1938.

M. Saerens, , 2016.

G. E. Sharpe, Solution of the (m + 1)-terminal resistive network problem by means of metric geometry, Proceedings of the First Asilomar Conference on Circuits and Systems, pp.319-328, 1967.

J. Shawe-taylor and N. Cristianini, Kernel Methods for Pattern Analysis, 2004.

A. J. Smola and R. Kondor, Kernels and regularization on graphs, Learning Theory and Kernel Machines, pp.144-158, 2003.

F. Sommer, F. Fouss, and M. Saerens, Comparison of graph node distances on clustering tasks, Lecture Notes in Computer Science, vol.9886, pp.192-201, 2016.

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.

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