2011
DOI: 10.1007/978-1-4614-0754-6_4
|View full text |Cite
|
Sign up to set email alerts
|

Laplacian Spectra and Synchronization Processes on Complex Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
13
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(14 citation statements)
references
References 47 publications
1
13
0
Order By: Relevance
“…determined by the a linear combination of eigenmodes of the graph Laplacian, since all eigenmodes destabilise simultaneously. It is known that the graph Laplacian can be used to predict phase-locked patterns (Chen, Lu, Zhan, & Chen, 2012) and has indeed been used to predict empirical FC from SC (Abdelnour, Dayan, Devinsky, Thesen, & Raj, 2018). Following from this, the eigenmodes of the Jacobian in Equation 5 can be used as simple, easily computable proxy for the FC matrix when the system is poised at a local instability.…”
Section: It Has Been Shown Inmentioning
confidence: 99%
“…determined by the a linear combination of eigenmodes of the graph Laplacian, since all eigenmodes destabilise simultaneously. It is known that the graph Laplacian can be used to predict phase-locked patterns (Chen, Lu, Zhan, & Chen, 2012) and has indeed been used to predict empirical FC from SC (Abdelnour, Dayan, Devinsky, Thesen, & Raj, 2018). Following from this, the eigenmodes of the Jacobian in Equation 5 can be used as simple, easily computable proxy for the FC matrix when the system is poised at a local instability.…”
Section: It Has Been Shown Inmentioning
confidence: 99%
“…Dynamic phenomena are ubiquitous in nature and play a key role within various contexts in sociology [3], and technology [4]. To date, the problem of how the structural properties of a network influences the convergence and stability of its synchronized states has been extensively investigated and discussed, both numerically and theoretically [5,6,7,8,9], with special attention given to networks of coupled oscillators [10,11,12,13].…”
Section: Introductionmentioning
confidence: 99%
“…Communication efficiency was studied via analyzing changes to the global topological distance, expressed as the average shortest path, and the diameter of the network (the longest of the shortest paths), while undergoing edge removal. Network synchronizability was studied by computing spectral graph metrics of the graph Laplacian (Chung, 1997 ; Boccaletti et al, 2006 ; Arenas et al, 2008 ; Chen et al, 2012 ). Specifically, the second smallest eigenvalue, λ 2 , which is known as algebraic connectivity (Fiedler, 1973 ), and is an important measure of graph robustness, i.e., its magnitude indicates connectedness.…”
Section: Introductionmentioning
confidence: 99%
“…In addition, the largest absolute eigenvalue (λ N ), called the spectral radius was also computed. Synchronizability, as the stability of a synchronized state, is maximal in unweighted, fully random networks with uniform degree distribution, and depends strongly on λ 2 (Nishikawa et al, 2003 ; Atay et al, 2006 ; Almendral and Díaz-Guilera, 2007 ; Chen et al, 2012 ). The higher the maximal eigenvalue, the easier the network reaches the synchronization regime.…”
Section: Introductionmentioning
confidence: 99%