Searcharxiv⌕ Search

arXiv subjects

Carlo Lucibello

Publications and source records attributed to Carlo Lucibello.

41 records · Page 3Linked to original sources

One-dimensional disordered Ising models by replica and cavity methods

Using a formalism based on the spectral decomposition of the replicated transfer matrix for disordered Ising models, we obtain several results that apply both to isolated one-dimensional systems and to locally tree-like graph and factor graph (p-spin) ensembles. We present exact analytical expressions, which can be efficiently approximated numerically, for many types of correlation functions and for the average free energies of open and closed finite chains. All the results achieved, with the exception of those involving closed chains, are then rigorously derived without replicas, using a probabilistic approach with the same flavour of cavity method.

cond-mat.dis-nn↗

Finite size corrections to disordered Ising models on Random Regular Graphs

We derive the analytical expression for the first finite size correction to the average free energy of disordered Ising models on random regular graphs. The formula can be physically interpreted as a weighted sum over all non self-intersecting loops in the graph, the weight being the free-energy shift due to the addition of the loop to an infinite tree.

cond-mat.dis-nn↗

Anomalous finite size corrections in random field models

The presence of a random magnetic field in ferromagnetic systems leads, in the broken phase, to an anomalous $O(\sqrt{1/N})$ convergence of some thermodynamic quantities to their asymptotic limits. Here we show a general method, based on the replica trick, to compute analytically the $O(\sqrt{1/N})$ finite size correction to the average free energy. We apply this method to two mean field Ising models, fully connected and random regular graphs, and compare the results to exact numerical algorithms. We argue that this behaviour is present in finite dimensional models as well.

cond-mat.dis-nn↗

The statistical mechanics of random set packing and a generalization of the Karp-Sipser algorithm

We analyse the asymptotic behaviour of random instances of the Maximum Set Packing (MSP) optimization problem, also known as Maximum Matching or Maximum Strong Independent Set on Hypergraphs. We give an analytical prediction of the MSPs size using the 1RSB cavity method from statistical mechanics of disordered systems. We also propose a heuristic algorithm, a generalization of the celebrated Karp-Sipser one, which allows us to rigorously prove that the replica symmetric cavity method prediction is exact for certain problem ensembles and breaks down when a core survives the leaf removal process. The $e$-phenomena threshold discovered by Karp and Sipser, marking the onset of core emergence and of replica symmetry breaking, is elegantly generalized to $c_s = \frac{e}{d-1}$ for one of the ensembles considered, where $d$ is the size of the sets.

cond-mat.dis-nn↗

Finite size corrections to disordered systems on Erdös-Rényi random graphs

We study the finite size corrections to the free energy density in disorder spin systems on sparse random graphs, using both replica theory and cavity method. We derive an analytical expressions for the $O(1/N)$ corrections in the replica symmetric phase as a linear combination of the free energies of open and closed chains. We perform a numerical check of the formulae on the Random Field Ising Model at zero temperature, by computing finite size corrections to the ground state energy density.

cond-mat.dis-nn↗