Pierre-Alain Toupance

arXiv2020

Identification of complex network topologies through delayed mutual information

The definitions of delayed mutual information and multi-information are recalled. It is shown how the delayed mutual information may be used to reconstruct the interaction topology resulting from some unknown scale-free graph with its associated local dynamics. Delayed mutual information is also used to solve the community detection problem. A probabilistic voter model defined on a scale-free graph is used throughout the paper as an illustrative example.

physics.soc-ph↗

arXiv2019

Controllability of the Voter Model: an information theoretic approach

We address the link between the controllability or observability of a stochastic complex system and concepts of information theory. We show that the most influential degrees of freedom can be detected without acting on the system, by measuring the time-delayed multi-information. Numerical and analytical results support this claim, which is developed in the case of a simple stochastic model on a graph, the so-called voter model. The importance of the noise when controlling the system is demonstrated, leading to the concept of control length. The link with classical control theory is given, as well as the interpretation of controllability in terms of the capacity of a communication canal.

eess.SY↗