English
Related papers

Related papers: Computational Complexity of Avalanches in the Kada…

200 papers

In this paper we are interested in a rigorous derivation of the Kuramoto-Sivashinsky equation (K--S) in a Free Boundary Problem. As a paradigm, we consider a two-dimensional Stefan problem in a strip, a simplified version of a solid-liquid…

Analysis of PDEs · Mathematics 2009-07-17 Claude-Michel Brauner , Josephus Hulshof , Luca Lorenzi

In this article we study the generalized dispersion version of the Kadomtsev-Petviashvili II equation, on $\T \times \R$ and $\T \times \R^2$. We start by proving bilinear Strichartz type estimates, dependent only on the dimension of the…

Analysis of PDEs · Mathematics 2015-05-13 Axel Grünrock , Mahendra Panthee , Jorge Drumond Silva

In the single-source sandpile model, a number $N$ grains of sand are positioned at a central vertex on the 2-dimensional grid $\mathbb{Z}^2$. We study the stabilisation of this configuration for a stochastic sandpile model based on a…

Probability · Mathematics 2022-08-23 Thomas Selig , Haoyue Zhu

This article presents the complexity of reachability decision problems for parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where transitions probabilities are described by polynomials over a…

Logic in Computer Science · Computer Science 2020-09-29 Sebastian Junges , Joost-Pieter Katoen , Guillermo A. Pérez , Tobias Winkler

We present solutions to the matrix completion problems proposed by the Alignment Research Center that have a polynomial dependence on the precision $\varepsilon$. The motivation for these problems is to enable efficient computation of…

Machine Learning · Computer Science 2024-01-09 Rico Angell

In this paper we summarize the existing principles for building unconventional computing devices that involve delayed signals for encoding solutions to NP-complete problems. We are interested in the following aspects: the properties of the…

Emerging Technologies · Computer Science 2015-09-10 Mihai Oltean , Oana Muntean

We study the asymptotics in $L^2$ for complexity penalized least squares regression for the discrete approximation of finite-dimensional signals on continuous domains - e.g. images - by piecewise smooth functions. We introduce a fairly…

Statistics Theory · Mathematics 2013-01-30 Laurent Demaret , Felix Friedrich , Volkmar Liebscher , Gerhard Winkler

We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.…

Computational Complexity · Computer Science 2011-01-10 Peter Buergisser , J. M. Landsberg , Laurent Manivel , Jerzy Weyman

This paper investigates the Cauchy problem of two-dimensional full compressible Navier-Stokes system with density and temperature vanishing at infinity. For the strong solutions, some a priori weighted $L^2(R^2)$-norm of the gradient of…

Analysis of PDEs · Mathematics 2023-04-05 Xue Wang

The abelian sandpile model in two dimensions does not show the type of critical behavior familar from equilibrium systems. Rather, the properties of the stationary state follow from the condition that an avalanche started at a distance r…

Disordered Systems and Neural Networks · Physics 2009-10-31 Barbara Drossel

We present a new hybrid direct/iterative approach to the solution of a special class of saddle point matrices arising from the discretization of the steady incompressible Navier-Stokes equations on an Arakawa C-grid. The two-level method…

Numerical Analysis · Mathematics 2010-06-10 Fred Wubs , Jonas Thies

In bilevel and robust optimization we are concerned with combinatorial min-max problems, for example from the areas of min-max regret robust optimization, network interdiction, most vital vertex problems, blocker problems, and two-stage…

Computational Complexity · Computer Science 2025-11-24 Christoph Grüne , Lasse Wulf

We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentially large. However, such models may take polynomial space in…

Artificial Intelligence · Computer Science 2007-05-23 Paolo Liberatore

This article is based on a talk given by one of us (EVI) at the conference ``StatPhys-Taipei-1997''. It overviews the exact results in the theory of the sandpile model and discusses shortly yet unsolved problem of calculation of avalanche…

Statistical Mechanics · Physics 2015-06-25 E. V. Ivashkevich , V. B. Priezzhev

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

Optimization and Control · Mathematics 2018-12-19 Areesh Mittal , Can Gokalp , Grani A. Hanasusanto

There are a number of results saying that for certain "path-following" algorithms that solve PPAD-complete problems, the solution obtained by the algorithm is PSPACE-complete to compute. We conjecture that these results are special cases of…

Computational Complexity · Computer Science 2015-06-17 Paul W. Goldberg

Multiple avalanches, initiated by simultaneously toppling neighbouring sites, are studied in three different directed sandpile models. It is argued that, while the single avalanche exponents are different for the three models, a suitably…

Statistical Mechanics · Physics 2011-05-13 R. Rajesh

We devise an abstract, modular scheme to prove continuity of the Lyapunov exponents for a general class of linear cocycles. The main assumption is the availability of appropriate large deviation type (LDT) estimates which are uniform in the…

Dynamical Systems · Mathematics 2015-07-13 Pedro Duarte , Silvius Klein

We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with…

Quantum Physics · Physics 2008-03-18 M. Van den Nest , W. Dür , H. J. Briegel

Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of this concept, called simple-homotopy equivalence: two…

Algebraic Topology · Mathematics 2019-10-22 Ulrich Bauer , Abhishek Rathod , Jonathan Spreer