Portal Nodes Screening for Large Scale Social Networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Zhu X
PROVIDER: S-EPMC6889960 | biostudies-literature | 2019 Apr
REPOSITORIES: biostudies-literature
Similar Datasets
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
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
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
Project description:One of the famous results of network science states that networks with heterogeneous connectivity are more susceptible to epidemic spreading than their more homogeneous counterparts. In particular, in networks of identical nodes it has been shown that network heterogeneity, i.e. a broad degree distribution, can lower the epidemic threshold at which epidemics can invade the system. Network heterogeneity can thus allow diseases with lower transmission probabilities to persist and spread. However, it has been pointed out that networks in which the properties of nodes are intrinsically heterogeneous can be very resilient to disease spreading. Heterogeneity in structure can enhance or diminish the resilience of networks with heterogeneous nodes, depending on the correlations between the topological and intrinsic properties. Here, we consider a plausible scenario where people have intrinsic differences in susceptibility and adapt their social network structure to the presence of the disease. We show that the resilience of networks with heterogeneous connectivity can surpass those of networks with homogeneous connectivity. For epidemiology, this implies that network heterogeneity should not be studied in isolation, it is instead the heterogeneity of infection risk that determines the likelihood of outbreaks.
| S-EPMC4543971 | biostudies-other
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
Project description:The innovations of science often point to ideas and behaviors that must spread and take root in communities to have impact. Ideas, practices, and behaviors need to go from accepted truths on the part of a few scientists to commonplace beliefs and norms in the minds of the many. Moving from scientific discoveries to public good requires social influence. We introduce a structured influence process (SIP) framework to explain how social networks (i.e., the structure of social influence) and human social motives (i.e., the process of social influence wherein one person's attitudes and behaviors affect another's) are used collectively to enact social influence within a community. The SIP framework advances the science of scientific communication by positing social influence events that consider both the "who" and the "how" of social influence. This framework synthesizes core ideas from two bodies of research on social influence. The first is network research on social influence structures, which identifies who are the opinion leaders and who among their network of peers shapes their attitudes and behaviors. The second is research on social influence processes in psychology, which explores how human social motives such as the need for accuracy or the need for affiliation stimulate behavior change. We illustrate the practical implications of the SIP framework by applying it to the case of reducing neonatal mortality in India.
| S-EPMC4183181 | biostudies-other
Project description:<p><font color="#FF0000"><b>Note: Data Use Restrictions:</b> <ul> <li>The data <i><u>must only</u></i> be used for genetic research projects solely in the area of health-related social-network research.</li> </ul> </font> </p> <p>This study compiles detailed information on family and social ties linked to participants in the offspring cohort of the Framingham Heart Study. The investigators took computerized information from self-report data used by the FHS for over 30 years to facilitate health exam scheduling. These tracking sheets asked participants to identify people close to them, which were assumed by the investigators to indicate a social tie. Individuals are listed as "egos" (if the ties are from their perspective) and/or "alters" (if they are linked as a friend or family members to one of the other participants). All egos were FHS offspring participants while alters could be FHS participants in any cohort or non-participants. This information was combined with internal FHS pedigree data on family ties to list family member alters (as well as the nature of their relationship). The resultant dataset therefore includes each ego-alter tie, the nature of their relationship and the start and end dates for their ties for each of seven waves for the offspring study.</p> <p>Due to privacy concerns, all exam dates for individuals are listed relative to the initial FHS exam date. The study investigators chose a random, confidential date, to which all initial exam dates are linked (by number of months from random date to initial exam date). With this information, researchers can have access to the temporal relationships among participants' exam dates while remaining unaware of the actual exam dates for individual participants.</p> <p>During each clinic exam cycle, the participants undergo a detailed examination including physical examination, medical history, laboratory testing, and electrocardiogram. Over the years, other tests (that may not be performed at every exam cycle) have included pulmonary function, lifestyle, physical function, cognitive function questionnaires, and various noninvasive cardiovascular tests including echocardiograms. This study involves phenotypic data from these exams including (when available) basic body measurements (height, weight, blood pressure), laboratory values (blood sugar levels, LDL levels), information on smoking and alcohol use, and tests of depression and cognitive functioning.</p> <p><b>Important links to apply for individual-level data</b> <ol> <li><a href="http://dbgap.ncbi.nlm.nih.gov/aa/wga.cgi?view_pdf&stacc=phs000153.v3.p3" target="_blank">Data Use Certification Requirements (DUC)</a></li> <li><a href="GetPdf.cgi?id=phd001183.1" target="_blank">Instructions to Request Authorized Access</a></li> <li><a href="http://view.ncbi.nlm.nih.gov/dbgap-controlled" target="_blank">Apply here for controlled access to individual level data</a></li> <li><a href="GetPdf.cgi?id=phd000317" target="_blank">Participant Protection Policy FAQ</a></li> </ol> </p> <p>In 1948, researchers recruited men and women from the town of Framingham, Massachusetts, beginning the first round of extensive physical examinations and lifestyle interviews that would later be analyzed for common patterns related to CVD development.</p> <p>Initially, the Framingham Heart Study enrolled 5,209 men and women from the Framingham area who were between the ages of 28 and 62 years. Beginning in 1971, the Framingham Heart Study enrolled 5,124 men and women, who were either offspring of the original cohort or spouses of those offspring. In 2002, 4,095 third generation participants (men and women) were enrolled.</p>
| phs000153.v5.p5 | EGA
Project description:Disassortative mixing is ubiquitously found in technological and biological networks, while the corresponding interpretation of its origin remains almost virgin. We here give evidence that pruning the largest-degree nodes of a growing scale-free network has the effect of decreasing the degree correlation coefficient in a controllable and tunable way, while keeping both the trait of a power-law degree distribution and the main properties of network's resilience and robustness under failures or attacks. The essence of these observations can be attributed to the fact the deletion of large-degree nodes affects the delicate balance of positive and negative contributions to degree correlation in growing scale-free networks, eventually leading to the emergence of disassortativity. Moreover, these theoretical prediction will get further validation in the empirical networks. We support our claims via numerical results and mathematical analysis, and we propose a generative model for disassortative growing scale-free networks.
| S-EPMC4269889 | biostudies-other
Project description:We have utilized our custom array GPL11054 to screen a set of sarcoma patient samples for fusion genes One negative control was included in the study. We wanted to investigate the power of our fusion-gene array GPL11054 as a means for fusion gene detection in a series of sarcoma patient samples from two diagnostic laboratories with expertise in fusion gene detection.
2013-10-23 | E-GEOD-43632 | biostudies-arrayexpress
Project description:The relationship between structure and function in the human brain is well established, but not yet well characterised. Large-scale biophysical models allow us to investigate this relationship, by leveraging structural information (e.g. derived from diffusion tractography) in order to couple dynamical models of local neuronal activity into networks of interacting regions distributed across the cortex. In practice however, these models are difficult to parametrise, and their simulation is often delicate and computationally expensive. This undermines the experimental aspect of scientific modelling, and stands in the way of comparing different parametrisations, network architectures, or models in general, with confidence. Here, we advocate the use of Bayesian optimisation for assessing the capabilities of biophysical network models, given a set of desired properties (e.g. band-specific functional connectivity); and in turn the use of this assessment as a principled basis for incremental modelling and model comparison. We adapt an optimisation method designed to cope with costly, high-dimensional, non-convex problems, and demonstrate its use and effectiveness. Using five parameters controlling key aspects of our model, we find that this method is able to converge to regions of high functional similarity with real MEG data, with very few samples given the number of parameters, without getting stuck in local extrema, and while building and exploiting a map of uncertainty defined smoothly across the parameter space. We compare the results obtained using different methods of structural connectivity estimation from diffusion tractography, and find that one method leads to better simulations.
| S-EPMC6324723 | biostudies-literature