Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Learning self-driven collective dynamics with graph networks.

ABSTRACT: Despite decades of theoretical research, the nature of the self-driven collective motion remains indigestible and controversial, while the phase transition process of its dynamic is a major research issue. Recent methods propose to infer the phase transition process from various artificially extracted features using machine learning. In this thesis, we propose a new order parameter by using machine learning to quantify the synchronization degree of the self-driven collective system from the perspective of the number of clusters. Furthermore, we construct a powerful model based on the graph network to determine the long-term evolution of the self-driven collective system from the initial position of the particles, without any manual features. Results show that this method has strong predictive power, and is suitable for various noises. Our method can provide reference for the research of other physical systems with local interactions.

SUBMITTER: Wang R

PROVIDER: S-EPMC8752591 | biostudies-literature | 2022 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Learning self-driven collective dynamics with graph networks.

Wang Rui R Fang Feiteng F Cui Jiamei J Zheng Wen W

Scientific reports 20220111 1

Despite decades of theoretical research, the nature of the self-driven collective motion remains indigestible and controversial, while the phase transition process of its dynamic is a major research issue. Recent methods propose to infer the phase transition process from various artificially extracted features using machine learning. In this thesis, we propose a new order parameter by using machine learning to quantify the synchronization degree of the self-driven collective system from the pers ...[more]

PMID: 35017588

Similar Datasets

Machine Learning Nucleation Collective Variables with Graph Neural Networks.

Project description:The efficient calculation of nucleation collective variables (CVs) is one of the main limitations to the application of enhanced sampling methods to the investigation of nucleation processes in realistic environments. Here we discuss the development of a graph-based model for the approximation of nucleation CVs that enables orders-of-magnitude gains in computational efficiency in the on-the-fly evaluation of nucleation CVs. By performing simulations on a nucleating colloidal system mimicking a multistep nucleation process from solution, we assess the model's efficiency in both postprocessing and on-the-fly biasing of nucleation trajectories with pulling, umbrella sampling, and metadynamics simulations. Moreover, we probe and discuss the transferability of graph-based models of nucleation CVs across systems using the model of a CV based on sixth-order Steinhardt parameters trained on a colloidal system to drive the nucleation of crystalline copper from its melt. Our approach is general and potentially transferable to more complex systems as well as to different CVs.

| S-EPMC10902841 | biostudies-literature

Self-Supervised Learning of Graph Neural Networks: A Unified Review.

Project description:Deep models trained in supervised mode have achieved remarkable success on a variety of tasks. When labeled samples are limited, self-supervised learning (SSL) is emerging as a new paradigm for making use of large amounts of unlabeled samples. SSL has achieved promising performance on natural language and image learning tasks. Recently, there is a trend to extend such success to graph data using graph neural networks (GNNs). In this survey, we provide a unified review of different ways of training GNNs using SSL. Specifically, we categorize SSL methods into contrastive and predictive models. In either category, we provide a unified framework for methods as well as how these methods differ in each component under the framework. Our unified treatment of SSL methods for GNNs sheds light on the similarities and differences of various methods, setting the stage for developing new methods and algorithms. We also summarize different SSL settings and the corresponding datasets used in each setting. To facilitate methodological development and empirical comparison, we develop a standardized testbed for SSL in GNNs, including implementations of common baseline methods, datasets, and evaluation metrics.

| S-EPMC9902037 | biostudies-literature

Graph dynamical networks for unsupervised learning of atomic scale dynamics in materials.

Project description:Understanding the dynamical processes that govern the performance of functional materials is essential for the design of next generation materials to tackle global energy and environmental challenges. Many of these processes involve the dynamics of individual atoms or small molecules in condensed phases, e.g. lithium ions in electrolytes, water molecules in membranes, molten atoms at interfaces, etc., which are difficult to understand due to the complexity of local environments. In this work, we develop graph dynamical networks, an unsupervised learning approach for understanding atomic scale dynamics in arbitrary phases and environments from molecular dynamics simulations. We show that important dynamical information, which would be difficult to obtain otherwise, can be learned for various multi-component amorphous material systems. With the large amounts of molecular dynamics data generated every day in nearly every aspect of materials design, this approach provides a broadly applicable, automated tool to understand atomic scale dynamics in material systems.

