Discriminating Power of Centrality Measures

@article{Rombach2013DiscriminatingPO,
  title={Discriminating Power of Centrality Measures},
  author={M. Puck Rombach and Mason A. Porter},
  journal={CoRR},
  year={2013},
  volume={abs/1305.3146}
}
The calculation of centrality measures is common practice in the study of networks, as they attempt to quantify the importance of individual vertices, edges, or other components. Different centralities attempt to measure importance in different ways. In this paper, we examine a conjecture posed by E. Estrada regarding the ability of several measures to distinguish the vertices of networks. Estrada conjectured [9, 12] that if all vertices of a graph have the same subgraph centrality, then all… CONTINUE READING

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Open problem

  • E. Estrada
  • the discriminant power of the subgraph centrality…
  • 2013
Highly Influential
4 Excerpts

The Structure of Complex Networks: Theory and Applications

  • Ernesto Estrada
  • 2011

Similar Papers

Loading similar papers…