✦ LIBER ✦

The Abelian Sandpile Model on a Random Binary Tree

✍ Scribed by Redig, F.; Ruszel, W. M.; Saada, E.

Book ID: 113072649
Publisher: Springer
Year: 2012
Tongue: English
Weight: 819 KB
Volume: 147
Category: Article
ISSN: 0022-4715
DOI: 10.1007/s10955-012-0498-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Topological Self-similarity on the Rando

Topological Self-similarity on the Random Binary-Tree Model

✍ Ken Yamamoto; Yoshihiro Yamazaki 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 430 KB

Infinite volume limit of the Abelian san

Infinite volume limit of the Abelian sandpile model in dimensionsd≥

✍ Antal A. Járai; Frank Redig 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 357 KB

A Note on the Abelian Sandpile in(pmb{ma

A Note on the Abelian Sandpile in(pmb{mathbb{Z}}^{d})

✍ Tyomkyn, Mykhaylo 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 281 KB

On the distribution of binary search tre

On the distribution of binary search trees under the random permutation model

✍ James Allen Fill 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 865 KB

We study the distribution Q on the set B, of binary search trees over a linearly ordered set of n records under the standard random permutation model. This distribution also arises as the stationary distribution for the move-to-root (MTR) Markov chain taking values in B,, when successive requests ar

Random cluster model on a Cayley tree

✍ H. G. Baumgärtel; E. Müller-Hartmann 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 775 KB

On the Total Heights of Random Rooted Bi

On the Total Heights of Random Rooted Binary Trees

✍ L. Takacs 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 306 KB

Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the