rokassembly21 {L1centrality} | R Documentation |
Republic of Korea's 21st National Assembly Bill Cosponsorship Network
Description
Network between 317 members of the Republic of Korea's 21st National Assembly (May 30th, 2020–May 29th, 2024). Each member of the assembly represents one vertex.
An edge between two members is formed if there is at least one cosponsored bill. The weight of this edge is given as 1/(number of cosponsored bills between two members) during the first 40 months of the 21st assembly (Jun. 2020–Sep. 2023).
Usage
data(rokassembly21)
Format
An undirected, connected, and (edge) weighted igraph
graph
object with 317 vertices and 47,657 edges.
Vertex attributes:
-
‘name’: Pseudonyms of each member. They are in the format of the party's initial character, followed by a random number (e.g., D4). Each party's initial character is:
-
‘D’: Democratic Party of Korea.
-
‘P’: People Power Party.
-
‘J’: Justice Party.
-
‘O’: Others (Basic Income Party, Hope of Korea, The Progressive Party, Transition Korea).
-
-
‘party’: Factor with 7 levels. Denotes the political party of each member as of Sep. 2023. Note that independent members are assigned to their original party.
-
‘gender’: Factor with 2 levels. ‘M’ (male) or ‘F’ (female).
-
‘nelect’: Number of legislative terms in the assembly for each member. Ranges from 1 to 6.
-
‘district’: Indicates if each member is a district representative (
TRUE
) or a proportional representative (FALSE
). -
‘full’: Indicates if each member was in the assembly for the first 40 months.
TRUE
for the members in the office for all 40 months. Members who started their term via by-election, resigned, or lost their seat for any reason during the 40 months are coded asFALSE
. -
‘nbill’: Number of bills cosponsored by each member.
Edge attribute: ‘weight’. Given as a dissimilarity between two vertices. See the description above.
Source
The National Assembly of the Republic of Korea
Bill information: https://likms.assembly.go.kr/bill/main.do
Member information: https://open.assembly.go.kr/portal/assm/search/memberSchPage.do
References
S. Kang and H.-S. Oh. On a notion of graph centrality based on L1 data depth. arXiv preprint arXiv:2404.13233, 2024.