Charilaos Efthymiou

From MaRDI portal
Person:708224

Available identifiers

zbMath Open efthymiou.charilaosMaRDI QIDQ708224

List of research outcomes





PublicationDate of PublicationType
Optimal mixing via tensorization for random independent sets on arbitrary trees2025-01-14Paper
On the mixing time of Glauber dynamics for the hard-core and related models on \(G(n,d/n)\)2024-11-14Paper
Broadcasting with random matrices2024-11-14Paper
On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs2024-06-24Paper
Broadcasting with Random Matrices2023-02-22Paper
On the Mixing Time of Glauber Dynamics for the Hard-core and Related Models on G(n,d/n)2023-02-13Paper
https://portal.mardi4nfdi.de/entity/Q58755052023-02-03Paper
Spectral Independence Beyond Uniqueness using the topological method2022-11-07Paper
Charting the replica symmetric phase2021-07-28Paper
Deterministic counting of graph colourings using sequences of subgraphs2021-06-15Paper
MCMC sampling colourings and independent sets of \(G(n, d/n)\) near uniqueness threshold2019-06-20Paper
A simple algorithm for random colouring \(G(n, d/n)\) using \((2 + \epsilon)d\) colours2019-05-10Paper
Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model2019-05-07Paper
Local convergence of random graph colorings2018-07-23Paper
Charting the replica symmetric phase2018-05-16Paper
Sampling random colorings of sparse random graphs2018-03-15Paper
Planting colourings silently2017-10-10Paper
On independent sets in random graphs2017-09-29Paper
Reconstruction/non-reconstruction thresholds for colourings of general Galton-Watson trees2017-08-31Paper
Local convergence of random graph colorings2017-08-31Paper
A Simple Algorithm for Sampling Colorings of $G(n,d/n)$ Up to The Gibbs Uniqueness Threshold2016-12-13Paper
Random instances of problems in NP -- algorithms and statistical physics2016-01-27Paper
On the chromatic number of random regular graphs2015-12-11Paper
On independent sets in random graphs2015-11-13Paper
Switching colouring of \(G(n,d/n)\) for sampling up to Gibbs uniqueness threshold2014-10-08Paper
Broadcasting colourings on trees. A combinatorial view2012-06-15Paper
Sharp thresholds for Hamiltonicity in random intersection graphs2010-10-11Paper
Random sampling of colourings of sparse random graphs with a constant number of colours2008-11-18Paper
Automata, Languages and Programming2006-01-10Paper
On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphsN/APaper
On sampling diluted Spin Glasses using Glauber dynamicsN/APaper

Research outcomes over time

This page was built for person: Charilaos Efthymiou