Charilaos Efthymiou

activity

20082026

most citedOn independent sets in random graphs

52 citations · 130 across the 20 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

cs.DM2016

A simple algorithm for sampling colourings of $G (n, d / n)$ up to Gibbs Uniqueness Threshold

Charilaos Efthymiou

Approximate random $k$ -colouring of a graph $G$ is a well studied problem in computer science and statistical physics. It amounts to constructing a $k$ -colouring of $G$ which is di…

cs.DM2016★ 5 cited

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic +2

We study the hard-core model defined on independent sets of an input graph where the independent sets are weighted by a parameter $λ > 0$ . For constant $Δ$ , previous work of Weitz (2…

A simple algorithm for sampling colourings of G(n,d/n) up to Gibbs Uniqueness Threshold

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

A simple algorithm for sampling colourings of $G (n, d / n)$ up to Gibbs Uniqueness Threshold