arXiv subjects

Guilhem Semerjian

Publications and source records attributed to Guilhem Semerjian.

47 records · Page 3Linked to original sources

arXiv2006

An algorithm for counting circuits: application to real-world and random graphs

We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to real-world networks, it allows to estimate exponentially large numbers of circuits in polynomial time. We illustrate the method by studying a graph of the Internet structure.

cond-mat.stat-mech↗

arXiv2005

On the dynamics of the glass transition on Bethe lattices

The Glauber dynamics of disordered spin models with multi-spin interactions on sparse random graphs (Bethe lattices) is investigated. Such models undergo a dynamical glass transition upon decreasing the temperature or increasing the degree of constrainedness. Our analysis is based upon a detailed study of large scale rearrangements which control the slow dynamics of the system close to the dynamical transition. Particular attention is devoted to the neighborhood of a zero temperature tricritical point. Both the approach and several key results are conjectured to be valid in a considerably more general context.

cond-mat.dis-nn↗

arXiv2005

From Large Scale Rearrangements to Mode Coupling Phenomenology

We consider the equilibrium dynamics of Ising spin models with multi-spin interactions on sparse random graphs (Bethe lattices). Such models undergo a mean field glass transition upon increasing the graph connectivity or lowering the temperature. Focusing on the low temperature limit, we identify the large scale rearrangements responsible for the dynamical slowing-down near the transition. We are able to characterize exactly the dynamics near criticality by analyzing the statistical properties of such rearrangements. Our approach can be generalized to a large variety of glassy models on sparse random graphs, ranging from satisfiability to kinetically constrained models.

cond-mat.stat-mech↗

arXiv2004

Diluted models in statistical mechanics: Out of equilibrium dynamics and optimization algorithms

This thesis is devoted to the study of dynamical properties of diluted models. These are mean field statistical mechanics systems, but with finite local connectivity. Among other reasons, the interest for these models arises from their deep relationship with combinatorial optimization problems, random $K$-satisfiability for instance. Several analytical descriptions of their out of equilibrium regime are described. This regime can be due to long relaxation times in glassy phases, lack of detailed balance condition for optimization algorithms, or transient relaxation from an arbitrary initial condition for ferromagnets. In the course of these studies some attention will also be given to random matrix theory, and to a generalization of fluctuation-dissipation theorem for $n$-times functions.

cond-mat.dis-nn↗

arXiv2004

Approximation schemes for the dynamics of diluted spin models: the Ising ferromagnet on a Bethe lattice

We discuss analytical approximation schemes for the dynamics of diluted spin models. The original dynamics of the complete set of degrees of freedom is replaced by a hierarchy of equations including an increasing number of global observables, which can be closed approximately at different levels of the hierarchy. We illustrate this method on the simple example of the Ising ferromagnet on a Bethe lattice, investigating the first three possible closures, which are all exact in the long time limit, and which yield more and more accurate predictions for the finite-time behavior. We also investigate the critical region around the phase transition, and the behavior of two-time correlation functions. We finally underline the close relationship between this approach and the dynamical replica theory under the assumption of replica symmetry.

cond-mat.stat-mech↗

arXiv2003

Dynamics of dilute disordered models: a solvable case

We study the dynamics of a dilute spherical model with two body interactions and random exchanges. We analyze the Langevin equations and we introduce a functional variational method to study generic dilute disordered models. A crossover temperature replaces the dynamic transition of the fully-connected limit. There are two asymptotic regimes, one determined by the central band of the spectral density of the interactions and a slower one determined by localized configurations on sites with high connectivity. We confront the behavior of this model to the one of real glasses.

cond-mat↗

arXiv2003

On the stochastic dynamics of disordered spin models

In this article we discuss several aspects of the stochastic dynamics of spin models. The paper has two independent parts. Firstly, we explore a few properties of the multi-point correlations and responses of generic systems evolving in equilibrium with a thermal bath. We propose a fluctuation principle that allows us to derive fluctuation-dissipation relations for many-time correlations and linear responses. We also speculate on how these features will be modified in systems evolving slowly out of equilibrium, as finite-dimensional or dilute spin-glasses. Secondly, we present a formalism that allows one to derive a series of approximated equations that determine the dynamics of disordered spin models on random (hyper) graphs.

cond-mat.stat-mech↗

arXiv2003

Approximate analysis of search algorithms with "physical" methods

An overview of some methods of statistical physics applied to the analysis of algorithms for optimization problems (satisfiability of Boolean constraints, vertex cover of graphs, decoding, ...) with distributions of random inputs is proposed. Two types of algorithms are analyzed: complete procedures with backtracking (Davis-Putnam-Loveland-Logeman algorithm) and incomplete, local search procedures (gradient descent, random walksat, ...). The study of complete algorithms makes use of physical concepts such as phase transitions, dynamical renormalization flow, growth processes, ... As for local search procedures, the connection between computational complexity and the structure of the cost function landscape is questioned, with emphasis on the notion of metastability.

cs.CC↗

arXiv2003

Relaxation and Metastability in the RandomWalkSAT search procedure

An analysis of the average properties of a local search resolution procedure for the satisfaction of random Boolean constraints is presented. Depending on the ratio alpha of constraints per variable, resolution takes a time T_res growing linearly (T_res \sim tau(alpha) N, alpha < alpha_d) or exponentially (T_res \sim exp(N zeta(alpha)), alpha > alpha_d) with the size N of the instance. The relaxation time tau(alpha) in the linear phase is calculated through a systematic expansion scheme based on a quantum formulation of the evolution operator. For alpha > alpha_d, the system is trapped in some metastable state, and resolution occurs from escape from this state through crossing of a large barrier. An annealed calculation of the height zeta(alpha) of this barrier is proposed. The polynomial/exponentiel cross-over alpha_d is not related to the onset of clustering among solutions.

cond-mat↗

arXiv2002

Sparse random matrices: the eigenvalue spectrum revisited

We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum.

cond-mat↗

arXiv2001

Cluster expansions in dilute systems: applications to satisfiability problems and spin glasses

We develop a systematic cluster expansion for dilute systems in the highly dilute phase. We first apply it to the calculation of the entropy of the K-satisfiability problem in the satisfiable phase. We derive a series expansion in the control parameter, the average connectivity, that is identical to the one obtained by using the replica approach with a replica symmetric ({\sc rs}) {\it Ansatz}, when the order parameter is calculated via a perturbative expansion in the control parameter. As a second application we compute the free-energy of the Viana-Bray model in the paramagnetic phase. The cluster expansion allows one to compute finite-size corrections in a simple manner and these are particularly important in optimization problems. Importantly enough, these calculations prove the exactness of the {\sc rs} {\it Ansatz} below the percolation threshold and might require its revision between this and the easy-to-hard transition.

cond-mat.stat-mech↗