✦ LIBER ✦

Random graphs generated by the Star 2-Process

✍ Scribed by Hanna Robalewska

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 249 KB
Volume: 11
Category: Article
ISSN: 1042-9832
DOI: 10.1002/(sici)1098-2418(199709)11:2<125::aid-rsa3>3.0.co;2-u

No coin nor oath required. For personal study only.

✦ Synopsis

The star 2-process ''greedily'' generates graphs with maximum degree 2 in a natural way. We can obtain information about the final graph of this process; for instance, that is almost surely 2-regular. We also find the probability of hamiltonicity and Poisson approximations of the distributions of numbers of cycles and short cycles. ᮊ 1997

📜 SIMILAR VOLUMES

Connectivity of random regular graphs ge

Connectivity of random regular graphs generated by the pegging algorithm

✍ Pu Gao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract We study the connectivity of random __d__‐regular graphs which are recursively generated by an algorithm motivated by a peer‐to‐peer network. We show that these graphs are asymptotically almost surely __d__‐connected for any even constant __d__⩾4. © 2010 Wiley Periodicals, Inc. J Graph

Cataloging graphs by generating them uni

Cataloging graphs by generating them uniformly at random

✍ A. Kerber; R. Laue; R. Hager; W. Weber 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB

## Abstract We describe an algorithm for cataloging graphs by generating them uniformly at random. The method used is based on a recent algorithm by Dixon and Wilf that generates orbit representatives uniformly at random. The approach is refined to graphs with prescribed numbers of edges and vertic

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d

A mathematical analysis of the R-MAT ran

A mathematical analysis of the R-MAT random graph generator

✍ Chris Groër; Blair D. Sullivan; Steve Poole 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

On Statistical Inference for the Random

On Statistical Inference for the Random Set Generated Cox Process with Set-marking

✍ Antti Penttinen; Aki Niemi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

Star Trek the Next Generation #59: Gemworld #2

✍ John Vornholt 📂 Fiction 📅 2000 🏛 Pocket Books 🌐 en-GB ⚖ 118 KB 👁 2 views

Dazzling to behold, Gemworld is one of the wonders of the Federation: an artificial world composed entirely of crystal, its atmosphere held in place by a sophisticated network of force fields. Home to half a dozen different sentient races, this singular world is a low-gravity playpen of mammoth spir