Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

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

ABSTRACT: 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."

SUBMITTER: Facchetti G

PROVIDER: S-EPMC3248482 | biostudies-literature | 2011 Dec

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

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

Facchetti Giuseppe G Iacono Giovanni G Altafini Claudio C

Proceedings of the National Academy of Sciences of the United States of America 20111213 52

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 bal ...[more]

PMID: 22167802

Similar Datasets

Multilevel structural evaluation of signed directed social networks based on balance theory.

Project description:Balance theory explains how network structural configurations relate to tension in social systems, which are commonly modeled as static undirected signed graphs. We expand this modeling approach by incorporating directionality of edges and considering three levels of analysis for balance assessment: triads, subgroups, and the whole network. For triad-level balance, we develop a new measure by utilizing semicycles that satisfy the condition of transitivity. For subgroup-level balance, we propose measures of cohesiveness (intra-group solidarity) and divisiveness (inter-group antagonism) to capture balance within and among subgroups. For network-level balance, we re-purpose the normalized line index to incorporate directionality and assess balance based on the proportion of edges whose position suits balance. Through comprehensive computational analyses, we quantify, analyze, and compare patterns of social structure in triads, subgroups, and the whole network across a range of social settings. We then apply our multilevel framework to examine balance in temporal and multilayer networks to demonstrates the generalizability of our approach. In most cases, we find relatively high balance across the three levels; providing another confirmation of balance theory. We also deliver empirical evidence for the argument that balance at different levels is not the same social phenomenon measured at different scales, but represents different properties (triadic balance, internal cohesion and external division of subgroups, and overall network polarization), and should therefore be evaluated independently from one another. We propose a comprehensive yet parsimonious approach to address this need.

| S-EPMC7498592 | biostudies-literature

Local structure can identify and quantify influential global spreaders in large scale social networks.

Project description:Measuring and optimizing the influence of nodes in big-data online social networks are important for many practical applications, such as the viral marketing and the adoption of new products. As the viral spreading on a social network is a global process, it is commonly believed that measuring the influence of nodes inevitably requires the knowledge of the entire network. Using percolation theory, we show that the spreading process displays a nucleation behavior: Once a piece of information spreads from the seeds to more than a small characteristic number of nodes, it reaches a point of no return and will quickly reach the percolation cluster, regardless of the entire network structure; otherwise the spreading will be contained locally. Thus, we find that, without the knowledge of the entire network, any node's global influence can be accurately measured using this characteristic number, which is independent of the network size. This motivates an efficient algorithm with constant time complexity on the long-standing problem of best seed spreaders selection, with performance remarkably close to the true optimum.

| S-EPMC6055149 | biostudies-literature

Structural instability of large-scale functional networks.

Project description:We study how large functional networks can grow stably under possible cascading overload failures and evaluated the maximum stable network size above which even a small-scale failure would cause a fatal breakdown of the network. Employing a model of cascading failures induced by temporally fluctuating loads, the maximum stable size nmax has been calculated as a function of the load reduction parameter r that characterizes how quickly the total load is reduced during the cascade. If we reduce the total load sufficiently fast (r ≥ rc), the network can grow infinitely. Otherwise, nmax is finite and increases with r. For a fixed r(< rc), nmax for a scale-free network is larger than that for an exponential network with the same average degree. We also discuss how one detects and avoids the crisis of a fatal breakdown of the network from the relation between the sizes of the initial network and the largest component after an ordinarily occurring cascading failure.

| S-EPMC5519067 | biostudies-other

Quantifying social segregation in large-scale networks.

Project description:We present a measure of social segregation which combines mobile phone data and income register data in Oslo, Norway. In addition to measuring the extent of social segregation, our study shows that social segregation is strong, robust, and that social networks are particularly clustered among the richest. Using location data on the areas where people work, we also examine whether exposure to other social strata weakens measured segregation. Lastly, we extend our analysis to a large South Asian city and show that our main results hold across two widely different societies.

| S-EPMC9018874 | biostudies-literature

Portal Nodes Screening for Large Scale Social Networks.

Project description:Network autoregression model (NAM), as a powerful tool to study user social behaviors on large scale social networks, has drawn great attention in recent years. In this paper, we are interested in identifying the influential users (i.e., portal nodes) in a social network under the framework of NAM. Especially, we consider the autoregression model that allows to have a heterogenous and sparse network effect coefficients. Therefore, the portal nodes take influential powers which are corresponding to the nonzero network effect coefficients. A screening procedure is designed to screen out the portal nodes and the strong screening consistency is established theoretically. A quasi maximum likelihood method is applied to estimate the influential powers. The asymptotic normality of the resulting estimator is established. Further selection procedure is given by taking advantage of the local linear approximation algorithm. Extensive numerical studies are conducted by using a Sina Weibo dataset for illustration purpose.

| S-EPMC6889960 | biostudies-literature

Global stabilizing control of large-scale biomolecular regulatory networks.

