Enhancing the spectral gap of networks by node removal.

@article{Watanabe2010EnhancingTS,
  title={Enhancing the spectral gap of networks by node removal.},
  author={T. Watanabe and N. Masuda},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2010},
  volume={82 4 Pt 2},
  pages={
          046102
        }
}
  • T. Watanabe, N. Masuda
  • Published 2010
  • Physics, Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • Dynamics on networks are often characterized by the second smallest eigenvalue of the Laplacian matrix of the network, which is called the spectral gap. Examples include the threshold coupling strength for synchronization and the relaxation time of a random walk. A large spectral gap is usually associated with high network performance, such as facilitated synchronization and rapid convergence. In this study, we seek to enhance the spectral gap of undirected and unweighted networks by removing… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Decreasing the spectral radius of a graph by link removals.
    104
    A New Metric to Find the Most Vulnerable Node in Complex Networks
    1
    Comparing the reliability of networks by spectral analysis
    1
    Distributed Link Removal Using Local Estimation of Network Topology
    5
    A meta-heuristic algorithm for enhancing the synchronizability of complex networks
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES
    THE LAPLACIAN SPECTRUM OF GRAPHS y
    1201
    Dynamical Processes on Complex Networks
    1673
    Phys
    • 2004
    J
    307583
    New J
    • 2007
    Phys Rep 424
    • 2006
    CRITICAL INFORMATION INFRASTRUCTURE SECURITY - NETWORK INTRUSION DETECTION SYSTEMS
    3
    I and J
    118700
    Interacting particle systems Springer
    163
    Nature 393
    • 1998