Quasi-Closeness: A Toolkit for Social Network Applications Involving Indirect Connections

Abstract EN

We come up with a punishment in the form of exponential decay for the number of vertices that a path passes through, which is able to reconcile the contradictory effects of geodesic length and edge weights.

This core thought is the key to handling three typical applications; that is, given an information demander, he may be faced with the following problems: choosing optimal route to contact the single supplier, picking out the best supplier between multiple candidates, and calculating his point centrality, which involves indirect connections.

Accordingly, three concrete solutions in one logic thread are proposed.

Firstly, by adding a constraint to Dijkstra algorithm, we limit our candidates for optimal route to the sample space of geodesics.

Secondly, we come up with a unified standard for the comparison between adjacent and nonadjacent vertices.

Through punishment in the form of exponential decay, the attenuation effect caused by the number of vertices that a path passes through has been offset.

Then the adjacent vertices and punished nonadjacent vertices can be compared directly.

At last, an unprecedented centrality index, quasi-closeness, is ready to come out, with direct and indirect connections being summed up.