Browse
Submit Data
Databases
API
Help

Dataset Information

26 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Asymptotic entropy of the Gibbs state of complex networks.

ABSTRACT: In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. We illustrate our analytical results with numerical simulations for Erd?s-Rényi, Watts-Strogatz, Barabási-Albert and Chung-Lu graph models and a few real-world graphs. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random Erd?s-Rényi graphs.

SUBMITTER: Glos A

PROVIDER: S-EPMC7801599 | biostudies-literature | 2021 Jan

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Asymptotic entropy of the Gibbs state of complex networks.

Glos Adam A Krawiec Aleksandra A Pawela Łukasz Ł

Scientific reports 20210111 1

In this work we study the entropy of the Gibbs state corresponding to a graph. The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. We illustrate our analytical results with numerical simulations for Erdős-Rényi, Watts-Strogatz, Barabási-Albert and Chung-Lu graph models and a few real-world gr ...[more]

PMID: 33431960

Similar Datasets

Eigenvalue-based entropy in directed complex networks.

Project description:Entropy is an important index for describing the structure, function, and evolution of network. The existing research on entropy is primarily applied to undirected networks. Compared with an undirected network, a directed network involves a special asymmetric transfer. The research on the entropy of directed networks is very significant to effectively quantify the structural information of the whole network. Typical complex network models include nearest-neighbour coupling network, small-world network, scale-free network, and random network. These network models are abstracted as undirected graphs without considering the direction of node connection. For complex networks, modeling through the direction of network nodes is extremely challenging. In this paper, based on these typical models of complex network, a directed network model considering node connection in-direction is proposed, and the eigenvalue entropies of three matrices in the directed network is defined and studied, where the three matrices are adjacency matrix, in-degree Laplacian matrix and in-degree signless Laplacian matrix. The eigenvalue-based entropies of three matrices are calculated in directed nearest-neighbor coupling, directed small world, directed scale-free and directed random networks. Through the simulation experiment on the real directed network, the result shows that the eigenvalue entropy of the real directed network is between the eigenvalue entropy of directed scale-free network and directed small-world network.

| S-EPMC8216510 | biostudies-literature

Gibbs ensembles for incompatible dependency networks.

Project description:In most statistical applications, the Gibbs sampler is the method of choice for inference regarding conditionally specified distributions that are compatible. Compatibility ensures that a unique Gibbs distribution exists. For machine learning of complex models such as dependency networks, the conditional models are sometimes incompatible. In this paper, we review an ensemble approach using the Gibbs sampler as the base procedure. A Gibbs ensemble consists of many joint distributions resulting from different scan orders of the same conditional model, and the solution is a weighted sum of the ensemble. The algorithm is scalable and can handle large data sets of high dimensionality. The proposed approach provides joint distributions that conform with the conditional specifications better than the solutions obtained by linear programming and by a fixed-scan Gibbs sampler alone. Owing to incompatibility, the invariant distribution of a Gibbs sampler is scan-order dependent. A Gibbs ensemble is the collection of joint distributions estimated from the Gibbs samples of different scan orders.

| S-EPMC5129636 | biostudies-literature

Identifying vital nodes in complex networks by adjacency information entropy.

Project description:Identifying the vital nodes in networks is of great significance for understanding the function of nodes and the nature of networks. Many centrality indices, such as betweenness centrality (BC), eccentricity centrality (EC), closeness centricity (CC), structural holes (SH), degree centrality (DC), PageRank (PR) and eigenvector centrality (VC), have been proposed to identify the influential nodes of networks. However, some of these indices have limited application scopes. EC and CC are generally only applicable to undirected networks, while PR and VC are generally used for directed networks. To design a more applicable centrality measure, two vital node identification algorithms based on node adjacency information entropy are proposed in this paper. To validate the effectiveness and applicability of the proposed algorithms, contrast experiments are conducted with the BC, EC, CC, SH, DC, PR and VC indices in different kinds of networks. The results show that the index in this paper has a high correlation with the local metric DC, and it also has a certain correlation with the PR and VC indices for directed networks. In addition, the experimental results indicate that our algorithms can effectively identify the vital nodes in different networks.

| S-EPMC7021909 | biostudies-literature

A pairwise maximum entropy model accurately describes resting-state human brain networks.

Project description:The resting-state human brain networks underlie fundamental cognitive functions and consist of complex interactions among brain regions. However, the level of complexity of the resting-state networks has not been quantified, which has prevented comprehensive descriptions of the brain activity as an integrative system. Here, we address this issue by demonstrating that a pairwise maximum entropy model, which takes into account region-specific activity rates and pairwise interactions, can be robustly and accurately fitted to resting-state human brain activities obtained by functional magnetic resonance imaging. Furthermore, to validate the approximation of the resting-state networks by the pairwise maximum entropy model, we show that the functional interactions estimated by the pairwise maximum entropy model reflect anatomical connexions more accurately than the conventional functional connectivity method. These findings indicate that a relatively simple statistical model not only captures the structure of the resting-state networks but also provides a possible method to derive physiological information about various large-scale brain networks.

| S-EPMC3660654 | biostudies-literature

Direct measurement of weakly nonequilibrium system entropy is consistent with Gibbs-Shannon form.

Project description:Stochastic thermodynamics extends classical thermodynamics to small systems in contact with one or more heat baths. It can account for the effects of thermal fluctuations and describe systems far from thermodynamic equilibrium. A basic assumption is that the expression for Shannon entropy is the appropriate description for the entropy of a nonequilibrium system in such a setting. Here we measure experimentally this function in a system that is in local but not global equilibrium. Our system is a micron-scale colloidal particle in water, in a virtual double-well potential created by a feedback trap. We measure the work to erase a fraction of a bit of information and show that it is bounded by the Shannon entropy for a two-state system. Further, by measuring directly the reversibility of slow protocols, we can distinguish unambiguously between protocols that can and cannot reach the expected thermodynamic bounds.

