Totally homogeneous networks

@article{Shi2019TotallyHN,
  title={Totally homogeneous networks},
  author={Dinghua Shi and Linyuan Lu and Guanrong Chen},
  journal={National Science Review},
  year={2019},
  volume={6},
  pages={962 - 969}
}
In network science, the non-homogeneity of node degrees has been a concerned issue for study. [] Key Method These two vector spaces are related through a boundary operator, e.g., mapping the boundary of a triangle in one space to the sun of three links in the other space. Under the new framework, some important concepts and methodologies from algebraic topology, such as characteristic number, homology group and Betti number, will have a play in network science leading to foreseeable new research directions…
View on PubMed
doi.org
29 Citations
Highly Influential Citations
1
Background Citations
12
Methods Citations
3

Figures from this paper

29 Citations

Towards the cycle structures in complex network: A new perspective

This paper defines two cycle-based node characteristics, namely cycle number and cycle ratio, which can be used to measure a node's importance, and finds that an ordinary network can be converted into a hypernetwork by considering its basic cycles as hyperedges.

Characterizing cycle structure in complex networks

The authors investigate the cycle organization of synthetic and real systems, and use such information to define a centrality measure that is more informative than traditional indexes to the end of understanding network dismantling, synchronization, and spreading processes.

Representing complex networks without connectivity via spectrum series

The characteristics of cycle-nodes-ratio and its application to network classification

Computing cliques and cavities in networks

The authors introduce the concept of computability for searching maximum clique in large networks and an optimized algorithm for finding cavities with different orders and applies the algorithm to the neuronal network of C. elegans to find all of its cliques and some cavities of different orders.

Optimizing higher-order network topology for synchronization of coupled phase oscillators

This work defines the directed hyperlink, and rigorously demonstrates that for the directed interaction, the structural symmetry can be preserved in the optimally synchronizable network with 2-hyperlink interactions, in contrast to the conclusion for 1- hyperlink interactions.

Optimizing higher-order network topology for synchronization of coupled phase oscillators

Networks in nature have complex interactions among agents. One significant phenomenon induced by interactions is synchronization of coupled agents, and the interactive network topology can be tuned…

Reorderability of node-filtered order complexes.

This work harnesses applied topological methods to determine which of six growing graph models exhibit topology that is robust to randomizing node order, termed global re orderability, and robust to temporally local node swaps, termed local reorderability.

Determinable and interpretable network representation for link prediction

  • Yue Deng
  • Computer Science
    Scientific Reports
  • 2022
Experimental results showed that the AIProbS can reach state-of-the-art precision beyond baseline models on some small data whose distribution of training and test sets is usually not unified enough for machine learning methods to perform well.

Correlation analysis of combined layers in multiplex networks based on entropy

A new structure entropy is proposed by combining the overlapping links between the combined layers of a multiplex network and the correlation between layers is evaluated by structure entropy, and the results are consistent with the behaviors exhibited by the network.

References

SHOWING 1-10 OF 22 REFERENCES

Towards the cycle structures in complex network: A new perspective

This paper defines two cycle-based node characteristics, namely cycle number and cycle ratio, which can be used to measure a node's importance, and finds that an ordinary network can be converted into a hypernetwork by considering its basic cycles as hyperedges.

Vital nodes identification in complex networks

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Spread of epidemic disease on networks.

  • M. Newman
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.

Searching for Optimal Network Topology with Best Possible Synchronizability

An optimal homogeneous network model is examined which can well describe at least one of such optimal dynamical behaviors-the best possible synchronizability.

Persistent homology of time-dependent functional networks constructed from coupled time series.

It is found that persistent homology can detect differences in synchronization patterns in data sets over time, giving insight both on changes in community structure in the networks and on increased synchronization between brain regions that form loops in a functional network during motor learning.

The theory of graphs and its applications

This book on the theory of graphs provides the reader with a mathematical tool which can be used in the behavioral sciences, in the theory of information, cybernetics, games, transport networks, as…

Computing Persistent Homology

The analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields and derives an algorithm for computing individual persistent homological groups over an arbitrary principal ideal domain in any dimension.

A NEW MEASURE OF RANK CORRELATION

1. In psychological work the problem of comparing two different rankings of the same set of individuals may be divided into two types. In the first type the individuals have a given order A which is…