Causal Discovery in Dynamic Fading Wireless Networks
Oluwaseyi Giwa

TL;DR
This paper introduces a sequential regression algorithm with a novel acyclicity constraint for real-time causal discovery in dynamic fading wireless networks, providing theoretical bounds and validation through simulations.
Contribution
It presents a new online causal inference method tailored for wireless networks with fading and mobility, incorporating a novel application of the NOTEARS constraint.
Findings
Detection delay increases linearly with network size
Delay grows quadratically with noise variance
Delay decreases with larger structural changes
Abstract
Dynamic causal discovery in wireless networks is essential due to evolving interference, fading, and mobility, which complicate traditional static causal models. This paper addresses causal inference challenges in dynamic fading wireless environments by proposing a sequential regression-based algorithm with a novel application of the NOTEARS acyclicity constraint, enabling efficient online updates. We derive theoretical lower and upper bounds on the detection delay required to identify structural changes, explicitly quantifying their dependence on network size, noise variance, and fading severity. Monte Carlo simulations validate these theoretical results, demonstrating linear increases in detection delay with network size, quadratic growth with noise variance, and inverse-square dependence on the magnitude of structural changes. Our findings provide rigorous theoretical insights and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced MIMO Systems Optimization · Advanced Bandit Algorithms Research · Distributed Sensor Networks and Detection Algorithms
MethodsCausal inference
