Related papers: Finite-size scaling in random $K$-satisfiability p…
Linear-scaling implementations of density functional theory (DFT) reach their intended efficiency regime only when applied to systems having a physical size larger than the range of their Kohn-Sham density matrix (DM). This causes a problem…
We study the dynamics of systems with different time scales, when access only to the slow variables is allowed. We use the concept of Finite Size Lyapunov Exponent (FSLE) and consider both the case when the equations of motion for the slow…
Extensive Monte Carlo simulation results of the standard two-dimensional driven diffusive systems are obtained using a multispin coding technique. The nonequilibrium phase transition is analyzed with anisotropic finite-size scaling, both at…
The Kibble-Zurek (KZ) mechanism has been applied to a variety of systems ranging from low temperature Bose-Einstein condensations to grand unification scales in particle physics and cosmology and from classical phase transitions to quantum…
Linear-scaling techniques for Kohn-Sham density functional theory (KS-DFT) are essential to describe the ground state properties of extended systems. Still, these techniques often rely on the locality of the density matrix or on accurate…
Long-range interacting systems, while relaxing towards equilibrium, may get trapped in nonequilibrium quasistationary states (QSS) for a time which diverges algebraically with the system size. These intriguing non-Boltzmann states have been…
The nature of statistics, statistical mechanics and consequently the thermodynamics of stochastic systems is largely determined by how the number of states $W(N)$ depends on the size $N$ of the system. Here we propose a scaling expansion of…
We analyze the problem of supervised learning of ferromagnetic phase transitions from the statistical physics perspective. We consider two systems in two universality classes, the two-dimensional Ising model and two-dimensional Baxter-Wu…
The relaxed and unrelaxed formation energies of neutral antisites and interstitial defects in InP are calculated using ab initio density functional theory and simple cubic supercells of up to 512 atoms. The finite size errors in the…
We consider analytically as well as numerically the finite-size scaling behavior in the stationary state near the non-equilibrium phase transition of directed percolation within the mean field regime, i.e., above the upper critical…
We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…
We consider a noninteracting disordered system designed to model particle diffusion, relaxation in glasses, and impurity bands of semiconductors. Disorder originates in the random spatial distribution of sites. We find strong numerical…
We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution…
We study an exactly solvable version of the famous random Boolean satisfiability problem, the so called random XOR-SAT problem. Rare events are shown to affect the combinatorial ``phase diagram'' leading to a coexistence of solvable and…
Models with a nonequilibrium wetting transition display a transition also in finite systems. This is different from nonequilibrium phase transitions into an absorbing state, where the stationary state is the absorbing one for any value of…
Real-world physical signals are continuous and high-dimensional, yet the statistical-mechanics machinery of associative memory operates on discrete Ising spins. We bridge this divide through a multilayer Ising framework that couples a…
Advanced chain-growth computer simulation methodologies have been employed for a systematic statistical analysis of the critical behavior of a polymer adsorbing at a substrate. We use finitesize scaling techniques to investigate the…
The typical complexity of Constraint Satisfaction Problems (CSPs) can be investigated by means of random ensembles of instances. The latter exhibit many threshold phenomena besides their satisfiability phase transition, in particular a…
It is well known that the self-consistent field (SCF) iteration for solving the Kohn-Sham (KS) equation often fails to converge, yet there is no clear explanation. In this paper, we investigate the SCF iteration from the perspective of…
The paper introduces a novel algorithm for computing the output admissible set of linear discrete-time systems subject to input saturation. The proposed method takes advantage of the piecewise-affine dynamics to propagate the output…