Related papers: Computational complexity of the avalanche problem …
Motivated by a recent analysis which presents explicitly the general solution, we consider the eigenvalue problem of the spinless Salpeter equation with a ("hard-core amended") Coulomb potential in one dimension. We prove the existence of a…
In the present paper a behavior of the "average case" approximation complexity for d-parametric random fields of tensor-type is studied. It was shown in [Lifshits and Tulyakova, 2006] that for a given approximation accuracy level the…
We consider an \eps-approximation by n-term partial sums of the Karhunen-Lo\`eve expansion to d-parametric random fields of tensor product-type in the average case setting. We investigate the behavior, as d tends to infinity, of the…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
In a recent Letter (EPL 105, 40006; arXiv:1309.7107), Liu and Hu presented a model of toppling-coupled sandpiles, where they found that the avalanche exponents for two toppling-coupled sandpiles are the same as those for a single uncoupled…
The propagator for the activity in a broad class of self-organized critical models obeys an imaginary-time Schr\"odinger equation with a nonlocal, history-dependent potential representing memory. Consequently, the probability for an…
We introduce a 2-round stochastic constraint-satisfaction problem, and show that its approximation version is complete for (the promise version of) the complexity class AM. This gives a `PCP characterization' of AM analogous to the PCP…
A random neighbor extremal stick-slip model is introduced. In the thermodynamic limit, the distribution of states has a simple analytical form and the mean avalanche size, as a function of the coupling parameter, is exactly calculable. The…
On the basis of field observations and of a tentative classification of the different types of snow, a modeling of the different possible types of full-depth avalanches is proposed. A new approach for flow and arrest processes is suggested,…
In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove…
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…
In this article we discuss an exactly solvable, one-dimensional, periodic toy charge density wave model introduced in [D.C. Kaspar, M. Mungan, EPL {\bf 103}, 46002 (2013)]. In particular, driving the system with a uniform force, we show…
We study a local version of the ball-covering problem in Banach spaces, and obtain a complete solution to it in terms of the norm derivatives. We illustrate the advantage of the local approach by obtaining substantial refinements of several…
Two-component sandpile models are investigated numerically and theoretically. Monte Calro simulations are performed to show that probability distribution functions of avalanche size and lifetime obey power laws whose exponents are…
For a driven elastic object near depinning, we derive from first principles the distribution of instantaneous velocities in an avalanche. We prove that above the upper critical dimension, d >= d_uc, the n-times distribution of the…
We describe a directed avalanche model; a slowly unloading sandbox driven by lowering a retaining wall. The directness of the dynamics allows us to interpret the stable sand surfaces as world sheets of fluctuating interfaces in one lower…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
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 study an inhomogeneous sandpile model in which two different toppling rules are defined. For any site only one rule is applied corresponding to either the Bak, Tang and Wiesenfeld model {[}P.Bak, C. Tang, and K. Wiesenfeld, Phys. Rev.…