A network analysis of committees in the US House of Representatives

被引:139
作者
Porter, MA [1 ]
Mucha, PJ
Newman, MEJ
Warmbrand, CM
机构
[1] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA
[2] Georgia Inst Technol, Sch Phys, Ctr Nonlinear Sci, Atlanta, GA 30332 USA
[3] Univ Michigan, Dept Phys, Ann Arbor, MI 48109 USA
[4] Univ Michigan, Ctr Study Complex Syst, Ann Arbor, MI 48109 USA
[5] Univ Arizona, Dept Math, Tucson, AZ 85721 USA
关键词
congress; politics; hierarchical clustering; singular value decomposition;
D O I
10.1073/pnas.0500191102
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
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. Analysis of this network reveals clearly the strong links between different committees, as well as the intrinsic hierarchical structure within the House as a whole. We show that network theory, combined with the analysis of roll-call votes using singular value decomposition, successfully uncovers political and organizational correlations between committees in the House without the need to incorporate other political information.
引用
收藏
页码:7057 / 7062
页数:6
相关论文
共 26 条
[1]   The role of political parties in the organization of congress [J].
Boyce, JR ;
Bischak, DP .
JOURNAL OF LAW ECONOMICS & ORGANIZATION, 2002, 18 (01) :1-38
[2]  
Burt RonaldS., 2007, Brokerage and Closure: An Introduction to Social Capital
[3]   Structural holes and good ideas [J].
Burt, RS .
AMERICAN JOURNAL OF SOCIOLOGY, 2004, 110 (02) :349-399
[4]  
Cox GaryW., 1993, Legislative Leviathan. Party Government in the House
[5]  
Davis G. F., 2003, Strategic Organization, V1, P301, DOI 10.1177/14761270030013002
[6]  
Gilligan T. W., 1987, J LAW ECON ORGAN, V3, P287, DOI DOI 10.1093/oxfordjournals.jleo.a036932
[7]  
Golub G. H., 1996, MATRIX COMPUTATIONS
[9]   HIERARCHICAL CLUSTERING SCHEMES [J].
JOHNSON, SC .
PSYCHOMETRIKA, 1967, 32 (03) :241-254
[10]   AN ALGORITHM FOR DRAWING GENERAL UNDIRECTED GRAPHS [J].
KAMADA, T ;
KAWAI, S .
INFORMATION PROCESSING LETTERS, 1989, 31 (01) :7-15