Project description:MotivationCellular behavior is determined by complex non-linear interactions between numerous intracellular molecules that are often represented by Boolean network models. To achieve a desired cellular behavior with minimal intervention, we need to identify optimal control targets that can drive heterogeneous cellular states to the desired phenotypic cellular state with minimal node intervention. Previous attempts to realize such global stabilization were based solely on either network structure information or simple linear dynamics. Other attempts based on non-linear dynamics are not scalable.ResultsHere, we investigate the underlying relationship between structurally identified control targets and optimal global stabilizing control targets based on non-linear dynamics. We discovered that optimal global stabilizing control targets can be identified by analyzing the dynamics between structurally identified control targets. Utilizing these findings, we developed a scalable global stabilizing control framework using both structural and dynamic information. Our framework narrows down the search space based on strongly connected components and feedback vertex sets then identifies global stabilizing control targets based on the canalization of Boolean network dynamics. We find that the proposed global stabilizing control is superior with respect to the number of control target nodes, scalability, and computational complexity.Availability and implementationWe provide a GitHub repository that contains the DCGS framework written in Python as well as biological random Boolean network datasets (https://github.com/sugyun/DCGS).Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC9891247 | biostudies-literature

Multirelational organization of large-scale social networks in an online world.

Project description:The capacity to collect fingerprints of individuals in online media has revolutionized the way researchers explore human society. Social systems can be seen as a nonlinear superposition of a multitude of complex social networks, where nodes represent individuals and links capture a variety of different social relations. Much emphasis has been put on the network topology of social interactions, however, the multidimensional nature of these interactions has largely been ignored, mostly because of lack of data. Here, for the first time, we analyze a complete, multirelational, large social network of a society consisting of the 300,000 odd players of a massive multiplayer online game. We extract networks of six different types of one-to-one interactions between the players. Three of them carry a positive connotation (friendship, communication, trade), three a negative (enmity, armed aggression, punishment). We first analyze these types of networks as separate entities and find that negative interactions differ from positive interactions by their lower reciprocity, weaker clustering, and fatter-tail degree distribution. We then explore how the interdependence of different network types determines the organization of the social system. In particular, we study correlations and overlap between different types of links and demonstrate the tendency of individuals to play different roles in different networks. As a demonstration of the power of the approach, we present the first empirical large-scale verification of the long-standing structural balance theory, by focusing on the specific multiplex network of friendship and enmity relations.

| S-EPMC2922277 | biostudies-literature

Link clustering reveals structural characteristics and biological contexts in signed molecular networks.

Project description:Many biological networks are signed molecular networks which consist of positive and negative links. To reveal the distinct features between links with different signs, we proposed signed link-clustering coefficients that assess the similarity of inter-action profiles between linked molecules. We found that positive links tended to cluster together, while negative links usually behaved like bridges between positive clusters. Positive links with higher adhesiveness tended to share protein domains, be associated with protein-protein interactions and make intra-connections within protein complexes. Negative links that were more bridge-like tended to make interconnections between protein complexes. Utilizing the proposed measures to group positive links, we observed hierarchical modules that could be well characterized by functional annotations or known protein complexes. Our results imply that the proposed sign-specific measures can help reveal the network structural characteristics and the embedded biological contexts of signed links, as well as the functional organization of signed molecular networks.

| S-EPMC3691148 | biostudies-literature

Segregation, integration, and balance of large-scale resting brain networks configure different cognitive abilities.

Project description:Diverse cognitive processes set different demands on locally segregated and globally integrated brain activity. However, it remains an open question how resting brains configure their functional organization to balance the demands on network segregation and integration to best serve cognition. Here we use an eigenmode-based approach to identify hierarchical modules in functional brain networks and quantify the functional balance between network segregation and integration. In a large sample of healthy young adults (n = 991), we combine the whole-brain resting state functional magnetic resonance imaging (fMRI) data with a mean-filed model on the structural network derived from diffusion tensor imaging and demonstrate that resting brain networks are on average close to a balanced state. This state allows for a balanced time dwelling at segregated and integrated configurations and highly flexible switching between them. Furthermore, we employ structural equation modeling to estimate general and domain-specific cognitive phenotypes from nine tasks and demonstrate that network segregation, integration, and their balance in resting brains predict individual differences in diverse cognitive phenotypes. More specifically, stronger integration is associated with better general cognitive ability, stronger segregation fosters crystallized intelligence and processing speed, and an individual's tendency toward balance supports better memory. Our findings provide a comprehensive and deep understanding of the brain's functioning principles in supporting diverse functional demands and cognitive abilities and advance modern network neuroscience theories of human cognition.

| S-EPMC8201916 | biostudies-literature

Computing evolutionary distinctiveness indices in large scale analysis.

Project description:We present optimal linear time algorithms for computing the Shapley values and 'heightened evolutionary distinctiveness' (HED) scores for the set of taxa in a phylogenetic tree. We demonstrate the efficiency of these new algorithms by applying them to a set of 10,000 reasonable 5139-species mammal trees. This is the first time these indices have been computed on such a large taxon and we contrast our finding with an ad-hoc index for mammals, fair proportion (FP), used by the Zoological Society of London's EDGE programme. Our empirical results follow expectations. In particular, the Shapley values are very strongly correlated with the FP scores, but provide a higher weight to the few monotremes that comprise the sister to all other mammals. We also find that the HED score, which measures a species' unique contribution to future subsets as function of the probability that close relatives will go extinct, is very sensitive to the estimated probabilities. When they are low, HED scores are less than FP scores, and approach the simple measure of a species' age. Deviations (like the Solendon genus of the West Indies) occur when sister species are both at high risk of extinction and their clade roots deep in the tree. Conversely, when endangered species have higher probabilities of being lost, HED scores can be greater than FP scores and species like the African elephant Loxondonta africana, the two solendons and the thumbless bat Furipterus horrens can move up the rankings. We suggest that conservation attention be applied to such species that carry genetic responsibility for imperiled close relatives. We also briefly discuss extensions of Shapley values and HED scores that are possible with the algorithms presented here.

| S-EPMC3353162 | 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