Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Representing Degree Distributions, Clustering, and Homophily in Social Networks With Latent Cluster Random Effects Models.

ABSTRACT: Social network data often involve transitivity, homophily on observed attributes, clustering, and heterogeneity of actor degrees. We propose a latent cluster random effects model to represent all of these features, and we describe a Bayesian estimation method for it. The model is applicable to both binary and non-binary network data. We illustrate the model using two real datasets. We also apply it to two simulated network datasets with the same, highly skewed, degree distribution, but very different network behavior: one unstructured and the other with transitivity and clustering. Models based on degree distributions, such as scale-free, preferential attachment and power-law models, cannot distinguish between these very different situations, but our model does.

SUBMITTER: Krivitsky PN

PROVIDER: S-EPMC2827882 | biostudies-other | 2009 Jul

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

Representing Degree Distributions, Clustering, and Homophily in Social Networks With Latent Cluster Random Effects Models.

Krivitsky Pavel N PN Handcock Mark S MS Raftery Adrian E AE Hoff Peter D PD

Social networks 20090701 3

Social network data often involve transitivity, homophily on observed attributes, clustering, and heterogeneity of actor degrees. We propose a latent cluster random effects model to represent all of these features, and we describe a Bayesian estimation method for it. The model is applicable to both binary and non-binary network data. We illustrate the model using two real datasets. We also apply it to two simulated network datasets with the same, highly skewed, degree distribution, but very diff ...[more]

PMID: 20191087

Similar Datasets

Fitting Position Latent Cluster Models for Social Networks with latentnet.

Project description:latentnet is a package to fit and evaluate statistical latent position and cluster models for networks. Hoff, Raftery, and Handcock (2002) suggested an approach to modeling networks based on positing the existence of an latent space of characteristics of the actors. Relationships form as a function of distances between these characteristics as well as functions of observed dyadic level covariates. In latentnet social distances are represented in a Euclidean space. It also includes a variant of the extension of the latent position model to allow for clustering of the positions developed in Handcock, Raftery, and Tantrum (2007). The package implements Bayesian inference for the models based on an Markov chain Monte Carlo algorithm. It can also compute maximum likelihood estimates for the latent position model and a two-stage maximum likelihood method for the latent position cluster model. For latent position cluster models, the package provides a Bayesian way of assessing how many groups there are, and thus whether or not there is any clustering (since if the preferred number of groups is 1, there is little evidence for clustering). It also estimates which cluster each actor belongs to. These estimates are probabilistic, and provide the probability of each actor belonging to each cluster. It computes four types of point estimates for the coefficients and positions: maximum likelihood estimate, posterior mean, posterior mode and the estimator which minimizes Kullback-Leibler divergence from the posterior. You can assess the goodness-of-fit of the model via posterior predictive checks. It has a function to simulate networks from a latent position or latent position cluster model.

| S-EPMC5552185 | biostudies-other

SBbadger: biochemical reaction networks with definable degree distributions.

Project description:MotivationAn essential step in developing computational tools for the inference, optimization and simulation of biochemical reaction networks is gauging tool performance against earlier efforts using an appropriate set of benchmarks. General strategies for the assembly of benchmark models include collection from the literature, creation via subnetwork extraction and de novo generation. However, with respect to biochemical reaction networks, these approaches and their associated tools are either poorly suited to generate models that reflect the wide range of properties found in natural biochemical networks or to do so in numbers that enable rigorous statistical analysis.ResultsIn this work, we present SBbadger, a python-based software tool for the generation of synthetic biochemical reaction or metabolic networks with user-defined degree distributions, multiple available kinetic formalisms and a host of other definable properties. SBbadger thus enables the creation of benchmark model sets that reflect properties of biological systems and generate the kinetics and model structures typically targeted by computational analysis and inference software. Here, we detail the computational and algorithmic workflow of SBbadger, demonstrate its performance under various settings, provide sample outputs and compare it to currently available biochemical reaction network generation software.Availability and implementationSBbadger is implemented in Python and is freely available at https://github.com/sys-bio/SBbadger and via PyPI at https://pypi.org/project/SBbadger/. Documentation can be found at https://SBbadger.readthedocs.io.Supplementary informationSupplementary data are available at Bioinformatics online.

