Gibbs measures and phase transitions on sparse random graphs

From MaRDI portal
(Redirected from Publication:985984)




Abstract: Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years, considerable progress has been achieved by viewing these distributions as Gibbs measures and applying to their study heuristic tools from statistical physics. We review this approach and provide some results towards a rigorous treatment of these problems.



Cites work


Cited in
(63)






This page was built for publication: Gibbs measures and phase transitions on sparse random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985984)