相关论文: Reducing Frustration in Spin Systems: Social Balan…
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our variational scheme accurately reproduces the known replica…
We study the evolution of a social network with friendly/enmity connections into a balanced state by introducing a dynamical model with an intrinsic randomness, similar to Glauber dynamics in statistical mechanics. We include the…
Using elementary rigorous methods we prove the existence of a clustered phase in the random $K$-SAT problem, for $K\geq 8$. In this phase the solutions are grouped into clusters which are far away from each other. The results are in…
Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause…
Difference equations, such as a Ricker map, for an increased value of the parameter, experience instability of the positive equilibrium and transition to deterministic chaos. To achieve stabilization, various methods can be applied.…
The aim of this review paper is to give a panoramic of the impact of spin glass theory and statistical physics in the study of the K-sat problem. The introduction of spin glass theory in the study of the random K-sat problem has indeed left…
Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Contributing to the general understanding of the structure of…
We investigate the dependence of spin squeezing on the polar angle of the initial coherent spin state $|\theta_0, \phi_0>$ in a generalized one-axis twisting model, where the detuning $\delta$ is taken into account. We show explicitly that…
Random constraint satisfaction problems are interesting model systems for spin-glasses and glassy dynamics studies. As the constraint density of such a system reaches certain threshold value, its solution space may split into extremely many…
We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarity between different solutions found on the same problem…
Frustration is a ubiquitous phenomenon in many-body physics that influences the nature of the system in a profound way with exotic emergent behavior. Despite its long research history, the analytical or numerical investigations on…
In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that…
In this paper input-to-state practically stabilizing control laws for retarded, control-affine, nonlinear systems with actuator disturbance are investigated. The developed methodology is based on the Arstein's theory of control Liapunov…
Adaptively controlling and minimizing regret in unknown dynamical systems while controlling the growth of the system state is crucial in real-world applications. In this work, we study the problem of stabilization and regret minimization of…
Time-delayed control in a balancing problem may be a nonsmooth function for a variety of reasons. In this paper we study a simple model of the control of an inverted pendulum by either a connected movable cart or an applied torque for which…
Traditionally, the transverse spin-1/2 XY model is mapped to a fermionic "c-cycle" problem, where the prior periodic boundary condition is applied to the fermionic chain and the additional boundary term has been neglected. However, the…
We consider the totally asymmetric simple exclusion process on a ring with flat and step initial conditions. We assume that the size of the ring and the number of particles tend to infinity proportionally and evaluate the fluctuations of…
This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second part is a discussion of two…
We study the connection between the order of phase transitions in combinatorial problems and the complexity of decision algorithms for such problems. We rigorously show that, for a class of random constraint satisfaction problems, a limited…