Related papers: The stochastic sandpile model on complete graphs
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into…
Dynamic inference problems in autoregressive (AR/ARMA/ARIMA), exponential smoothing, and navigation are often formulated and solved using state-space models (SSM), which allow a range of statistical distributions to inform innovations and…
We consider random perturbations of discrete-time dynamical systems. We give sufficient conditions for the stochastic stability of certain classes of maps, in a strong sense. This improves the main result in J. F. Alves, V. Araujo, Random…
The stochastic mirror descent (SMD) algorithm is a general class of training algorithms, which includes the celebrated stochastic gradient descent (SGD), as a special case. It utilizes a mirror potential to influence the implicit bias of…
Continuous-time state-space models (SSMs) are flexible tools for analysing irregularly sampled sequential observations that are driven by an underlying state process. Corresponding applications typically involve restrictive assumptions…
A new class of stochastic field models is constructed using nested stochastic partial differential equations (SPDEs). The model class is computationally efficient, applicable to data on general smooth manifolds, and includes both the…
A simulated annealing algorithm is employed to generate a stochastic model for a Berea and a Fontainebleau sandstone with prescribed two-point probability function, lineal path function, and ``pore size'' distribution function,…
We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…
Sandpile models with conserved number of particles (also called fixed energy sandpiles) may undergo phase transitions between active and absorbing states. We generalize the Manna sandpile model with fixed number of particles, introducing a…
Stochastic Approximation (SA) is a classical algorithm that has had since the early days a huge impact on signal processing, and nowadays on machine learning, due to the necessity to deal with a large amount of data observed with…
In sustained growth with random dynamics stationary distributions can exist without detailed balance. This suggests thermodynamical behavior in fast growing complex systems. In order to model such phenomena we apply both a discrete and a…
Simulations of a stochastic fixed-energy sandpile in one and two dimensions reveal slow relaxation of the order parameter, even far from the critical point. The decay of the activity is best described by a stretched-exponential form. The…
In this paper we follow up the study of 'complex complex landscapes,' rugged landscapes of many complex variables. Unlike real landscapes, the classification of saddles by index is trivial. Instead, the spectrum of fluctuations at…
In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most $s$ nodes can switch their class memberships between two…
In this paper, we use a stochastic partial differential equation (SPDE) as a model for the density of a population under the influence of random external forces/stimuli given by the environment. We study statistical properties for two…
We consider the problem of formally verifying almost-sure (a.s.) asymptotic stability in discrete-time nonlinear stochastic control systems. While verifying stability in deterministic control systems is extensively studied in the…
We develop a structure-preserving ADMM method, denoted SP-ADMM, for learning energy-stable spatial derivative stencils for Maxwell equations from noisy data. Starting from the source-free Maxwell system, we focus on a one-dimensional…
Stochastic approximation (SA) and stochastic gradient descent (SGD) algorithms are work-horses for modern machine learning algorithms. Their constant stepsize variants are preferred in practice due to fast convergence behavior. However,…
The divisible sandpile model is a fixed-energy continuous counterpart of the Abelian sandpile model. We start with a random initial configuration and redistribute mass deterministically. Under certain conditions the sandpile will stabilize.…
We present simulations of static model sandpiles in two dimensions (2D) and focus on the stress distribution in such arrays made of discrete particles. We use the simplest possible model, i.e. spherical particles with a linear spring and a…