✦ LIBER ✦

Random generations of the countable random graph

✍ Scribed by Su Gao; Chuang Shao

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 202 KB
Volume: 143
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.12.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

General Partitioning on Random Graphs

✍ C.R. Subramanian; C.E. Veni Madhavan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Consider the general partitioning (GP) problem defined as follows: Partition the vertices of a graph into k parts W 1 W k satisfying a polynomial time verifiable property. In particular, consider properties (introduced by T. Feder, P. Hell, S. Klein, and R. Motwani, in "Proceedings of the Annual ACM

The intersection graph of random sets

✍ Hiroshi Maehara 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Maehara, H., The intersection graph of random sets, Discrete Mathematics 87 (1991) 97-104. Let X,, i=l,..., n, be n = n(N) independent random subsets of {1,2,. . , N}, each selected at random out of the 2N subsets. We present some asymptotic (N-tm) properties of {Xi}, e.g. if r~/2~'~--+ m then {Xi}

Random graphs generated by the Star 2-Pr

Random graphs generated by the Star 2-Process

✍ Hanna Robalewska 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

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 nu

Maximum matchings in general graphs thro

Maximum matchings in general graphs through randomization

✍ Michael O Rabin; Vijay V Vazirani 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 679 KB

The energy of random graphs

✍ Wenxue Du; Xueliang Li; Yiyang Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

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