AI Chat AI Image Generator AI Video Text to Speech

Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search

07/04/2022

∙

by Milo Roucairol, et al.

∙

∙

We demonstrate how Monte Carlo Search (MCS) algorithms, namely Nested Monte Carlo Search (NMCS) and Nested Rollout Policy Adaptation (NRPA), can be used to build graphs and find counter-examples to spectral graph theory conjectures in minutes. We also refute a conjecture attributed to Peter Shor that was left open.

Milo Roucairol
2 publications
Tristan Cazenave
27 publications

page 1

page 2

page 3

page 4

research

∙ 05/20/2020

Monte Carlo Inverse Folding

The RNA Inverse Folding problem comes from computational biology. The go...

0 Tristan Cazenave, et al. ∙

research

∙ 06/13/2023

Adaptive Monte Carlo Search for Conjecture Refutation in Graph Theory

Graph theory is an interdisciplinary field of study that has various app...

0 Valentino Vito, et al. ∙

research

∙ 01/23/2023

Solving the HP model with Nested Monte Carlo Search

In this paper we present a new Monte Carlo Search (MCS) algorithm for fi...

0 Milo Roucairol, et al. ∙

research

∙ 02/26/2023

Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search

Recent work proposed the UCTMAXSAT algorithm to address Maximum Satisfia...

0 Hui Wang, et al. ∙

research

∙ 03/22/2020

Generalized Nested Rollout Policy Adaptation

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorith...

0 Tristan Cazenave, et al. ∙

research

∙ 11/20/2019

Automatic Differentiable Monte Carlo: Theory and Application

Differentiable programming has emerged as a key programming paradigm emp...

0 Shi-Xin Zhang, et al. ∙

research

∙ 04/03/2019

Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs

The effectiveness of stochastic algorithms based on Monte Carlo dynamics...

0 Maria Chiara Angelini, et al. ∙