Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-08T05:02:52.823Z Has data issue: false hasContentIssue false

Why Legislative Networks? Analyzing Legislative Network Formation

Published online by Cambridge University Press:  04 December 2017

Rights & Permissions [Opens in a new window]

Abstract

Are the social networks of legislators affected more by their political parties or their personal traits? How does the party organization influence the tendency of members to work collectively on a day-to-day basis? In this paper, I explore the determinants of the relationships of legislators in the Brazilian Chamber of Deputies. I use exponential random graph models to evaluate the relative influence of personal traits versus party influence in generating legislator relationships. Despite a focus on personalism in Brazil, the analysis reveals that the effects of political parties on tie formation are roughly equal to the effects of personal traits, suggesting that networks may make political parties much more cohesive than contemporary literature would lead us to believe.

Information

Type
Original Articles
Copyright
© The European Political Science Association 2017 
Figure 0

Fig. 1 Screen shot of digital survey

Figure 1

Fig. 2 A barplot of the average incoming links by party

Figure 2

Fig. 3 A barplot of the average outgoing links by party

Figure 3

Table 1 Exponential Random Graph Models Main Results

Figure 4

Fig. 4 A projection of the communication network Note: The projection algorithm is the Fruchterman–Reingold, and places central actors closer to the center of the projection. Node size is determined by $$\left( {Indegree{\plus}Outdegree} \right)^{{{1 \over 2}}} $$.

Figure 5

Fig. 5 A projection of the social network Note: The projection algorithm is the Fruchterman–Reingold, and places central actors closer to the center of the projection. Node size is determined by $$\left( {Indegree{\plus}Outdegree} \right)^{{{1 \over 2}}} $$.

Figure 6

Fig. 6 A projection of the information-seeking network Note: The projection algorithm is the Fruchterman–Reingold, and places central actors closer to the center of the projection. Node size is determined by $$\left( {Indegree{\plus}Outdegree} \right)^{{{1 \over 2}}} $$.

Supplementary material: PDF

Wojcik supplementary material

Wojcik supplementary material 1

Download Wojcik supplementary material(PDF)
PDF 977.5 KB
Supplementary material: Link
Link