Spin glass phase transitions in the random feedback vertex set problem

30 Mar 2016  ·  Qin Shao-Meng, Zeng Ying, Zhou Hai-Jun ·

A feedback vertex set (FVS) of an undirected graph contains vertices from every cycle of this graph. Constructing a FVS of sufficiently small cardinality is very difficult in the worst cases, but for random graphs this problem can be efficiently solved after converting it into an appropriate spin glass model [H.-J... Zhou, Eur. Phys. J. B 86 (2013) 455]. In the present work we study the local stability and the phase transition properties of this spin glass model on random graphs. For both regular random graphs and Erd\"os-R\'enyi graphs we determine the inverse temperature $\beta_l$ at which the replica-symmetric mean field theory loses its local stability, the inverse temperature $\beta_d$ of the dynamical (clustering) phase transition, and the inverse temperature $\beta_c$ of the static (condensation) phase transition. We find that $\beta_{l}$, $\beta_{d}$, and $\beta_c$ change with the (mean) vertex degree in a non-monotonic way; $\beta_d$ is distinct from $\beta_c$ for regular random graphs of vertex degrees $K\geq 64$, while $\beta_d$ are always identical to $\beta_c$ for Erd\"os-R\'enyi graphs (at least up to mean vertex degree $c=512$). We also compute the minimum FVS size of regular random graphs through the zero-temperature first-step replica-symmetry-breaking mean field theory and reach good agreement with the results obtained on single graph instances by the belief propagation-guided decimation algorithm. Taking together, this paper presents a systematic theoretical study on the energy landscape property of a spin glass system with global cycle constraints. read more

PDF Abstract
No code implementations yet. Submit your code now


Statistical Mechanics Disordered Systems and Neural Networks Physics and Society