| S-EPMC6573035 | biostudies-literature

Collective dynamics of active cytoskeletal networks.

Project description:Self organization mechanisms are essential for the cytoskeleton to adapt to the requirements of living cells. They rely on the intricate interplay of cytoskeletal filaments, crosslinking proteins and molecular motors. Here we present an in vitro minimal model system consisting of actin filaments, fascin and myosin-II filaments exhibiting pulsatile collective dynamics and superdiffusive transport properties. Both phenomena rely on the complex competition of crosslinking molecules and motor filaments in the network. They are only observed if the relative strength of the binding of myosin-II filaments to the actin network allows exerting high enough forces to unbind actin/fascin crosslinks. This is shown by varying the binding strength of the acto-myosin bond and by combining the experiments with phenomenological simulations based on simple interaction rules.

| S-EPMC3162599 | biostudies-literature

Self-supervised graph representation learning integrates multiple molecular networks and decodes gene-disease relationships.

Project description:Leveraging molecular networks to discover disease-relevant modules is a long-standing challenge. With the accumulation of interactomes, there is a pressing need for powerful computational approaches to handle the inevitable noise and context-specific nature of biological networks. Here, we introduce Graphene, a two-step self-supervised representation learning framework tailored to concisely integrate multiple molecular networks and adapted to gene functional analysis via downstream re-training. In practice, we first leverage GNN (graph neural network) pre-training techniques to obtain initial node embeddings followed by re-training Graphene using a graph attention architecture, achieving superior performance over competing methods for pathway gene recovery, disease gene reprioritization, and comorbidity prediction. Graphene successfully recapitulates tissue-specific gene expression across disease spectrum and demonstrates shared heritability of common mental disorders. Graphene can be updated with new interactomes or other omics features. Graphene holds promise to decipher gene function under network context and refine GWAS (genome-wide association study) hits and offers mechanistic insights via decoding diseases from genome to networks to phenotypes.

| S-EPMC9868676 | biostudies-literature

Dynamics of collective performance in collaboration networks.

Project description:Today, many complex tasks are assigned to teams, rather than individuals. One reason for teaming up is expansion of the skill coverage of each individual to the joint team skill set. However, numerous empirical studies of human groups suggest that the performance of equally skilled teams can widely differ. Two natural question arise: What are the factors defining team performance? and How can we best predict the performance of a given team on a specific task? While the team members' task-related capabilities constrain the potential for the team's success, the key to understanding team performance is in the analysis of the team process, encompassing the behaviors of the team members during task completion. In this study, we extend the existing body of research on team process and prediction models of team performance. Specifically, we analyze the dynamics of historical team performance over a series of tasks as well as the fine-grained patterns of collaboration between team members, and formally connect these dynamics to the team performance in the predictive models. Our major qualitative finding is that higher performing teams have well-connected collaboration networks-as indicated by the topological and spectral properties of the latter-which are more robust to perturbations, and where network processes spread more efficiently. Our major quantitative finding is that our predictive models deliver accurate team performance predictions-with a prediction error of 15-25%-on a variety of simple tasks, outperforming baseline models that do not capture the micro-level dynamics of team member behaviors. We also show how to use our models in an application, for optimal online planning of workload distribution in an organization. Our findings emphasize the importance of studying the dynamics of team collaboration as the major driver of high performance in teams.

| S-EPMC6179230 | biostudies-literature

Topology-driven collective dynamics of nematic colloidal entanglement.

