On the number of circuits in random graphs
Enzo Marinari, Guilhem Semerjian
Abstract
We apply in this article (non rigorous) statistical mechanics methods to the problem of counting long circuits in graphs. The outcomes of this approach have two complementary flavours. On the algorithmic side, we propose an approximate counting procedure, valid in principle for a large class of graphs. On a more theoretical side, we study the typical number of long circuits in random graph ensembles, reproducing rigorously known results and stating new conjectures.
Create a lesson
Related papers
Long-time Dynamics of Many-body Open Quantum Systems using Quantum Generating Functions
Katha Ganguly, Dario Poletti, Bijay Kumar Agarwalla
Localization Delocalization Transition in Diffusion with Adaptive Resetting
Tommer D. Keidar, Shlomi Reuveni
Quenched activity induces nonuniversal scaling in nonreciprocal XY Models and surfaces
Sudip Mukherjee, Abhik Basu
Brownian yet non-Gaussian diffusion through equilibrium nonlinear friction
Jakob Mihatsch, Andreas M. Menzel
When dissipative steady states admit thermodynamic occupation laws
Tetsu Ichitsubo
Fluctuation--response relations from an emergent Z2 symmetry in the rotating stochastic Landau model
Dhruv Kush, Nicki Mullins, Mauricio Hippert et al.