# Discriminating Power of Centrality Measures

@article{Rombach2013DiscriminatingPO, title={Discriminating Power of Centrality Measures}, author={M. Puck Rombach and Mason A. Porter}, journal={ArXiv}, 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 that if all vertices of a graph have the same subgraph centrality, then all vertices… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 22 REFERENCES

## Subgraph centrality in complex networks.

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Feasibility conditions for the existence of walk-regular graphs

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Open problem

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## The Physics of Communicability in Complex Networks

VIEW 1 EXCERPT

## Networks: An Introduction

VIEW 2 EXCERPTS

## Communicability in complex networks.

VIEW 1 EXCERPT