On Proximity Measures for Graph Vertices

Abstract

We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted structures and take into account not only the shortest, but also all other connections, which is desirable in many applications. To apply these proximity measures to unweighted structures, every edge should be assigned the same weight which determines the proportion of taking account of two routes, from which one is one edge longer than the other. Among the proximity measures we consider path accessibility, route accessibility, relative forest accessibility along with its components, accessibility via dense forests, and connection reliability. A number of characteristic conditions is introduced and employed to characterize the proximity measures. A topological interpretation is obtained for the Moore-Penrose generalized inverse of the Laplacian matrix of a weighted multigraph.

17 pages, 3 figures

Cited by in corpus (8)

• The Slashdot Zoo: Mining a Social Network with Negative Edges
• Fast Evaluation for Relevant Quantities of Opinion Dynamics
• A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks
• Measures and Optimization for Robustness and Vulnerability in Disconnected Networks
• Selection of Centrality Measures Using Self-Consistency and Bridge Axioms
• Dissecting graph measure performance for node clustering in LFR parameter space
• Efficient Algorithms for Relevant Quantities of Friedkin-Johnsen Opinion Dynamics Model
• Least squares for cardinal paired comparisons data