𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Random Sections of the Cube

✍ Scribed by Y. Lonke

Publisher
Springer
Year
2000
Tongue
English
Weight
86 KB
Volume
23
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Stratified random walks on the n-cube
Stratified random walks on the n-cube
✍ F. R. K. Chung; R. L. Graham πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 226 KB πŸ‘ 1 views

In this paper we present a method for analyzing a general class of random ## Ε½ . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bound

Universality of the sections of cubes
Universality of the sections of cubes
✍ G. V. Epifanov πŸ“‚ Article πŸ“… 1967 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 93 KB
Random minimal spanning tree and percola
Random minimal spanning tree and percolation on the N-cube
✍ Mathew D. Penrose πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 251 KB πŸ‘ 1 views

The N-cube is a graph with 2 N vertices and N 2 Ny1 edges. Suppose indepen- dent uniform random edge weights are assigned and let T be the spanning tree of minimal Ε½ . y 1 N Ο± y3 total weight. Then the weight of T is asymptotic to N 2 Ý i as N Βͺ Ο±. Asymp-is1 totics are also given for the local stru

Random Induced Subgraphs of Generalizedn
Random Induced Subgraphs of Generalizedn-Cubes
✍ Christian M. Reidys πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 312 KB

vertices are adjacent if they differ in exactly one coordinate. Random induced subgraphs, . with probability . The first theorem shows that for s c ln n rn there exists n n a unique largest component in ⌫ -Q Q n which contains almost all vertices and that n ␣ Ž . the size of the second largest comp