arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1105.3368cs.DMcond-mat.othercs.SImath-phmath.MP
收藏

随机游动、电网络与沙堆的瞬时类问题

Random Walks, Electric Networks and The Transience Class problem of Sandpiles

Ayush Choure, Sundar Vishwanathan

摘要:

阿贝尔沙堆模型是定义在图(Dhar \cite{DD90},Dhar et al. \cite{DD95})上的离散扩散过程,其用作\textit{self-organized criticality}的标准模型。沙堆的瞬时类被定义为在不使系统递归的情况下可以添加的粒子的最大数量(\cite{BT05})。我们发展的理论,离散扩散的连续调和函数的图形和建立深刻的连接标准的研究结果的随机游走的图形和沙堆的图形。使用这种连接和建立其他必要的机械,我们改进的主要结果Babai和Goroenky(SODA 2007,\cite{LB07})的瞬态类的$n \times n$网格上的界,从$O(n^{30})$到$O(n^{7})$。证明瞬变类是小的验证了一般的概念,即对于大多数自然现象,系统瞬变的时间是小的。此外,我们使用开发的机器来证明一些辅助结果。我们展示了其他两个镶嵌平面,蜂窝和三角形格子之间的等价性。我们给一般的上界的瞬时类作为一个功能的边缘的数量的水槽。此外,对于平面沙堆,我们推导出一个明确的代数表达式,证明近似的瞬态类的$G$内$O(|E(G)|)$。该表达式基于图$G$的对偶的拉普拉斯算子的谱。我们还证明了$Ω(n^{3})$在网格上的瞬态类的下界,改进了$Ω(n^{2})$的明显界。

英文摘要:

The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar \cite{DD90}, Dhar et al. \cite{DD95}) which serves as the standard model of \textit{self-organized criticality}. The transience class of a sandpile is defined as the maximum number of particles that can be added without making the system recurrent (\cite{BT05}). We develop the theory of discrete diffusions in contrast to continuous harmonic functions on graphs and establish deep connections between standard results in the study of random walks on graphs and sandpiles on graphs. Using this connection and building other necessary machinery we improve the main result of Babai and Gorodezky (SODA 2007,\cite{LB07}) of the bound on the transience class of an $n \times n$ grid, from $O(n^{30})$ to $O(n^{7})$. Proving that the transience class is small validates the general notion that for most natural phenomenon, the time during which the system is transient is small. In addition, we use the machinery developed to prove a number of auxiliary results. We exhibit an equivalence between two other tessellations of plane, the honeycomb and triangular lattices. We give general upper bounds on the transience class as a function of the number of edges to the sink. Further, for planar sandpiles we derive an explicit algebraic expression which provably approximates the transience class of $G$ to within $O(|E(G)|)$. This expression is based on the spectrum of the Laplacian of the dual of the graph $G$. We also show a lower bound of $Ω(n^{3})$ on the transience class on the grid improving the obvious bound of $Ω(n^{2})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