Browse
Submit Data
Databases
API
Help

Dataset Information

24 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Eigenvalue-based entropy in directed complex networks.

ABSTRACT: 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.

SUBMITTER: Sun Y

PROVIDER: S-EPMC8216510 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Structural discrimination of networks by using distance, degree and eigenvalue-based measures.

Project description:In chemistry and computational biology, structural graph descriptors have been proven essential for characterizing the structure of chemical and biological networks. It has also been demonstrated that they are useful to derive empirical models for structure-oriented drug design. However, from a more general (complex network-oriented) point of view, investigating mathematical properties of structural descriptors, such as their uniqueness and structural interpretation, is also important for an in-depth understanding of the underlying methods. In this paper, we emphasize the evaluation of the uniqueness of distance, degree and eigenvalue-based measures. Among these are measures that have been recently investigated extensively. We report numerical results using chemical and exhaustively generated graphs and also investigate correlations between the measures.

| S-EPMC3391207 | biostudies-literature

Eigenvalue based spectral classification

Project description:This paper describes a new method of classification based on spectral analysis. The motivations behind developing the new model were the failures of the classical spectral cluster analysis based on combinatorial and normalized Laplacian for a set of real-world datasets of textual documents. Reasons of the failures are analysed. While the known methods are all based on usage of eigenvectors of graph Laplacians, a new classification method based on eigenvalues of graph Laplacians is proposed and studied.

| S-EPMC10079090 | biostudies-literature

Asymptotic entropy of the Gibbs state of complex networks.

Project description: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.

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

Graphlet-based Characterization of Directed Networks.

Project description:We are flooded with large-scale, dynamic, directed, networked data. Analyses requiring exact comparisons between networks are computationally intractable, so new methodologies are sought. To analyse directed networks, we extend graphlets (small induced sub-graphs) and their degrees to directed data. Using these directed graphlets, we generalise state-of-the-art network distance measures (RGF, GDDA and GCD) to directed networks and show their superiority for comparing directed networks. Also, we extend the canonical correlation analysis framework that enables uncovering the relationships between the wiring patterns around nodes in a directed network and their expert annotations. On directed World Trade Networks (WTNs), our methodology allows uncovering the core-broker-periphery structure of the WTN, predicting the economic attributes of a country, such as its gross domestic product, from its wiring patterns in the WTN for up-to ten years in the future. It does so by enabling us to track the dynamics of a country's positioning in the WTN over years. On directed metabolic networks, our framework yields insights into preservation of enzyme function from the network wiring patterns rather than from sequence data. Overall, our methodology enables advanced analyses of directed networked data from any area of science, allowing domain-specific interpretation of a directed network's topology.

| S-EPMC5062067 | biostudies-literature

Using arborescences to estimate hierarchicalness in directed complex networks.

Project description:Complex networks are a useful tool for the understanding of complex systems. One of the emerging properties of such systems is their tendency to form hierarchies: networks can be organized in levels, with nodes in each level exerting control on the ones beneath them. In this paper, we focus on the problem of estimating how hierarchical a directed network is. We propose a structural argument: a network has a strong top-down organization if we need to delete only few edges to reduce it to a perfect hierarchy-an arborescence. In an arborescence, all edges point away from the root and there are no horizontal connections, both characteristics we desire in our idealization of what a perfect hierarchy requires. We test our arborescence score in synthetic and real-world directed networks against the current state of the art in hierarchy detection: agony, flow hierarchy and global reaching centrality. These tests highlight that our arborescence score is intuitive and we can visualize it; it is able to better distinguish between networks with and without a hierarchical structure; it agrees the most with the literature about the hierarchy of well-studied complex systems; and it is not just a score, but it provides an overall scheme of the underlying hierarchy of any directed complex network.

| S-EPMC5790222 | biostudies-literature

Sequence and entropy-based control of complex coacervates.

Project description:Biomacromolecules rely on the precise placement of monomers to encode information for structure, function, and physiology. Efforts to emulate this complexity via the synthetic control of chemical sequence in polymers are finding success; however, there is little understanding of how to translate monomer sequence to physical material properties. Here we establish design rules for implementing this sequence-control in materials known as complex coacervates. These materials are formed by the associative phase separation of oppositely charged polyelectrolytes into polyelectrolyte dense (coacervate) and polyelectrolyte dilute (supernatant) phases. We demonstrate that patterns of charges can profoundly affect the charge-charge associations that drive this process. Furthermore, we establish the physical origin of this pattern-dependent interaction: there is a nuanced combination of structural changes in the dense coacervate phase and a 1D confinement of counterions due to patterns along polymers in the supernatant phase.

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

Different eigenvalue distributions encode the same temporal tasks in recurrent neural networks.

Project description:Different brain areas, such as the cortex and, more specifically, the prefrontal cortex, show great recurrence in their connections, even in early sensory areas. Several approaches and methods based on trained networks have been proposed to model and describe these regions. It is essential to understand the dynamics behind the models because they are used to build different hypotheses about the functioning of brain areas and to explain experimental results. The main contribution here is the description of the dynamics through the classification and interpretation carried out with a set of numerical simulations. This study sheds light on the multiplicity of solutions obtained for the same tasks and shows the link between the spectra of linearized trained networks and the dynamics of the counterparts. The patterns in the distribution of the eigenvalues of the recurrent weight matrix were studied and properly related to the dynamics in each task.Supplementary informationThe online version contains supplementary material available at 10.1007/s11571-022-09802-5.

| S-EPMC9020562 | biostudies-literature

The integration of weighted gene association networks based on information entropy.

Project description:Constructing genome scale weighted gene association networks (WGAN) from multiple data sources is one of research hot spots in systems biology. In this paper, we employ information entropy to describe the uncertain degree of gene-gene links and propose a strategy for data integration of weighted networks. We use this method to integrate four existing human weighted gene association networks and construct a much larger WGAN, which includes richer biology information while still keeps high functional relevance between linked gene pairs. The new WGAN shows satisfactory performance in disease gene prediction, which suggests the reliability of our integration strategy. Compared with existing integration methods, our method takes the advantage of the inherent characteristics of the component networks and pays less attention to the biology background of the data. It can make full use of existing biological networks with low computational effort.

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