{"id":1323,"date":"2018-12-27T11:00:51","date_gmt":"2018-12-27T19:00:51","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1323"},"modified":"2018-12-27T11:00:51","modified_gmt":"2018-12-27T19:00:51","slug":"a-sieve-method-for-consensus-type-network-tomography","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/a-sieve-method-for-consensus-type-network-tomography\/","title":{"rendered":"A sieve method for consensus-type network tomography"},"content":{"rendered":"

M. Nabi-Abdolyousefi, M. Mesbahi<\/strong><\/p>\n

IET Control Theory and Applications<\/strong><\/p>\n

\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
In this note, the authors examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination. The proposed identification process is facilitated by introducing `ports` for stimulating a subset of network vertices via an appropriately defined interface and observing the network`s response at another set of vertices. It is first noted that under the assumption of controllability and observability of corresponding steered-and-observed network, the proposed procedure identifies a number of important features of the network using the spectrum of the graph Laplacian. The authors then proceed to use degree-based graph reconstruction methods to propose a sieve method for further characterisation of the underlying network. An example demonstrates the application of the proposed method.<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n

Links:<\/strong><\/p>\n

\"\"<\/a> \u00a0 \"\"<\/a> \u00a0 \"\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

M. Nabi-Abdolyousefi, M. Mesbahi IET Control Theory and Applications In this note, the authors examine the problem of identifying the interaction geometry among a known number of agents, adopting a consensus-type algorithm for their coordination. The proposed identification process is facilitated by introducing `ports` for stimulating a subset of network vertices via an appropriately defined […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1323"}],"collection":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/comments?post=1323"}],"version-history":[{"count":2,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1323\/revisions"}],"predecessor-version":[{"id":1720,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1323\/revisions\/1720"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1323"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}