Spectral theory for dynamics on graphs containing attractive and repulsive interactions

Keyphrases

• Repulsive Interaction 100%
• Attractive Interaction 100%
• Dynamic Graph 100%
• Spectral Theory 100%
• Homology Groups 100%
• Degrees of Freedom 50%
• Negative Eigenvalues 50%
• Edge Weight 50%
• Positive Eigenvalues 50%
• Topological Constraints 25%
• Optimal Convergence Rate 25%
• Dynamical Systems 25%
• Laplacian Matrix 25%
• Social Networks 25%
• Random Matrices 25%
• Index Changes 25%
• Weight Change 25%
• Consensus Algorithm 25%
• Graph Laplacian 25%
• Orthogonal Set 25%
• Natural Decomposition 25%
• Fixed Degree 25%
• Eigenvalue Crossing 25%
• Signed Graph 25%
• Nonlinear Oscillator Networks 25%
• Laplacian Spectrum 25%

Mathematics

• Spectral Theory 100%
• Homology Group 100%
• Edge 50%
• Matrix (Mathematics) 50%
• Degree of Freedom 50%
• Negative Eigenvalue 50%
• Positive Eigenvalue 50%
• Eigenvalue 25%
• Laplace Operator 25%
• Dynamical System 25%
• Clique 25%
• Random Matrix 25%
• Graph Laplacian 25%
• Laplacian Matrix 25%
• Orthogonal (Sets) 25%
• Signed Graph 25%