Project description:Entanglement in a soft condensed matter system is enabled in the form of entangled disclination lines by using colloidal particles in nematic liquid crystals. These topological excitations are manifested as colloidal entanglement at equilibrium. How to further utilize nonequilibrium disclination lines to manipulate colloidal entanglement remains a nontrivial and challenging task. In this work, we use experiments and simulations to demonstrate the reconfigurations of nematic colloidal entanglement in light-driven spatiotemporal evolutions of disclination lines. Colloidal entanglement can sense subtle changes in the topological structures of disclination lines and realize chirality conversion. This conversion is manifested as the "domino effect" of the collective rotation of colloids in the disclination lines. By programming the topological patterns and the geometry of the disclination lines, colloidal entanglement can be assembled and split. More remarkably, a double-helix entangled structure can be formed by controlling the changes in the morphology of the disclination lines. Thus, this work will provide opportunities to program colloidal composites for smart materials and micromachines.

| S-EPMC11406232 | biostudies-literature

Collective buoyancy-driven dynamics in swarming enzymatic nanomotors.

Project description:Enzymatic nanomotors harvest kinetic energy through the catalysis of chemical fuels. When a drop containing nanomotors is placed in a fuel-rich environment, they assemble into ordered groups and exhibit intriguing collective behaviour akin to the bioconvection of aerobic microorganismal suspensions. This collective behaviour presents numerous advantages compared to individual nanomotors, including expanded coverage and prolonged propulsion duration. However, the physical mechanisms underlying the collective motion have yet to be fully elucidated. Our study investigates the formation of enzymatic swarms using experimental analysis and computational modelling. We show that the directional movement of enzymatic nanomotor swarms is due to their solutal buoyancy. We investigate various factors that impact the movement of nanomotor swarms, such as particle concentration, fuel concentration, fuel viscosity, and vertical confinement. We examine the effects of these factors on swarm self-organization to gain a deeper understanding. In addition, the urease catalysis reaction produces ammonia and carbon dioxide, accelerating the directional movement of active swarms in urea compared with passive ones in the same conditions. The numerical analysis agrees with the experimental findings. Our findings are crucial for the potential biomedical applications of enzymatic nanomotor swarms, ranging from enhanced diffusion in bio-fluids and targeted delivery to cancer therapy.

| S-EPMC11522643 | biostudies-literature

Learning Cortical Parcellations Using Graph Neural Networks.

Project description:Deep learning has been applied to magnetic resonance imaging (MRI) for a variety of purposes, ranging from the acceleration of image acquisition and image denoising to tissue segmentation and disease diagnosis. Convolutional neural networks have been particularly useful for analyzing MRI data due to the regularly sampled spatial and temporal nature of the data. However, advances in the field of brain imaging have led to network- and surface-based analyses that are often better represented in the graph domain. In this analysis, we propose a general purpose cortical segmentation method that, given resting-state connectivity features readily computed during conventional MRI pre-processing and a set of corresponding training labels, can generate cortical parcellations for new MRI data. We applied recent advances in the field of graph neural networks to the problem of cortical surface segmentation, using resting-state connectivity to learn discrete maps of the human neocortex. We found that graph neural networks accurately learn low-dimensional representations of functional brain connectivity that can be naturally extended to map the cortices of new datasets. After optimizing over algorithm type, network architecture, and training features, our approach yielded mean classification accuracies of 79.91% relative to a previously published parcellation. We describe how some hyperparameter choices including training and testing data duration, network architecture, and algorithm choice affect model performance.

| S-EPMC8739886 | biostudies-literature

When Does Self-Supervision Help Graph Convolutional Networks?

Project description:Self-supervision as an emerging technique has been employed to train convolutional neural networks (CNNs) for more transferrable, generalizable, and robust representation learning of images. Its introduction to graph convolutional networks (GCNs) operating on graph data is however rarely explored. In this study, we report the first systematic exploration and assessment of incorporating self-supervision into GCNs. We first elaborate three mechanisms to incorporate self-supervision into GCNs, analyze the limitations of pretraining & finetuning and self-training, and proceed to focus on multi-task learning. Moreover, we propose to investigate three novel self-supervised learning tasks for GCNs with theoretical rationales and numerical comparisons. Lastly, we further integrate multi-task self-supervision into graph adversarial training. Our results show that, with properly designed task forms and incorporation mechanisms, self-supervision benefits GCNs in gaining more generalizability and robustness. Our codes are available at https://github.com/Shen-Lab/SS-GCNs.

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