Citation

Donninger C. Soc. Netw. 1986; 8(2): 191-203.

Copyright

(Copyright © 1986, Elsevier Publishing)

DOI

10.1016/S0378-8733(86)80003-X

PMID

unavailable

Abstract

For a random directed and undirected graph the distribution or point- and graph-centrality based on degree is derived. Statistical tests, based on poisson or normal approximations are proposed and the behaviour of graph centrality for different network sizes and densities is analysed. The analytic asymptotic results arc checked by extensive simulation.