| S-EPMC9665861 | biostudies-literature

Model-based clustering of time-evolving networks through temporal exponential-family random graph models.

Project description:Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect a set of nodes sharing similar connectivity patterns in time-evolving networks. Our work is primarily motivated by detecting groups based on interesting features of the time-evolving networks (e.g., stability). In this work, we propose a model-based clustering framework for time-evolving networks based on discrete time exponential-family random graph models, which simultaneously allows both modeling and detecting group structure. To choose the number of groups, we use the conditional likelihood to construct an effective model selection criterion. Furthermore, we propose an efficient variational expectation-maximization (EM) algorithm to find approximate maximum likelihood estimates of network parameters and mixing proportions. The power of our method is demonstrated in simulation studies and empirical applications to international trade networks and the collaboration networks of a large research university.

| S-EPMC7448400 | biostudies-literature

Strong spatial embedding of social networks generates nonstandard epidemic dynamics independent of degree distribution and clustering.

Project description:Some directly transmitted human pathogens, such as influenza and measles, generate sustained exponential growth in incidence and have a high peak incidence consistent with the rapid depletion of susceptible individuals. Many do not. While a prolonged exponential phase typically arises in traditional disease-dynamic models, current quantitative descriptions of nonstandard epidemic profiles are either abstract, phenomenological, or rely on highly skewed offspring distributions in network models. Here, we create large socio-spatial networks to represent contact behavior using human population-density data, a previously developed fitting algorithm, and gravity-like mobility kernels. We define a basic reproductive number [Formula: see text] for this system, analogous to that used for compartmental models. Controlling for [Formula: see text], we then explore networks with a household-workplace structure in which between-household contacts can be formed with varying degrees of spatial correlation, determined by a single parameter from the gravity-like kernel. By varying this single parameter and simulating epidemic spread, we are able to identify how more frequent local movement can lead to strong spatial correlation and, thus, induce subexponential outbreak dynamics with lower, later epidemic peaks. Also, the ratio of peak height to final size was much smaller when movement was highly spatially correlated. We investigate the topological properties of our networks via a generalized clustering coefficient that extends beyond immediate neighborhoods, identifying very strong correlations between fourth-order clustering and nonstandard epidemic dynamics. Our results motivate the observation of both incidence and socio-spatial human behavior during epidemics that exhibit nonstandard incidence patterns.

| S-EPMC7519285 | biostudies-literature

Biology, methodology or chance? The degree distributions of bipartite ecological networks.

Project description:The distribution of the number of links per species, or degree distribution, is widely used as a summary of the topology of complex networks. Degree distributions have been studied in a range of ecological networks, including both mutualistic bipartite networks of plants and pollinators or seed dispersers and antagonistic bipartite networks of plants and their consumers. The shape of a degree distribution, for example whether it follows an exponential or power-law form, is typically taken to be indicative of the processes structuring the network. The skewed degree distributions of bipartite mutualistic and antagonistic networks are usually assumed to show that ecological or co-evolutionary processes constrain the relative numbers of specialists and generalists in the network. I show that a simple null model based on the principle of maximum entropy cannot be rejected as a model for the degree distributions in most of the 115 bipartite ecological networks tested here. The model requires knowledge of the number of nodes and links in the network, but needs no other ecological information. The model cannot be rejected for 159 (69%) of the 230 degree distributions of the 115 networks tested. It performed equally well on the plant and animal degree distributions, and cannot be rejected for 81 (70%) of the 115 plant distributions and 78 (68%) of the animal distributions. There are consistent differences between the degree distributions of mutualistic and antagonistic networks, suggesting that different processes are constraining these two classes of networks. Fit to the MaxEnt null model is consistently poor among the largest mutualistic networks. Potential ecological and methodological explanations for deviations from the model suggest that spatial and temporal heterogeneity are important drivers of the structure of these large networks.

| S-EPMC3048397 | biostudies-literature

Representing dynamic biological networks with multi-scale probabilistic models.

