Related papers: Phase coexistence and finite-size scaling in rando…
Measures of concordance have been widely used in insurance and risk management to summarize non-linear dependence among risks modeled by random variables, which Pearson's correlation coefficient cannot capture. However, popular measures of…
Finite-size corrections to the energy levels of the asymmetric six-vertex model transfer matrix are considered using the Bethe ansatz solution for the critical region. The non-universal complex anisotropy factor is related to the bulk…
In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance…
Many NP-complete constraint satisfaction problems appear to undergo a "phase transition'' from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds…
We study nondeterministic and probabilistic versions of a discrete dynamical system (due to T. Antal, P. L. Krapivsky, and S. Redner) inspired by Heider's social balance theory. We investigate the convergence time of this dynamics on…
We investigate the processes of synchronization and phase ordering in a system of globally coupled maps possessing bistable, chaotic local dynamics. The stability boundaries of the synchronized states are determined on the space of…
We present efficient counting and sampling algorithms for random $k$-SAT when the clause density satisfies $\alpha \le \frac{2^k}{\mathrm{poly}(k)}.$ In particular, the exponential term $2^k$ matches the satisfiability threshold…
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in…
Along the line of thoughts of Berry and Robnik{\cite{Ber}}, the limiting gap distribution function of classically integrable quantum systems is derived in the limit of infinitely many independent components. The limiting gap distribution…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
We study linear chance-constrained problems where the coefficients follow a Gaussian mixture distribution. We provide mixed-binary quadratic programs that give inner and outer approximations of the chance constraint based on piecewise…
Stochastic processes wherein the size of the state space is changing as a function of time offer models for the emergence of scale-invariant features observed in complex systems. I consider such a sample-space reducing (SSR) stochastic…
We study the low temperature properties of p-spin glass models with finite connectivity and of some optimization problems. Using a one-step functional replica symmetry breaking Ansatz we can solve exactly the saddle-point equations for…
The optimal matching of point clouds in $\mathbb{R}^d$ is a combinatorial problem; applications in statistics motivate to consider random point clouds, like the Poisson point process. There is a crucial dependance on dimension $d$, with…
Monte Carlo sampling of any system may be analyzed in terms of an associated glass model -- a variant of the Random Energy Model -- with, whenever there is a sign problem, complex fields. This model has three types of phases (liquid, frozen…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
The problem of counting the number of models of a given Boolean formula has numerous applications, including computing the leakage of deterministic programs in Quantitative Information Flow. Model counting is a hard, #P-complete problem.…
$ \newcommand{\eps}{\epsilon} \newcommand{\NP}{\mathsf{NP}} \newcommand{\YES}{\mathsf{YES}} \newcommand{\NO}{\mathsf{NO}} \newcommand{\myminus}{\text{-}}\newcommand{\Bsat}{{\mathsf{B}}} \newcommand{\threesat}{\rm{3}\myminus\mathsf{SAT}}…