Jordan Centrality#

Computes the infection eccentricity of each node in the infection subgraph. To produce a score with highest value corresponding to the Jordan center, we return the inverse of the infection eccentricity.

param I

The infection subgraph observed at a particular time step

type I

NetworkX Graph

param G

The original graph the infection process was run on. I is a subgraph of G induced by infected vertices at observation time.

type G

NetworkX Graph

Notes

The Jordan infection center is the vertex with minimum infection eccentricity. This is described in [1] and [2].

Nodes outside the infection subgraph receive a score of negative infinity.

Examples

>>> result = cosasi.single_source.jordan_centrality(I, G)

References

1

L. Ying and K. Zhu, “On the Universality of Jordan Centers for Estimating Infection Sources in Tree Networks” IEEE Transactions of Information Theory, 2017

2

L. Ying and K. Zhu, “Diffusion Source Localization in Large Networks” Synthesis Lectures on Communication Networks, 2018