Network transitivity and matrix models.

Z Burda; J Jurkiewicz; A Krzywicki

doi:10.1103/physreve.69.026106

Home/Archive/PubMed

PubMed · 14995519

Network transitivity and matrix models.

Z Burda·J Jurkiewicz·A Krzywicki

View original source ↗Export metadata ↓

Abstract

This paper is a step towards a systematic theory of the transitivity (clustering) phenomenon in random networks. A static framework is used, with adjacency matrix playing the role of the dynamical variable. Hence, our model is a matrix model, where matrices are random, but their elements take values 0 and 1 only. Confusion present in some papers where earlier attempts to incorporate transitivity in a similar framework have been made is hopefully dissipated. Inspired by more conventional matrix models, analytic techniques to develop a static model with nontrivial clustering are introduced. Computer simulations complete the analytic discussion.

Explore related subjects

Cluster Analysis Computer Simulation Models, Statistical Models, Theoretical Neural Networks, Computer Physics Journal Article Research Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Z Burda, J Jurkiewicz, A Krzywicki. 2004-02-20. Network transitivity and matrix models.. https://doi.org/10.1103/physreve.69.026106

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

PubMed2025

Clustering individuals using INMTD: a novel versatile multi-view embedding framework integrating omics and imaging data.

MOTIVATION: Combining omics and images can lead to a more comprehensive clustering of individuals than classic single-view approaches. Among the various approaches for multi-view clustering, nonnegative matrix tri-factorization (NMTF) and nonnegative Tucker decomposition (NTD) are advantageous in learning low-rank embeddings with promising interpretability. Besides, there is a need to handle unwanted drivers of clusterings (i.e. confounders). RESULTS: In this work, we introduce a novel multi-view clustering method based on NMTF and NTD, named INMTD, which integrates omics and 3D imaging data to derive unconfounded subgroups of individuals. According to the adjusted Rand index, INMTD outperformed other clustering methods on a synthetic dataset with known clusters. In the application to real-life facial-genomic data, INMTD generated biologically relevant embeddings for individuals, genetics, and facial morphology. By removing confounded embedding vectors, we derived an unconfounded clustering with better internal and external quality; the genetic and facial annotations of each derived subgroup highlighted distinctive characteristics. In conclusion, INMTD can effectively integrate omics data and 3D images for unconfounded clustering with biologically meaningful interpretation. AVAILABILITY AND IMPLEMENTATION: INMTD is freely available at https://github.com/ZuqiLi/INMTD.

Cluster Analysis↗

PubMed2006

Model mis-specification and overestimation of the intraclass correlation coefficient in cluster randomized trials.

Intraclass correlation coefficient (ICC) estimates must be provided when reporting the results of a cluster randomized trial. This study demonstrates that estimating this parameter with one-way ANOVA and an underlying mixed-effects statistical model leads to biased estimates. The bias depends on the effect size of the studied treatment.

Cluster Analysis↗

PubMed2005

Focused library design in GPCR projects on the example of 5-HT(2c) agonists: comparison of structure-based virtual screening with ligand-based search methods.

The aim of this study was to investigate the usefulness of structure-based virtual screening (VS) for focused library design in G protein-coupled receptors (GPCR) projects on the example of 5-HT(2c) agonists. We compared the performance of structure-based VS against two different homology models using FRED for docking and ScreenScore, FlexX, and PMF for rescoring with the results of 12 ligand-based similarity searches using four different query compounds and three different similarity metrics (Daylight, FTree, Phacir). The result of the similarity search showed much variation, from an enrichment factor up to 3.2 to worse than random, whereas the structure-based VS gave a more stable result with a constant enrichment factor around 2. Additionally, actives retrieved by the structure-based approach were more diverse than the actives among the top scorers of the similarity searches. Based on these results, we suggest basing a focused library design for a GPCR project on a combination of a ligand-based similarity search and structure-based docking.

Cluster Analysis↗