Related papers: Finite-size scaling, phase coexistence, and algori…
The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model…
Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…
We report numerical simulations of two-dimensional $q$-state Potts models with emphasis on a new quantity for the computation of spatial correlation lengths. This quantity is the cluster-diameter distribution function $G_{diam}(x)$, which…
Brooks' theorem states that all connected graphs but odd cycles and cliques can be colored with $\Delta$ colors, where $\Delta$ is the maximum degree of the graph. Such colorings have been shown to admit non-trivial distributed algorithms…
Linked cluster expansions are generalized from an infinite to a finite volume. They are performed to 20th order in the expansion parameter to approach the critical region from the symmetric phase. A new criterion is proposed to distinguish…
We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method of the physicists. We also discuss the properties of the phase…
We propose a scaling ansatz for the elastic energy of a system near the critical jamming transition in terms of three relevant fields: the compressive strain $\Delta \phi$ relative to the critical jammed state, the shear strain $\epsilon$,…
We study the critical behavior of the random q-state Potts model in the large-q limit on the diamond hierarchical lattice with an effective dimensionality $d_{\rm eff} > 2$. By varying the temperature and the strength of the frustration the…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
The probability distribution of sums of iterates of the logistic map at the edge of chaos has been recently shown [see U. Tirnakli, C. Beck and C. Tsallis, Phys. Rev. E 75, 040106(R) (2007)] to be numerically consistent with a q-Gaussian,…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
Analyzing in detail the first corrections to the scaling hypothesis, we develop accelerated methods for the determination of critical points from finite size data. The output of these procedures are sequences of pseudo-critical points which…
We study a strongly correlated fermionic model with attractive interactions in the presence of disorder in two spatial dimensions. Our model has been designed so that it can be solved using the recently discovered meron-cluster approach.…
A new extension of the attractive Hubbard model is constructed to study the critical behavior near a finite temperature superconducting phase transition in two dimensions using the recently developed meron-cluster algorithm. Unlike previous…
We investigate by means of Monte Carlo simulations the fully connected p-state Potts model for different system sizes in order to see how the static and dynamic properties of a finite model compare with the, exactly known, behavior of the…
We consider the Kuramoto model on sparse random networks such as the Erd\H{o}s-R\'enyi graph or its combination with a regular two-dimensional lattice and study the dynamical scaling behavior of the model at the synchronization transition…
Anomalous coarsening in far-from equilibrium one-dimensional systems is investigated by simulation and analytic techniques. The minimal hard core particle (exclusion) models contain mechanisms of aggregated particle diffusion, with rates…
We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…
A road map to understand the relation between the onset of the superconducting state with the particular optimum heterogeneity in granular superconductors is to study a Random Tranverse Ising Model on complex networks with a scale-free…
Motivated by applications, the last few years have witnessed tremendous interest in understanding the structure as well as the behavior of dynamics for inhomogeneous random graph models. In this study we analyze the maximal components at…