On graph parameters guaranteeing fast sandpile diffusion
From MaRDI portal
Publication:2260617
zbMath1308.05097arXiv1207.0421MaRDI QIDQ2260617
Ayush Choure, Sundar Vishwanathan
Publication date: 11 March 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.0421
Applications of graph theory (05C90) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Internal DLA in higher dimensions
- Scaling limits for internal aggregation models with multiple sources
- Logarithmic Harnack inequalities
- Random walk on graphs with regular resistance and volume growth
- Chip-firing games on graphs
- On the sandpile group of the square cycle \(C^{2}_{n}\)
- On the sandpile group of regular trees
- On the sandpile group of \(3\times n\) twisted bracelets
- Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
- Chip-firing and the critical group of a graph
- Harmonic and analytic functions on graphs
- On the sandpile group of dual graphs
- Goldbug variations
- A Harnack inequality for homogeneous graphs and subgraphs
- On graph parameters guaranteeing fast sandpile diffusion
- On the sandpile group of the graph \(K_{3}\times C_n\)
- The art of random walks.
- Logarithmic Sobolev inequalities for finite Markov chains
- The computational complexity of one-dimensional sandpiles
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Expander graphs and their applications
- Random Walk: A Modern Introduction
- Polynomial Bound for a Chip Firing Game on Graphs
- Self-organized critical state of sandpile automaton models
- Eigenvalues of Graphs and Sobolev Inequalities
- Algebraic aspects of Abelian sandpile models
- Faster Generation of Random Spanning Trees
- Approaching Optimality for Solving SDD Linear Systems
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
- A Nearly-m log n Time Solver for SDD Linear Systems
- Random Walks, Electric Networks and The Transience Class problem of Sandpiles
- Brownian Motion
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication: On graph parameters guaranteeing fast sandpile diffusion
