Searcharxiv⌕ Search

arXiv subjects

Federico Ricci-Tersenghi

Publications and source records attributed to Federico Ricci-Tersenghi.

At least 109 records · Page 6Linked to original sources

Pseudolikelihood Decimation Algorithm Improving the Inference of the Interaction Network in a General Class of Ising Models

In this Letter we propose a new method to infer the topology of the interaction network in pairwise models with Ising variables. By using the pseudolikelihood method (PLM) at high temperature, it is generally possible to distinguish between zero and nonzero couplings because a clear gap separate the two groups. However at lower temperatures the PLM is much less effective and the result depends on subjective choices, such as the value of the $\ell_1$ regularizer and that of the threshold to separate nonzero couplings from null ones. We introduce a decimation procedure based on the PLM that recursively sets to zero the less significant couplings, until the variation of the pseudolikelihood signals that relevant couplings are being removed. The new method is fully automated and does not require any subjective choice by the user. Numerical tests have been performed on a wide class of Ising models, having different topologies (from random graphs to finite dimensional lattices) and different couplings (both diluted ferromagnets in a field and spin glasses). These numerical results show that the new algorithm performs better than standard PLM

cond-mat.dis-nn↗

Relations between Short Range and Long Range Ising models

We perform a numerical study of the long range (LR) ferromagnetic Ising model with power law decaying interactions ($J \propto r^{-d-σ}$) both on a one-dimensional chain ($d=1$) and on a square lattice ($d=2$). We use advanced cluster algorithms to avoid the critical slowing down. We first check the validity of the relation connecting the critical behavior of the LR model with parameters $(d,σ)$ to that of a short range (SR) model in an equivalent dimension $D$. We then study the critical behavior of the $d=2$ LR model close to the lower critical $σ$, uncovering that the spatial correlation function decays with two different power laws: the effect of the subdominant power law is much stronger than finite size effects and actually makes the estimate of critical exponents very subtle. By including this subdominant power law, the numerical data are consistent with the standard renormalization group (RG) prediction by Sak, thus making not necessary (and unlikely, according to Occam's razor) the recent proposal by Picco of having a new set of RG fixed points, in addition to the mean-field one and the SR one.

cond-mat.stat-mech↗

Spatial correlation functions and dynamical exponents in very large samples of 4D spin glasses

The study of the low temperature phase of spin glass models by means of Monte Carlo simulations is a challenging task, because of the very slow dynamics and the severe finite size effects they show. By exploiting at the best the capabilities of standard modern CPUs (especially the SSE instructions), we have been able to simulate the four-dimensional (4D) Edwards-Anderson model with Gaussian couplings up to sizes $L=70$ and for times long enough to accurately measure the asymptotic behavior. By quenching systems of different sizes to the the critical temperature and to temperatures in the whole low temperature phase, we have been able to identify the regime where finite size effects are negligible: $ξ(t) \lesssim L/7$. Our estimates for the dynamical exponent ($z \simeq 1/T$) and for the replicon exponent ($α\simeq 1.0$ and $T$-independent), that controls the decay of the spatial correlation in the zero-overlap sector, are consistent with the RSB theory, but the latter differs from the theoretically conjectured value.

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↗

Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem

We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reaction networks. First, we show that the CSPs generalize the scheme known as Network Expansion, which is recovered in a specific limit. Next, a full statistical mechanics characterization (including the phase diagram and a discussion of physical origin of the phase transitions) for Network Expansion is obtained. Finally, we provide a message-passing algorithm to solve the original CSPs in the most general form.

q-bio.MN↗

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↗

Ensemble renormalization group for disordered systems

We propose and study a renormalization group transformation that can be used also for models with strong quenched disorder, like spin glasses. The method is based on a mapping between disorder distributions, chosen such as to keep some physical properties (e.g., the ratio of correlations averaged over the ensemble) invariant under the transformation. We validate this ensemble renormalization group by applying it to the hierarchical model (both the diluted ferromagnetic version and the spin glass version), finding results in agreement with Monte Carlo simulations.

cond-mat.dis-nn↗

A mean field method with correlations determined by linear response

We introduce a new mean-field approximation based on the reconciliation of maximum entropy and linear response for correlations in the cluster variation method. Within a general formalism that includes previous mean-field methods, we derive formulas improving upon, e.g., the Bethe approximation and the Sessak-Monasson result at high temperature. Applying the method to direct and inverse Ising problems, we find improvements over standard implementations.

cond-mat.stat-mech↗

Compressed sensing with sparse, structured matrices

In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a ρ0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the original signal, compressed at a rate α, by using a message passing algorithm (Expectation Maximization Belief Propagation) that runs in a time linear in N. In the large N limit, the scheme proposed here closely approaches the theoretical bound ρ0 = α, and so it is both optimal and efficient (linear time complexity). More generally, we show that several ensembles of dense random matrices can be converted into ensembles of sparse random matrices, having the same thresholds, but much lower computational complexity.

cs.IT↗

Correcting beliefs in the mean-field and Bethe approximations using linear response

Approximating marginals of a graphical model is one of the fundamental problems in the theory of networks. In a recent paper a method was shown to construct a variational free energy such that the linear response estimates, and maximum entropy estimates (for beliefs) are in agreement, with implications for direct and inverse Ising problems[1]. In this paper we demonstrate an extension of that method, incorporating new information from the response matrix, and we recover the adaptive-TAP equations as the first order approximation[2]. The method is flexible with respect to applications of the cluster variational method, special cases of this method include Naive Mean Field (NMF) and Bethe. We demonstrate that the new framework improves estimation of marginals by orders of magnitude over standard implementations in the weak coupling limit. Beyond the weakly coupled regime we show there is an improvement in a model where the NMF and Bethe approximations are known to be poor for reasons of frustration and short loops.

cond-mat.dis-nn↗

Glassy Critical Points and Random Field Ising Model

We consider the critical properties of points of continuous glass transition as one can find in liquids in presence of constraints or in liquids in porous media. Through a one loop analysis we show that the critical Replica Field Theory describing these points can be mapped in the $ϕ^4$-Random Field Ising Model. We confirm our analysis studying the finite size scaling of the $p$-spin model defined on sparse random graph, where a fraction of variables is frozen such that the phase transition is of a continuous kind.

cond-mat.stat-mech↗

A note on weakly discontinuous dynamical transitions

We analyze Mode Coupling discontinuous transition in the limit of vanishing discontinuity, approaching the so called "$A_3$" point. In these conditions structural relaxation and fluctuations appear to have universal form independent from the details of the system. The analysis of this limiting case suggests new ways for looking at the Mode Coupling equations in the general case.

cond-mat.stat-mech↗

Replica Cluster Variational Method: the Replica Symmetric solution for the 2D random bond Ising model

We present and solve the Replica Symmetric equations in the context of the Replica Cluster Variational Method for the 2D random bond Ising model (including the 2D Edwards-Anderson spin glass model). First we solve a linearized version of these equations to obtain the phase diagrams of the model on the square and triangular lattices. In both cases the spin-glass transition temperatures and the tricritical point estimations improve largely over the Bethe predictions. Moreover, we show that this phase diagram is consistent with the behavior of inference algorithms on single instances of the problem. Finally, we present a method to consistently find approximate solutions to the equations in the glassy phase. The method is applied to the triangular lattice down to T=0, also in the presence of an external field.

cond-mat.dis-nn↗

The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods

The inverse Ising problem consists in inferring the coupling constants of an Ising model given the correlation matrix. The fastest methods for solving this problem are based on mean-field approximations, but which one performs better in the general case is still not completely clear. In the first part of this work, I summarize the formulas for several mean- field approximations and I derive new analytical expressions for the Bethe approximation, which allow to solve the inverse Ising problem without running the Susceptibility Propagation algorithm (thus avoiding the lack of convergence). In the second part, I compare the accuracy of different mean field approximations on several models (diluted ferromagnets and spin glasses) defined on random graphs and regular lattices, showing which one is in general more effective. A simple improvement over these approximations is proposed. Also a fundamental limitation is found in using methods based on TAP and Bethe approximations in presence of an external field.

cond-mat.dis-nn↗

Field Theory of Fluctuations in Glasses

We develop a field-theoretical description of dynamical heterogeneities and fluctuations in supercooled liquids close to the (avoided) MCT singularity. Using quasi-equilibrium arguments we eliminate time from the description and we completely characterize fluctuations in the beta regime. We identify different sources of fluctuations and show that the most relevant ones are associated to variations of "self-induced disorder" in the initial condition of the dynamics. It follows that heterogeneites can be describes through a cubic field theory with an effective random field term. The phenomenon of perturbative dimensional reduction ensues, well known in random field problems, which implies an upper critical dimension of the theory equal to 8. We apply our theory to finite size scaling for mean-field systems and we test its prediction against numerical simulations.

cond-mat.stat-mech↗

A numerical study of the overlap probability distribution and its sample-to-sample fluctuations in a mean-field model

In this paper we study the fluctuations of the probability distributions of the overlap in mean field spin glasses in the presence of a magnetic field on the De Almeida-Thouless line. We find that there is a large tail in the left part of the distribution that is dominated by the contributions of rare samples. Different techniques are used to examine the data and to stress on different aspects of the contribution of rare samples.

cond-mat.dis-nn↗

Replica Field Theory of the Dynamical Transition in Glassy Systems

The critical behaviour of the dynamical transition of glassy system is controlled by a Replica Symmetric action with n=1 replicas. The most divergent diagrams in the loop expansion correspond at all orders to the solutions of a stochastic equation leading to perturbative dimensional reduction. The theory describe accurately numerical simulations of mean-field models.

cond-mat.stat-mech↗