Roles in networks

  title={Roles in networks},
  author={Geoffrey Canright and Kenth Eng\o-Monsen},
  journal={Sci. Comput. Program.},
In this paper we offer a topology-driven (‘natur al’) definition of subclusters of an undirected graph or network. In addition we find rules for assigning unique roles (from a small set of possible roles) to each node in the network. Our approach is based on the use of a ‘smooth’ index for wellconnectedness (eigenvector centrality) which is computed for each node. This index, viewed as a height function, then guides the decomposition of the graph into regions (associated with local peaks of the… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
12 Citations
13 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 12 extracted citations


Publications referenced by this paper.
Showing 1-10 of 13 references

Engø, A graph theoretical model of computer security: from file access to social engineering, International J ournal of Information Security

  • M. Burgess, K. G. Canright
  • 2003

Multiplex structure of the communications network in a small working group, Social Networks—An International J ournal of Structural Analysis (2003) (submitted for publication)

  • G. Canright, K. Engø-Monsen, ̊ A. Weltzien
  • 2003

The structure and function of complex networks

  • M. Newman
  • SIAM Review
  • 2003

Stable algorith ms for link analysis

  • A. Y. Ng, A. X. Zheng, M. I. Jordan
  • in: Proc. 24th Annual Intl. ACM SIGIR Conference,
  • 2001

Graph Drawing: Algorithms for the Visualization of Graphs

  • G. D. Batista, P. Eades, R. Tamassia, I. G. Tollis
  • 1999

The pa gerank citation ranking: Br inging order to the web

  • L. Page, S. Brin, R. Motwani, T. Winograd
  • Technical Report, Stanford Digital L ibrary…
  • 1998

Similar Papers

Loading similar papers…