Browse
Submit Data
Databases
API
Help

Dataset Information

28 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Detecting coalitions by optimally partitioning signed networks of political collaboration.

ABSTRACT: We propose new mathematical programming models for optimal partitioning of a signed graph into cohesive groups. To demonstrate the approach's utility, we apply it to identify coalitions in US Congress since 1979 and examine the impact of polarized coalitions on the effectiveness of passing bills. Our models produce a globally optimal solution to the NP-hard problem of minimizing the total number of intra-group negative and inter-group positive edges. We tackle the intensive computations of dense signed networks by providing upper and lower bounds, then solving an optimization model which closes the gap between the two bounds and returns the optimal partitioning of vertices. Our substantive findings suggest that the dominance of an ideologically homogeneous coalition (i.e. partisan polarization) can be a protective factor that enhances legislative effectiveness.

SUBMITTER: Aref S

PROVIDER: S-EPMC6992702 | biostudies-literature | 2020 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Detecting coalitions by optimally partitioning signed networks of political collaboration.

Aref Samin S Neal Zachary Z

Scientific reports 20200130 1

We propose new mathematical programming models for optimal partitioning of a signed graph into cohesive groups. To demonstrate the approach's utility, we apply it to identify coalitions in US Congress since 1979 and examine the impact of polarized coalitions on the effectiveness of passing bills. Our models produce a globally optimal solution to the NP-hard problem of minimizing the total number of intra-group negative and inter-group positive edges. We tackle the intensive computations of dense ...[more]

PMID: 32001776

Similar Datasets

Identifying hidden coalitions in the US House of Representatives by optimally partitioning signed networks based on generalized balance.

Project description:In network science, identifying optimal partitions of a signed network into internally cohesive and mutually divisive clusters based on generalized balance theory is computationally challenging. We reformulate and generalize two binary linear programming models that tackle this challenge, demonstrating their practicality by applying them to partition signed networks of collaboration and opposition in the US House of Representatives. These models guarantee a globally optimal network partition and can be practically applied to signed networks containing up to 30,000 edges. In the US House context, we find that a three-cluster partition is better than a conventional two-cluster partition, where the otherwise hidden third coalition is composed of highly effective legislators who are ideologically aligned with the majority party.

| S-EPMC8497621 | biostudies-literature

Selfish partners: resource partitioning in male coalitions of Asiatic lions.

Project description:Behavioral plasticity within species is adaptive which directs survival traits to take multiple pathways under varying conditions. Male-male cooperation is an evolutionary strategy often exhibiting an array of alternatives between and within species. African male lions coalesce to safeguard territories and mate acquisition. Unique to these coalitions is lack of strict hierarchies between partners, who have similar resource securities possibly because of many mating opportunities within large female groups. Skewed mating and feeding rights have only been documented in large coalitions where males were related. However, smaller modal prey coupled with less simultaneous mating opportunities for male Asiatic lions in Gir forests, India would likely result in a different coalition structure. Observations on mating events (n = 127) and feeding incidents (n = 44) were made on 11 male coalitions and 9 female prides in Gir, to assess resource distribution within and among different sized male coalitions. Information from 39 males was used to estimate annual tenure-holding probabilities. Single males had smaller tenures and appropriated fewer matings than coalition males. Pronounced dominance hierarchies were observed within coalitions, with one partner getting more than 70% of all matings and 47% more food. Competition between coalition partners at kills increased with decline in prey size, increase in coalition size and the appetite states of the males. However, immediate subordinates in coalitions had higher reproductive fitness than single males. Declining benefits to partners with increasing coalition size, with individuals below the immediate subordinates having fitness comparable to single males, suggest to an optimal coalition size of 2 lions. Lions under different competitive selection in Gir show behavioral plasticity to form hierarchical coalitions, wherein partners utilize resources asymmetrically, yet coalesce for personal gains.

| S-EPMC5873260 | biostudies-literature

Nunchaku: optimally partitioning data into piece-wise contiguous segments.

Project description:MotivationWhen analyzing 1D time series, scientists are often interested in identifying regions where one variable depends linearly on the other. Typically, they use an ad hoc and therefore often subjective method to do so.ResultsHere, we develop a statistically rigorous, Bayesian approach to infer the optimal partitioning of a dataset not only into contiguous piece-wise linear segments, but also into contiguous segments described by linear combinations of arbitrary basis functions. We therefore present a general solution to the problem of identifying discontinuous change points. Focusing on microbial growth, we use the algorithm to find the range of optical density where this density is linearly proportional to the number of cells and to automatically find the regions of exponential growth for both Escherichia coli and Saccharomyces cerevisiae. For budding yeast, we consequently are able to infer the Monod constant for growth on fructose. Our algorithm lends itself to automation and high throughput studies, increases reproducibility, and should facilitate data analyses for a broad range of scientists.Availability and implementationThe corresponding Python package, entitled Nunchaku, is available at PyPI: https://pypi.org/project/nunchaku.

| S-EPMC10697733 | biostudies-literature

Generalization of clustering coefficients to signed correlation networks.

Project description:The recent interest in network analysis applications in personality psychology and psychopathology has put forward new methodological challenges. Personality and psychopathology networks are typically based on correlation matrices and therefore include both positive and negative edge signs. However, some applications of network analysis disregard negative edges, such as computing clustering coefficients. In this contribution, we illustrate the importance of the distinction between positive and negative edges in networks based on correlation matrices. The clustering coefficient is generalized to signed correlation networks: three new indices are introduced that take edge signs into account, each derived from an existing and widely used formula. The performances of the new indices are illustrated and compared with the performances of the unsigned indices, both on a signed simulated network and on a signed network based on actual personality psychology data. The results show that the new indices are more resistant to sample variations in correlation networks and therefore have higher convergence compared with the unsigned indices both in simulated networks and with real data.

