Related papers: Computational Complexity of Avalanches in the Kada…
The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for over 4 decades. It has been clear that if an algorithm existed that would solve the problems in the NP class in…
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…
We use a discrete-time formulation to study the asymmetric avalanche process [Phys. Rev. Lett. vol. 87, 084301 (2001)] on a finite ring and obtain an exact expression for the average avalanche size of particles as a function of toppling…
This survey is an extended version of lectures given at the Cornell Probability Summer School 2013. The fundamental facts about the Abelian sandpile model on a finite graph and its connections to related models are presented. We discuss…
We study the saddle-points of the $p$-spin model -- the best understood example of a `complex' (rugged) landscape -- when its $N$ variables are complex. These points are the solutions to a system of $N$ random equations of degree $p-1$. We…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for k<=2. It was known that the problem is QMA-complete for any…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
We introduce the sandpile model on multiplex networks with more than one type of edge and investigate its scaling and dynamical behaviors. We find that the introduction of multiplexity does not alter the scaling behavior of avalanche…
We consider the Bak-Tang-Wiesenfeld sandpile model on a two-dimensional square lattice of lattice sizes up to L=4096. A detailed analysis of the probability distribution of the size, area, duration and radius of the avalanches will be…
We present a detailed analysis of large scale simulations of avalanches in the 2D Abelian sandpile model. We compare statistical properties of two different decompositions of avalanches into clusters of topplings and waves of topplings.…
We examine probability distribution for avalanche sizes observed in self-organized critical systems. While a power-law distribution with a cutoff because of finite system size is typical behavior, a systematic investigation reveals that it…
We show that the quenched complexity of saddles of the spherical pure $p$-spin model agrees with the annealed complexity when both are positive. Precisely, we show that the second moment of the number of critical values of a given finite…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
Reachability for piecewise affine systems is known to be undecidable, starting from dimension $2$. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine…
We numerically study avalanches in the two dimensional Abelian sandpile model in terms of a sequence of waves of toppling events. Priezzhev et al [PRL 76, 2093 (1996)] have recently proposed exact results for the critical exponents in this…
We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional…
One of the central open problems to classify the computational complexity of finite-domain constraint satisfaction problems within P is to prove better algorithmic results for CSPs with a Maltsev polymorphism; we do not even know whether…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…
We study a simple and exactly solvable model for the generation of random satisfiability problems. These consist of $\gamma N$ random boolean constraints which are to be satisfied simultaneously by $N$ logical variables. In…