Discovering Hidden Groups in Communication Networks Jeffery T. Baumes Mark Goldberg Malik Magdon-Ismail William A. Wallace We describe models and efficient algorithms for detecting groups (communities) functioning in communication networks which attempt to hide their functionality – hidden groups. Our results reveal the properties of the background network activity that make detection of the hidden group easy, as well as those that make it difficult. Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 02/24/2004 cs-04-04
Discovering Hidden Groups in Communication Networks
Jeffery T. Baumes
Mark Goldberg
Malik Magdon-Ismail
William A. Wallace
We describe models and efficient algorithms for detecting groups (communities) functioning in communication networks which attempt to hide their functionality – hidden groups. Our results reveal the properties of the background network activity that make detection of the hidden group easy, as well as those that make it difficult.
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY
02/24/2004
cs-04-04