On Mixing in Pairwise Markov Random Fields with Application to Social Networks

November 28, 2016 ยท The Ethereal ยท ๐Ÿ› Workshop on Algorithms and Models for the Web-Graph

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Konstantin Avrachenkov, Lenar Iskhakov, Maksim Mironov arXiv ID 1611.09189 Category cs.DM: Discrete Mathematics Cross-listed cs.SI Citations 1 Venue Workshop on Algorithms and Models for the Web-Graph Last Checked 5 months ago
Abstract
We consider pairwise Markov random fields which have a number of important applications in statistical physics, image processing and machine learning such as Ising model and labeling problem to name a couple. Our own motivation comes from the need to produce synthetic models for social networks with attributes. First, we give conditions for rapid mixing of the associated Glauber dynamics and consider interesting particular cases. Then, for pairwise Markov random fields with submodular energy functions we construct monotone perfect simulation.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Discrete Mathematics