Numerical simulations on the 4d Heisenberg spin glass

We study the 4d Heisenberg spin glass model with Gaussian nearest-neighbor interactions. We use finite size scaling to analyze the data. We find a behavior consistent with a finite temperature spin glass transition. Our estimates for the critical exponents agree with the results from epsilon-expansion.Comment: 11 pages, LaTeX, preprint ROMA1 n. 105

Small Window Overlaps Are Effective Probes of Replica Symmetry Breaking in 3D Spin Glasses

We compute numerically small window overlaps in the three dimensional Edwards Anderson spin glass. We show that they behave in the way implied by the Replica Symmetry Breaking Ansatz, that they do not qualitatively differ from the full volume overlap and do not tend to a trivial function when increasing the lattice volume. On the contrary we show they are affected by small finite volume effects, and are interesting tools for the study of the features of the spin glass phase.Comment: 9 pages plus 5 figure

Glue Ball Masses and the Chameleon Gauge

We introduce a new numerical technique to compute mass spectra, based on difference method and on a new gauge fixing procedure. We show that the method is very effective by test runs on a $SU(2)$ lattice gauge theory.Comment: latex format, 10 pages, 4 figures added in uufiles forma

The Fully Frustrated Hypercubic Model is Glassy and Aging at Large DD

We discuss the behavior of the fully frustrated hypercubic cell in the infinite dimensional mean-field limit. In the Ising case the system undergoes a glass transition, well described by the random orthogonal model. Under the glass temperature aging effects show clearly. In the $XY$ case there is no sign of a phase transition, and the system is always a paramagnet.Comment: Figures added in uufiles format, and epsf include

Langevin Equation for the Density of a System of Interacting Langevin Processes

We present a simple derivation of the stochastic equation obeyed by the density function for a system of Langevin processes interacting via a pairwise potential. The resulting equation is considerably different from the phenomenological equations usually used to describe the dynamics of non conserved (Model A) and conserved (Model B) particle systems. The major feature is that the spatial white noise for this system appears not additively but multiplicatively. This simply expresses the fact that the density cannot fluctuate in regions devoid of particles. The steady state for the density function may however still be recovered formally as a functional integral over the coursed grained free energy of the system as in Models A and B.Comment: 6 pages, latex, no figure

Finding long cycles in graphs

We analyze the problem of discovering long cycles inside a graph. We propose and test two algorithms for this task. The first one is based on recent advances in statistical mechanics and relies on a message passing procedure. The second follows a more standard Monte Carlo Markov Chain strategy. Special attention is devoted to Hamiltonian cycles of (non-regular) random graphs of minimal connectivity equal to three

Large-scale Monte Carlo simulations of the isotropic three-dimensional Heisenberg spin glass

We study the Heisenberg spin glass by large-scale Monte Carlo simulations for sizes up to 32^3, down to temperatures below the transition temperature claimed in earlier work. The data for the larger sizes show more marginal behavior than that for the smaller sizes, indicating the lower critical dimension is close to, and possibly equal to three. We find that the spins and chiralities behave in a quite similar manner.Comment: 8 pages, 8 figures. Replaced with published versio

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.Comment: 7 pages, 3 figures, minor corrections, accepted versio

On the Phase Structure of the 3D Edwards Anderson Spin Glass

We characterize numerically the properties of the phase transition of the three dimensional Ising spin glass with Gaussian couplings and of the low temperature phase. We compute critical exponents on large lattices. We study in detail the overlap probability distribution and the equilibrium overlap-overlap correlation functions. We find a clear agreement with off-equilibrium results from previous work. These results strongly support the existence of a continuous spontaneous replica symmetry breaking in three dimensional spin glasses.Comment: 30 pages and 17 figures. Final version to be published in PR

Monte Carlo study of the two-dimensional site-diluted dipolar Ising model

By tempered Monte Carlo simulations, we study 2D site-diluted dipolar Ising systems. Dipoles are randomly placed on a fraction x of all L^2 sites in a square lattice, and point along a common crystalline axis. For x_c< x<=1, where x_c = 0.79(5), we find an antiferromagnetic phase below a temperature which vanishes as x approaches x_c from above. At lower values of x, we study (i) distributions of the spin--glass (SG) overlap q, (ii) their relative mean square deviation Delta_q^2 and kurtosis and (iii) xi_L/L, where xi_L is a SG correlation length. From their variation with temperature and system size, we find that the paramagnetic phase covers the entire T>0 range. Our results enable us to obtain an estimate of the critical exponent associated to the correlation length at T=0, 1/nu=0.35(10).Comment: 10 LaTeX pages, 10 figures, 1 table