| S-EPMC5651767 | biostudies-literature

The asymptotic distribution of modularity in weighted signed networks.

Project description:Modularity is a popular metric for quantifying the degree of community structure within a network. The distribution of the largest eigenvalue of a network's edge weight or adjacency matrix is well studied and is frequently used as a substitute for modularity when performing statistical inference. However, we show that the largest eigenvalue and modularity are asymptotically uncorrelated, which suggests the need for inference directly on modularity itself when the network size is large. To this end, we derive the asymptotic distributions of modularity in the case where the network's edge weight matrix belongs to the Gaussian orthogonal ensemble, and study the statistical power of the corresponding test for community structure under some alternative models. We empirically explore universality extensions of the limiting distribution and demonstrate the accuracy of these asymptotic distributions through Type I error simulations. We also compare the empirical powers of the modularity based tests with some existing methods. Our method is then used to test for the presence of community structure in two real data applications.

| S-EPMC8300091 | biostudies-literature

Mean first-passage time for maximal-entropy random walks in complex networks.

Project description:We perform an in-depth study for mean first-passage time (MFPT)--a primary quantity for random walks with numerous applications--of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we derive an explicit expression of MFPT in terms of the eigenvalues and eigenvectors of the adjacency matrix associated with the network. For MERW in uncorrelated networks, we also provide a theoretical formula of MFPT at the mean-field level, based on which we further evaluate the dominant scalings of MFPT to different targets for MERW in uncorrelated scale-free networks, and compare the results with those corresponding to traditional unbiased random walks (TURW). We show that the MFPT to a hub node is much lower for MERW than for TURW. However, when the destination is a node with the least degree or a uniformly chosen node, the MFPT is higher for MERW than for TURW. Since MFPT to a uniformly chosen node measures real efficiency of search in networks, our work provides insight into general searching process in complex networks.

| S-EPMC4064359 | biostudies-other

The isothermal Boltzmann-Gibbs entropy reduction affects survival of the fruit fly Drosophila melanogaster.

Project description:To the best of our knowledge, this is the first experimental evidence of the effect of isothermal changes in entropy on a living organism. In greater detail, the effect of the reduction of the total Boltzmann-Gibbs entropy (S) of the aquatic environment on the survival rate and body mass of the fruit fly Drosophila melanogaster was investigated. The tests were carried out in standard thermodynamic states at room temperature of 296.15 K and ambient atmospheric pressure of 1 bar. Two variants of entropy reduction (ΔS) were tested for ΔS = 28.49 and 51.14 J K-1 mol-1 compared to the blind and control samples. The entropy level was experimentally changed, using the quantum system for isothermal entropy reduction. This system is based on quantum bound entanglement of phonons and the phenomenon of phonon resonance (interference of phonon modes) in condensed matter (Silicon dioxide (SiO2) and single crystals of Silicon (Si0), Aluminum (Al0) plates ("chips"), glass, and water). All studied organisms were of the same age (1 day). Mortality was observed daily until the natural death of the organisms. The investigations showed that changes in the Boltzmann-Gibbs entropy affected the survival and body mass of the fruit flies. On the one hand, the reduction in entropy under isothermal conditions in the aquatic environment for ΔS = 28.49 J K-1 mol-1 resulted in an extension of the lifespan and an increase in the body mass of female fruit flies. On the other hand, the almost twofold reduction in this entropy for ΔS = 51.14 J K-1 mol-1 shortened the lives of the males. Thus, the lifespan and body mass of flies turned out to be a specific reaction of metabolism related to changes in the entropy of the aquatic environment.

| S-EPMC10465501 | biostudies-literature

Entropy from state probabilities: hydration entropy of cations.

Project description:Entropy is an important energetic quantity determining the progression of chemical processes. We propose a new approach to obtain hydration entropy directly from probability density functions in state space. We demonstrate the validity of our approach for a series of cations in aqueous solution. Extensive validation of simulation results was performed. Our approach does not make prior assumptions about the shape of the potential energy landscape and is capable of calculating accurate hydration entropy values. Sampling times in the low nanosecond range are sufficient for the investigated ionic systems. Although the presented strategy is at the moment limited to systems for which a scalar order parameter can be derived, this is not a principal limitation of the method. The strategy presented is applicable to any chemical system where sufficient sampling of conformational space is accessible, for example, by computer simulations.

| S-EPMC3668459 | biostudies-literature

Untangling the Hairball: Fitness-Based Asymptotic Reduction of Biological Networks.

Project description:Complex mathematical models of interaction networks are routinely used for prediction in systems biology. However, it is difficult to reconcile network complexities with a formal understanding of their behavior. Here, we propose a simple procedure (called ?¯) to reduce biological models to functional submodules, using statistical mechanics of complex systems combined with a fitness-based approach inspired by in silico evolution. The ?¯ algorithm works by putting parameters or combination of parameters to some asymptotic limit, while keeping (or slightly improving) the model performance, and requires parameter symmetry breaking for more complex models. We illustrate ?¯ on biochemical adaptation and on different models of immune recognition by T cells. An intractable model of immune recognition with close to a hundred individual transition rates is reduced to a simple two-parameter model. The ?¯ algorithm extracts three different mechanisms for early immune recognition, and automatically discovers similar functional modules in different models of the same process, allowing for model classification and comparison. Our procedure can be applied to biological networks based on rate equations using a fitness function that quantifies phenotypic performance.

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