2020
DOI: 10.48550/arxiv.2002.02605
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Primer on Laplacian Dynamics in Directed Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…which is essentially a type of generalized Laplacian dynamics with more complicated details (see [37][38][39] for the elementary Laplacian dynamics). See figure 1(c) for illustrations.…”
Section: Joint Global Dynamics Of Convergent and Divergent Evolutionmentioning
confidence: 99%
“…which is essentially a type of generalized Laplacian dynamics with more complicated details (see [37][38][39] for the elementary Laplacian dynamics). See figure 1(c) for illustrations.…”
Section: Joint Global Dynamics Of Convergent and Divergent Evolutionmentioning
confidence: 99%
“…The operator L θ is reduced to the weighted symmetric graph Laplacian if k + = k − and also to the conventional graph Laplacian if k + = k − = 1 [91,92]. Equation 6can also cover linear transport on graphs, a class of linear electric circuits [93], consensus dynamics on graphs [94], and other linear dynamics on graphs [86,95]. 11…”
Section: Definition 3 (Weighted Asymmetric Graph Laplacianmentioning
confidence: 99%
“…where deg(i) is the in-degree of node i. According to [22] the multiplicity of the eigenvalue 0 of L equals to the number of maximal reachable vertex sets. In other words, multiplicity of zero eigenvalues is the number of trees needed to cover G. Therefore, matrix L has m b + m f eigenvalues equal to 0.…”
Section: High-level Planning: Recovery Trajectory Planningmentioning
confidence: 99%