|
Upravlenie Bol'shimi Sistemami, 2010, Issue 30, Pages 5–23
(Mi ubs396)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Systems Analysis
Complete hypergraphs. Laplacian spectra. Multi-agent systems
S. L. Blyumin Lipetsk State Technical University, Lipetsk
Abstract:
Computation of Laplacian spectra is considered for complete and complete uniform undirected and directed hypergraphs which Laplacians are circulants. Standard methods are used for computation of circulant spectra. Applications are discussed to consensus problems in multi-agent systems taking account of agents' group interactions.
Keywords:
complete and complete uniform undirected and directed hypergraphs, Laplacians, circulants, spectra, multi-agent systems, consensus problems, agents' group interactions.
Citation:
S. L. Blyumin, “Complete hypergraphs. Laplacian spectra. Multi-agent systems”, UBS, 30 (2010), 5–23
Linking options:
https://www.mathnet.ru/eng/ubs396 https://www.mathnet.ru/eng/ubs/v30/p5
|
Statistics & downloads: |
Abstract page: | 343 | Full-text PDF : | 165 | References: | 44 | First page: | 2 |
|