Related papers: Computational complexity of the avalanche problem …
We present a method to obtain the average and the typical value of the number of critical points of the empirical risk landscape for generalized linear estimation problems and variants. This represents a substantial extension of previous…
Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. NP-hardness of the problem of computing the stopping distance of a Tanner graph follows as a consequence
In a recent paper, Brusco, K\"ohn and Steinley [Ann. Oper. Res. 206:611-626 (2013)] conjecture that the 2 bins special case of the one-dimensional minimax bin-packing problem with bin size constraints might be solvable in polynomial time.…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two…
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 a generalised complex Monge-Amp\`ere equation on a compact K\"ahler manifold and treat it using the method of continuity. For complex surfaces, we prove an easy existence result. We also prove that (for three-folds and a related…
We perform a high-accuracy moment analysis of the avalanche size, duration and area distribution of the Abelian Manna model on eight two-dimensional and four one-dimensional lattices. The results provide strong support to establish…
We show that in a broad class of directed abelian sandpile models that had been expected to have the same exponents as the Dhar-Ramaswamy model, the avalanche exponent depends upon the details of the interaction, calling into question the…
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…
We report on extensive numerical simulations on the Bak-Sneppen model in high dimensions. We uncover a very rich behavior as a function of dimensionality. For d>2 the avalanche cluster becomes fractal and for d \ge 4 the process becomes…
Experiments on 2+1-dimensional piles of elongated particles are performed. Comparison with previous experiments in 1+1 dimensions shows that the addition of one extra dimension to the dynamics changes completely the avalanche properties,…
The resolution of the P vs. NP problem, a cornerstone in computational theory, remains elusive despite extensive exploration through mathematical logic and algorithmic theory. This paper takes a novel approach by integrating information…
We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Franc\'{e}s showing that it is NP-complete to decide whether a given simplicial…
The formation of codimension-one interfaces for multi-well gradient-driven problems is well-known and established in the scalar case, where the equation is often referred to as the Allen-Cahn equation. The proofs rely for a large on a…
A general solution to the Complex Monge-Amp\`ere equation in a space of arbitrary dimensions is constructed.
A single sandpile model with quenched random toppling matrices captures the crucial features of different models of self-organized criticality. With symmetric matrices avalanche statistics falls in the multiscaling BTW universality class.…
We give an asymptotic formula for the single site height distribution of Abelian sandpiles on $\mathbb{Z}^d$ as $d \to \infty$, in terms of $\mathsf{Poisson}(1)$ probabilities. We provide error estimates.
We review some recent results on random polynomials and their generalizations in complex and symplectic geometry. The main theme is the universality of statistics of zeros and critical points of (generalized) polynomials of degree $N$ on…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…