Coarse graining for synchronization in directed networks.

  title={Coarse graining for synchronization in directed networks.},
  author={An Zeng and Linyuan L{\"u}},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={83 5 Pt 2},
  • A. Zeng, Linyuan Lü
  • Published 1 December 2010
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Coarse-graining model is a promising way to analyze and visualize large-scale networks. The coarse-grained networks are required to preserve statistical properties as well as the dynamic behaviors of the initial networks. Some methods have been proposed and found effective in undirected networks, while the study on coarse-graining directed networks lacks of consideration. In this paper we proposed a path-based coarse-graining (PCG) method to coarse grain the directed networks. Performing the… 

Figures from this paper

Coarse graining method based on generalized degree in complex network

Extraction algorithm for optimal coarse-grained networks on complex networks

Numerical simulation for EA on four kinds of networks and performing Kuramoto model on optimal coarse-grained networks, it is found the algorithm can effectively obtain the optimal coarse -grained network.

Optimization algorithms for spectral coarse-graining of complex networks

Spectral coarse graining for random walks in bipartite networks.

Many real-world networks display a natural bipartite structure, yet analyzing and visualizing large bipartite networks is one of the open challenges in complex network research. A practical approach

A new spectral coarse-graining algorithm based on K-means clustering in complex networks

A new SCG algorithm based on K-means clustering (KCSCG) is proposed, which cannot only reduce the amount of calculation, but also accurately control the size of coarse-grained network.

Coarse Graining Method Based on Noded Similarity in Complex Network

A large number of simulation experiments show that the proposed coarse-graining method can effectively reduce the size of the network, while maintaining some statistical properties of the original network to some extent.

Manipulating directed networks for better synchronization

This paper proposes a centrality-based manipulating (CBM) method, where the node centrality is measured by the well-known PageRank algorithm, and demonstrates that the CBM method has an advantage in shortening the convergence time to synchronization on directed networks.

Modularity-based Backbone Extraction in Weighted Complex Networks

A filter-based method that removes nodes with the lower contribution to the network’s modularity, the so-called “modularity vitality backbone" is proposed and Experimental results show that the proposed strategy outperforms the “overlapping nodes ego backbone" and the ”overlapped nodes and hub backbone.



Some methods for classification and analysis of multivariate observations

The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to give

IL-13受体α2降低血吸虫病肉芽肿的炎症反应并延长宿主存活时间[英]/Mentink-Kane MM,Cheever AW,Thompson RW,et al//Proc Natl Acad Sci U S A


Phys. Rep

  • Phys. Rep
  • 2008

Moreno , and A . Arenas

  • Phys . Rev . Lett . Phys . Rev . E

Physica A

  • Physica A
  • 2006


  • Phys. Rev. Lett
  • 2003

Comput. Math. Organ. Theory

  • Comput. Math. Organ. Theory
  • 2001

Phys. Rev. E

  • Phys. Rev. E
  • 2010

Phys. Rev. E

  • Phys. Rev. E
  • 2006