Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model

DOI10.1088/1742-5468/AC3657OpenAlexW3215423215MaRDI QIDQ5020005FDOQ5020005

Authors: Maria Chiara Angelini, Paolo Fachin, Simone de Feo 

Publication date: 3 January 2022

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.05720

Recommendations

• Almost-Linear Planted Cliques Elude the Metropolis Process
• Parallel tempering for the planted clique problem
• The planted matching problem: phase transitions and exact results
• A new approach to the planted clique problem

zbMATH Keywords

statistical inferencemessage-passing algorithmsclassical Monte Carlo simulationsinference of graphical models

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Deep learning
• Title not available (Why is that?)
• Finding one community in a sparse graph
• Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
• Large Cliques Elude the Metropolis Process
• On colouring random graphs
• Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
• Parallel tempering for the planted clique problem

Cited In (2)

• Hopfield model with planted patterns: a teacher-student self-supervised learning model
• Sum-of-squares lower bounds for densest \(k\)-subgraph

This page was built for publication: Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model

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