Related papers: Fixed point forms of the parallel symmetric sandpi…

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

We study diffusion of particles in large-scale simulations of one-dimensional stochastic sandpiles, in both the restricted and unrestricted versions. The results indicate that the diffusion constant scales in the same manner as the activity…

In the stochastic sandpile model on a graph, particles interact pairwise as follows: if two particles occupy the same vertex, they must each take an independent random walk step with some probability $0<p<1$ of not moving. These…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and science. The computations rely on the floating-point arithmetic specified by the IEEE754 Standard. In this context, an elementary brick of…

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.…

In this paper we focus on the finite-dimensional approximation of quasi-static evolutions of critical points of the phase-field model of brittle fracture. In a space discretized setting, we first discuss an alternating minimization scheme…

Taking a representation-theoretic viewpoint, we construct a continuous associahedron motivated by the realization of the generalized associahedron in the physical setting. We show that our associahedron shares important properties with the…

Idealized first-principles models of chemical plants can be inaccurate. An alternative is to fit a Machine Learning (ML) model directly to plant sensor data. We use a structured approach: Each unit within the plant gets represented by one…

This paper is devoted to the analysis of a semilinear suspension bridge model with pointwise localized dissipation. The main contribution of the work is the development of a robust semigroup framework that substantially simplifies the…

Statistical Model Checking (SMC) is a trade-off between testing and formal verification. The core idea of the approach is to conduct some simulations of the system and verify if they satisfy some given property. In this paper we show that…

Many machine learning algorithms rely on iterative updates of uncertainty representations, ranging from variational inference and expectation-maximization, to reinforcement learning, continual learning, and multi-agent learning. In the…

The sandpile automata of Bak, Tang, and Wiesenfeld (Phys. Rev. Lett., 1987) are a simple model for the diffusion of particles in space. A fundamental problem related to the complexity of the model is predicting its evolution in the parallel…

We consider the abelian stochastic sandpile model. In this model, a site is deemed unstable when it contains more than one particle. Each unstable site, independently, is toppled at rate $1$, sending two of its particles to neighbouring…

We present an exactly solvable model for one-dimensional symmetry-protected topological phases with $\mathbb{Z}_N\times\mathbb{Z}_N$ symmetry. The model works by binding point topological defects (domain walls) of one symmetry to charges of…

Supermodeling is a modern, model-ensembling paradigm that integrates several self-synchronized imperfect sub-models by controlling a few meta-parameters to generate more accurate predictions of complex systems' dynamics. Continual…

The divisible sandpile starts with i.i.d. random variables ("masses") at the vertices of an infinite, vertex-transitive graph, and redistributes mass by a local toppling rule in an attempt to make all masses at most 1. The process…

We study the Abelian sandpile model (ASM), a process where grains of sand are placed on a graph's vertices. When the number of grains on a vertex is at least its degree, one grain is distributed to each neighboring vertex. This model has…

We study sandpile models with stochastic toppling rules and having sticky grains so that with a non-zero probability no toppling occurs, even if the local height of pile exceeds the threshold value. Dissipation is introduced by adding a…

In classical asynchronous distributed systems composed of a fixed number n of processes where some proportion may fail by crashing, many objects do not have a wait-free linearizable implementation (e.g. stacks, queues, etc.). It has been…