SearcharxivSearch

arXiv subjects

F. Unguendoli

Publications and source records attributed to F. Unguendoli.

4 recordsLinked to original sources

Interpolating Greedy and Reluctant Algorithms

In a standard NP-complete optimization problem we introduce an interpolating algorithm between the quick decrease along the gradient (greedy dynamics) and a slow decrease close to the level curves (reluctant dynamics). We find that for a fixed elapsed computer time the best performance of the optimization is reached at a special value of the interpolation parameter, considerably improving the results of the pure cases greedy and reluctant.

math-ph

Optimization Strategies in Complex Systems

We consider a class of combinatorial optimization problems that emerge in a variety of domains among which: condensed matter physics, theory of financial risks, error correcting codes in information transmissions, molecular and protein conformation, image restoration. We show the performances of two algorithms, the``greedy'' (quick decrease along the gradient) and the``reluctant'' (slow decrease close to the level curves) as well as those of a``stochastic convex interpolation''of the two. Concepts like the average relaxation time and the wideness of the attraction basin are analyzed and their system size dependence illustrated.

math.NA

Deterministic spin models with a glassy phase transition

We consider the infinite-range deterministic spin models with Hamiltonian $H=\sum_{i,j=1}^N J_{i,j}σ_iσ_j$, where $J$ is the quantization of a chaotic map of the torus. The mean field (TAP) equations are derived by summing the high temperature expansion. They predict a glassy phase transition at the critical temperature $T\sim 0.8$.

cond-mat

Ground states for a class of deterministic spin models with glassy behaviour

We consider the deterministic model with glassy behaviour, recently introduced by Marinari, Parisi and Ritort, with \ha\ $H=\sum_{i,j=1}^N J_{i,j}σ_iσ_j$, where $J$ is the discrete sine Fourier transform. The ground state found by these authors for $N$ odd and $2N+1$ prime is shown to become asymptotically dege\-ne\-ra\-te when $2N+1$ is a product of odd primes, and to disappear for $N$ even. This last result is based on the explicit construction of a set of eigenvectors for $J$, obtained through its formal identity with the imaginary part of the propagator of the quantized unit symplectic matrix over the $2$-torus.

cond-mat