title: Coexistence of phases and the observability of random graphs.
abstract: In a recent Letter, Yang et al. [Phys. Rev. Lett. 109, 258701 (2012)] introduced the concept of observability transitions: the percolationlike emergence of a macroscopic observable component in graphs in which the state of a fraction of the nodes, and of their first neighbors, is monitored. We show how their concept of depth-L percolation--where the state of nodes up to a distance L of monitored nodes is known--can be mapped onto multitype random graphs, and use this mapping to exactly solve the observability problem for arbitrary L. We then demonstrate a nontrivial coexistence of an observable and of a nonobservable extensive component. This coexistence suggests that monitoring a macroscopic portion of a graph does not prevent a macroscopic event to occur unbeknown to the observer. We also show that real complex systems behave quite differently with regard to observability depending on whether they are geographically constrained or not.
authors.affiliation: Département de physique, de génie physique et d'optique, Université Laval, Québec (Québec), Canada G1V 0A6.
authors.forename: Antoine
authors.initials: A
authors.lastname: Allard
authors.affiliation: Département de physique, de génie physique et d'optique, Université Laval, Québec (Québec), Canada G1V 0A6.
authors.forename: Laurent
authors.initials: L
authors.lastname: Hébert-Dufresne
authors.affiliation: Département de physique, de génie physique et d'optique, Université Laval, Québec (Québec), Canada G1V 0A6.
authors.forename: Jean-Gabriel
authors.initials: JG
authors.lastname: Young
authors.affiliation: Département de physique, de génie physique et d'optique, Université Laval, Québec (Québec), Canada G1V 0A6.
authors.forename: Louis J
authors.initials: LJ
authors.lastname: Dubé
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D015233:Models, Statistical