A graph realization approach to network identification
Authors:
- 1 December 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 4642-4647
Abstract
In this paper, we 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 steering a subset of network vertices via an appropriately defined interface and observing the network's response at another set of vertices. Using the fact that system identification provides a realization of the original network, we utilize transformations to identify a graph topology that is compatible with the set of input-output data. An example demonstrates the application of the proposed method.Keywords
This publication has 22 references indexed in Scilit:
- Privacy in Social NetworksSynthesis Lectures on Data Mining and Knowledge Discovery, 2012
- Unveiling the connectivity structure of financial networks via high-frequency analysisPhysica A: Statistical Mechanics and its Applications, 2009
- Reconstructing the topology of sparsely connected dynamical networksPhysical Review E, 2008
- Modeling gene expression regulatory networks with the sparse vector autoregressive modelBMC Systems Biology, 2007
- Estimating Topology of NetworksPhysical Review Letters, 2006
- A direct reconstruction algorithm for electrical impedance tomographyIEEE Transactions on Medical Imaging, 2002
- Can one hear the shape of a graph?Journal of Physics A: General Physics, 2001
- Computing a nearest symmetric positive semidefinite matrixLinear Algebra and its Applications, 1988
- Can One Hear the Shape of a Drum?The American Mathematical Monthly, 1966
- A Quantitative Approach to a Problem in ClassificationEvolution, 1957