Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6957790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach |
scientific article; zbMATH DE number 6957790 |
Statements
Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (English)
0 references
17 October 2018
0 references
Laplacian matrix
0 references
rank minimization
0 references
minimal polynomial
0 references
consensus algorithm
0 references
0 references
0.7723594307899475
0 references
0.7579020261764526
0 references
0.7504120469093323
0 references
0.748073399066925
0 references
0.7458313703536987
0 references