| S-EPMC3931641 | biostudies-literature

Robust gene coexpression networks using signed distance correlation.

Project description:MotivationEven within well studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes/proteins, using a network of gene coexpression data that includes functional annotations. However, the lack of trustworthy functional annotations can impede the validation of such networks. Hence, there is a need for a principled method to construct gene coexpression networks that capture biological information and are structurally stable even in the absence of functional information.ResultsWe introduce the concept of signed distance correlation as a measure of dependency between two variables, and apply it to generate gene coexpression networks. Distance correlation offers a more intuitive approach to network construction than commonly used methods such as Pearson correlation and mutual information. We propose a framework to generate self-consistent networks using signed distance correlation purely from gene expression data, with no additional information. We analyse data from three different organisms to illustrate how networks generated with our method are more stable and capture more biological information compared to networks obtained from Pearson correlation or mutual information.Supplementary informationSupplementary Information and code are available at Bioinformatics and https://github.com/javier-pardodiaz/sdcorGCN online.

| S-EPMC8557847 | biostudies-literature

The asymptotic distribution of modularity in weighted signed networks.

Project description:Modularity is a popular metric for quantifying the degree of community structure within a network. The distribution of the largest eigenvalue of a network's edge weight or adjacency matrix is well studied and is frequently used as a substitute for modularity when performing statistical inference. However, we show that the largest eigenvalue and modularity are asymptotically uncorrelated, which suggests the need for inference directly on modularity itself when the network size is large. To this end, we derive the asymptotic distributions of modularity in the case where the network's edge weight matrix belongs to the Gaussian orthogonal ensemble, and study the statistical power of the corresponding test for community structure under some alternative models. We empirically explore universality extensions of the limiting distribution and demonstrate the accuracy of these asymptotic distributions through Type I error simulations. We also compare the empirical powers of the modularity based tests with some existing methods. Our method is then used to test for the presence of community structure in two real data applications.

| S-EPMC8300091 | biostudies-literature

Inferring directional relationships in microbial communities using signed Bayesian networks.

Project description:BackgroundMicrobe-microbe and host-microbe interactions in a microbiome play a vital role in both health and disease. However, the structure of the microbial community and the colonization patterns are highly complex to infer even under controlled wet laboratory conditions. In this study, we investigate what information, if any, can be provided by a Bayesian Network (BN) about a microbial community. Unlike the previously proposed Co-occurrence Networks (CoNs), BNs are based on conditional dependencies and can help in revealing complex associations.ResultsIn this paper, we propose a way of combining a BN and a CoN to construct a signed Bayesian Network (sBN). We report a surprising association between directed edges in signed BNs and known colonization orders.ConclusionsBNs are powerful tools for community analysis and extracting influences and colonization patterns, even though the analysis only uses an abundance matrix with no temporal information. We conclude that directed edges in sBNs when combined with negative correlations are consistent with and strongly suggestive of colonization order.

| S-EPMC7751116 | biostudies-literature

Computing global structural balance in large-scale signed social networks.

Project description:Structural balance theory affirms that signed social networks (i.e., graphs whose signed edges represent friendly/hostile interactions among individuals) tend to be organized so as to avoid conflictual situations, corresponding to cycles of negative parity. Using an algorithm for ground-state calculation in large-scale Ising spin glasses, in this paper we compute the global level of balance of very large online social networks and verify that currently available networks are indeed extremely balanced. This property is explainable in terms of the high degree of skewness of the sign distributions on the nodes of the graph. In particular, individuals linked by a large majority of negative edges create mostly "apparent disorder," rather than true "frustration."

| S-EPMC3248482 | biostudies-literature

Collaboration in social networks.

Project description:The very notion of social network implies that linked individuals interact repeatedly with each other. This notion allows them not only to learn successful strategies and adapt to them, but also to condition their own behavior on the behavior of others, in a strategic forward looking manner. Game theory of repeated games shows that these circumstances are conducive to the emergence of collaboration in simple games of two players. We investigate the extension of this concept to the case where players are engaged in a local contribution game and show that rationality and credibility of threats identify a class of Nash equilibria--that we call "collaborative equilibria"--that have a precise interpretation in terms of subgraphs of the social network. For large network games, the number of such equilibria is exponentially large in the number of players. When incentives to defect are small, equilibria are supported by local structures whereas when incentives exceed a threshold they acquire a nonlocal nature, which requires a "critical mass" of more than a given fraction of the players to collaborate. Therefore, when incentives are high, an individual deviation typically causes the collapse of collaboration across the whole system. At the same time, higher incentives to defect typically support equilibria with a higher density of collaborators. The resulting picture conforms with several results in sociology and in the experimental literature on game theory, such as the prevalence of collaboration in denser groups and in the structural hubs of sparse networks.

| S-EPMC3311355 | biostudies-literature

Optimally conductive networks in randomly dispersed CNT:graphene hybrids.

Project description:A predictive model is proposed that quantitatively describes the synergistic behavior of the electrical conductivities of CNTs and graphene in CNT:graphene hybrids. The number of CNT-to-CNT, graphene-to-graphene, and graphene-to-CNT contacts is calculated assuming a random distribution of CNTs and graphene particles in the hybrids and using an orientation density function. Calculations reveal that the total number of contacts reaches a maximum at a specific composition and depends on the particle sizes of the graphene and CNTs. The hybrids, prepared using inkjet printing, are distinguished by higher electrical conductivities than that of 100% CNT or graphene at certain composition ratios. These experimental results provide strong evidence that this approach involving constituent element contacts is suitable for investigating the properties of particulate hybrid materials.

| S-EPMC4643282 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data