A network is robust to the extent that it is not vulnerable to disconnection by removal of nodes. The minimum number of nodes that need be removed to disconnect a pair of other nodes is called the connectivity of the pair. It can be proved that the connectivity is also equal to the number of...

We investigate the networks of committee and subcommittee assignments in the United States House of Representatives from the 101st-108th Congresses, with the committees connected by "interlocks" or common membership. We examine the community structure in these networks using several methods,...

Network theory provides a powerful tool for the representation and analysis of complex systems of interacting agents. Here, we investigate the U.S. House of Representatives network of committees and subcommittees, with committees connected according to "interlocks," or common membership....