On proximity measures for graph vertices

zbMath1079.05503MaRDI QIDQ1882188

E. V. Shamis, Pavel Yu. Chebotarev

Publication date: 19 October 2004

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

Resistance distances on networks, Further results on digraphs with completely real Laplacian spectra, Geometry of complex networks and topological centrality, Incremental Computation of Pseudo-Inverse of Laplacian, A bag-of-paths framework for network data analysis, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, The walk distances in graphs, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, A combinatorial expression for the group inverse of symmetric \(M\)-matrices, Spanning forests and the golden ratio, On reliability indices of communication networks, Which digraphs with ring structure are essentially cyclic?, The graph bottleneck identity, Sparse randomized shortest paths routing with Tsallis divergence regularization, Protometrics, Similarities on graphs: kernels versus proximity measures, Unnamed Item, Unnamed Item, Unnamed Item, Dissecting graph measure performance for node clustering in LFR parameter space, A graph interpretation of the least squares ranking method, Forest matrices around the Laplacian matrix