相关论文: Chip-firing and energy minimization on M-matrices
It is well known that there is a duality map between the superstable configurations and the critical configurations of a graph. This was extended to all M-matrices in (Guzm\`an-Klivans 2015). We show a natural way to extend this to all…
Two classes of avalanche-finite matrices and their critical groups (integer cokernels) are studied from the viewpoint of chip-firing/sandpile dynamics, namely, the Cartan matrices of finite root systems and the McKay-Cartan matrices for…
Aval et al. proved that starting from a critical configuration of a chip- firing game on an undirected graph, one can never achieve a stable configuration by reverse firing any non-empty subsets of its vertices. In this paper, we generalize…
We propose a generalization of the graphical chip-firing model allowing for the redistribution dynamics to be governed by any invertible integer matrix while maintaining the long term critical, superstable, and energy minimizing behavior of…
We study chip-firing on a signed graph $G_\phi$, employing a general theory of chip-firing on invertible matrices introduced by Guzm\'an and Klivans. Here a negative edge designates an adversarial relationship, so that firing a vertex…
Motivated by the notion of chip-firing on the dual graph of a planar graph, we consider `integral flow chip-firing' on an arbitrary graph $G$. The chip-firing rule is governed by ${\mathcal L}^*(G)$, the dual Laplacian of $G$ determined by…
We investigate the formation of polycrystalline structures in a class of particle systems. The atomistic energy is modeled as a sum of particle energies that favor atoms being locally isometric to a reference lattice. The discrete frame…
In this paper we consider the problem of characterizing the minimum energy configurations of a finite system of particles interacting between them due to attracting or repulsive forces given by a certain inter molecular potential. We limit…
This article introduces a quantized chip-firing model with close connections to the theory of rational lattice paths and rational parking functions. Given a graph with a sink and positive integers a,b,c with gcd(a,b)=1, a set S of vertices…
We study the behavior of atomistic models in general dimensions under uniaxial tension and investigate the system for critical fracture loads. We rigorously prove that in the discrete-to-continuum limit the minimal energy satisfies a…
In this letter, we derive minimum-energy controls for a broad class of control-affine systems using a Lagrange multiplier fixed-point equation and a generally non-symmetric Gramian-like matrix. In feasible coercivity classes, this fixed…
In the limit of vanishing lattice spacing we provide a rigorous variational coarse-graining result for a next-to-nearest neighbor lattice model of a simple crystal. We show that the $\Gamma$-limit of suitable scaled versions of the model…
We prove the existence of minimisers for a family of models related to the single-slip-to-single-plane relaxation of single-crystal, strain-gradient elastoplasticity with $L^p$-hardening penalty. In these relaxed models, where only one…
We show a collection of scripts, called $G$-strongly positive scripts, which is used to recognize critical configurations of a chip firing game (CFG) on a multi-digraph with a global sink. To decrease the time of the process of recognition…
For the well-known model of a system of N particles with interaction (N-body problem), we consider the spatial problem of finding the minimum of the function of the kinetic energy of a system on its phase space under conditions on its size…
In the abelian sandpile model, recurrent chip configurations are of interest as they are a natural choice of coset representatives under the quotient of the reduced Laplacian. We investigate graphs whose recurrent identities with respect to…
We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…
The paper concerns the analysis of global minimizers of a Dirichlet-type energy functional in the class of $\mathbb{S}^2$-valued maps defined in cylindrical surfaces. The model naturally arises as a curved thin-film limit in the theories of…
Chip firing provides a way to study the sandpile group (also known as the Jacobian) of a graph. We use a generalized version of chip firing to bound the number of invariant factors of the critical group of an arithmetical structure on a…
In this paper, we study a famous discrete dynamical system, the Chip Firing Game, used as a model in physics, economics and computer science. We use order theory and show that the set of reachable states (i.e. the configuration space) of…