Topology Inference over Networks with Nonlinear Coupling
arXiv:1906.09029
Abstract
This work examines the problem of topology inference over discrete-time nonlinear stochastic networked dynamical systems. The goal is to recover the underlying digraph linking the network agents, from observations of their state-evolution. The dynamical law governing the state-evolution of the interacting agents might be nonlinear, i.e., the next state of an agent can depend nonlinearly on its current state and on the states of its immediate neighbors. We establish sufficient conditions that allow consistent graph learning over a special class of networked systems, namely, logistic-type dynamical systems.
Submitted for publication
References in corpus (15)
- Latent variable graphical model selection via convex optimization
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Differential equation approximations for Markov chains
- Convergence Rate Analysis of Distributed Gossip (Linear Parameter) Estimation: Fundamental Limits and Tradeoffs
- Signal Processing on Graphs: Causal Modeling of Unstructured Data
- High-dimensional structure estimation in Ising models: Local separation criterion
- Revealing physical interaction networks from statistics of collective dynamics
- High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
- Reconstructing Links in Directed Networks from Noisy Dynamics
- Diffusion-Based Adaptive Distributed Detection: Steady-State Performance in the Slow Adaptation Regime
- Stochastic networks with multiple stable points
- Causal Inference by Identification of Vector Autoregressive Processes with Hidden Components
- Learning loopy graphical models with latent variables: Efficient methods and guarantees
- Reconstructing directed and weighted topologies of phase-locked oscillator networks
- Inference of topology and the nature of synapses, and the flow of information in neuronal networks