Project description:Dynamic models analyzing gene regulation and metabolism face challenges when adapted to modeling signal transduction networks. During signal transduction, molecular reactions and mechanisms occur in different spatial and temporal frames and involve feedbacks. This impedes the straight-forward use of methods based on Boolean networks, Bayesian approaches, and differential equations. We propose a new approach, ProbRules, that combines probabilities and logical rules to represent the dynamics of a system across multiple scales. We demonstrate that ProbRules models can represent various network motifs of biological systems. As an example of a comprehensive model of signal transduction, we provide a Wnt network that shows remarkable robustness under a range of phenotypical and pathological conditions. Its simulation allows the clarification of controversially discussed molecular mechanisms of Wnt signaling by predicting wet-lab measurements. ProbRules provides an avenue in current computational modeling by enabling systems biologists to integrate vast amounts of available data on different scales.

| S-EPMC6336720 | biostudies-literature

RMBNToolbox: random models for biochemical networks.

Project description:BACKGROUND: There is an increasing interest to model biochemical and cell biological networks, as well as to the computational analysis of these models. The development of analysis methodologies and related software is rapid in the field. However, the number of available models is still relatively small and the model sizes remain limited. The lack of kinetic information is usually the limiting factor for the construction of detailed simulation models. RESULTS: We present a computational toolbox for generating random biochemical network models which mimic real biochemical networks. The toolbox is called Random Models for Biochemical Networks. The toolbox works in the Matlab environment, and it makes it possible to generate various network structures, stoichiometries, kinetic laws for reactions, and parameters therein. The generation can be based on statistical rules and distributions, and more detailed information of real biochemical networks can be used in situations where it is known. The toolbox can be easily extended. The resulting network models can be exported in the format of Systems Biology Markup Language. CONCLUSION: While more information is accumulating on biochemical networks, random networks can be used as an intermediate step towards their better understanding. Random networks make it possible to study the effects of various network characteristics to the overall behavior of the network. Moreover, the construction of artificial network models provides the ground truth data needed in the validation of various computational methods in the fields of parameter estimation and data analysis.

| S-EPMC1896132 | biostudies-other

HEK293T MS - Representing dynamic biological networks with multi-scale probabilistic models

Project description:As an example of a comprehensive model of signal transduction, we provide a Wnt network that shows remarkable robustness under a range of phenotypical and pathological conditions. Its simulation allows the clarification of controversially discussed molecular mechanisms of Wnt signalling by predicting wet-lab measurements. A loss of Rac1 (Ras-related C3 botulinum toxin substrate 1) or JNK2 affected the TCF/LEF reporter whereas a loss of JNK1 had only mild effects, likely due to low abundance of JNK1.

2019-11-12 | PXD011835 | Pride

Effects of random rewiring on the degree correlation of scale-free networks.

Project description:Random rewiring is used to generate null networks for the purpose of analyzing the topological properties of scale-free networks, yet the effects of random rewiring on the degree correlation are subject to contradicting interpretations in the literature. We comprehensively analyze the degree correlation of randomly rewired scale-free networks and show that random rewiring increases disassortativity by reducing the average degree of the nearest neighbors of high-degree nodes. The effect can be captured by the measures of the degree correlation that consider all links in the network, but not by analogous measures that consider only links between degree peers, hence the potential for contradicting interpretations. We furthermore find that random and directional rewiring affect the topology of a scale-free network differently, even if the degree correlation of the rewired networks is the same. Consequently, the network dynamics is changed, which is proven here by means of the biased random walk.

| S-EPMC4611853 | biostudies-other

EIGENVALUE DISTRIBUTIONS OF VARIANCE COMPONENTS ESTIMATORS IN HIGH-DIMENSIONAL RANDOM EFFECTS MODELS.

Project description:We study the spectra of MANOVA estimators for variance component covariance matrices in multivariate random effects models. When the dimensionality of the observations is large and comparable to the number of realizations of each random effect, we show that the empirical spectra of such estimators are well-approximated by deterministic laws. The Stieltjes transforms of these laws are characterized by systems of fixed-point equations, which are numerically solvable by a simple iterative procedure. Our proof uses operator-valued free probability theory, and we establish a general asymptotic freeness result for families of rectangular orthogonally-invariant random matrices, which is of independent interest. Our work is motivated in part by the estimation of components of covariance between multiple phenotypic traits in quantitative genetics, and we specialize our results to common experimental designs that arise in this application.

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