The following pages link to Charilaos Efthymiou (Q708224):
Displayed 24 items.
- Sharp thresholds for Hamiltonicity in random intersection graphs (Q708225) (← links)
- Local convergence of random graph colorings (Q722328) (← links)
- On the chromatic number of random regular graphs (Q896008) (← links)
- Random sampling of colourings of sparse random graphs with a constant number of colours (Q954987) (← links)
- Charting the replica symmetric phase (Q1749356) (← links)
- Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold (Q2921423) (← links)
- On independent sets in random graphs (Q3452727) (← links)
- Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
- Sampling Random Colorings of Sparse Random Graphs (Q4608004) (← links)
- Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model (Q4634031) (← links)
- Deterministic counting of graph colourings using sequences of subgraphs (Q4993106) (← links)
- Charting the replica symmetric phase (Q5002643) (← links)
- (Q5351931) (← links)
- (Q5351933) (← links)
- Planting Colourings Silently (Q5366948) (← links)
- MCMC sampling colourings and independent sets of <i>G</i>(<i>n, d</i>/<i>n</i>) near uniqueness threshold (Q5383981) (← links)
- A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold (Q5506696) (← links)
- Automata, Languages and Programming (Q5716819) (← links)
- (Q5743398) (← links)
- (Q5875505) (← links)
- Broadcasting colourings on trees. A combinatorial view (Q6233722) (← links)
- Spectral Independence Beyond Uniqueness using the topological method (Q6416427) (← links)
- On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n) (Q6426278) (← links)
- Broadcasting with Random Matrices (Q6427326) (← links)