Archive of posts with tag “graph theory”
-
Determining the stabilizability of the abelian sandpile model
The abelian sandpile model is a cellular automaton where each cell is a sandpile that can topple to put grains on neighboring cells when having enough grains. It is stable if none of the sandpiles can topple. A natural question to ask is whether it can become stable eventually. In this article, I will show that one can determine the stabilizibility usiung integer linear programming for the abelian sandpile model on an arbitrary finite graph. -
From Picard iteration to Feynman path integral
The Schrödinger equation is an ODE, so we can approach its solution through Picard iteration. This approach leads to a sum over walks on the graph formed by an orthonormal basis as vertices and the Hamiltonian matrix elements as edge weights. This sum is exactly the Feynman path integral if we choose the position basis and take the continuum limit.
subscribe via Atom