✦ LIBER ✦

Testing centralization in random graphs

✍ Scribed by Christian Tallberg

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 164 KB
Volume: 26
Category: Article
ISSN: 0378-8733
DOI: 10.1016/j.socnet.2004.02.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trees in random graphs

✍ P. Erdös; Z. Palka 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Cycles in random graphs

✍ Tomasz Łuczak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 348 KB

tuczak, T., Cycles in random graphs, Discrete Mathematics 98 (1991) 231-236. Let G(n, p) be a graph on n vertices in which each possible edge is presented independently with probability p = p(n) and u'(n, p) denote the number of vertices of degree 1 in G(n, p). It is shown that if E > 0 and rip(n)))

Kernels in random graphs

✍ W.Fernandez de la Vega 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 214 KB

For each fixed p, the random directed graph D(n, p) on n vertices with (directed) edge probability p possesses a kernel with probability tending to 1 as n + a. Pour chaque p fixe, le graphe alCatoire D(n, p) a n sommets et probabilitts des arcs Cgales B p posstde un noyau avec une probabilit6 tenda

Holes in random graphs

✍ Tomasz Łuczak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 376 KB

Broadcasting in random graphs

✍ Alan Frieze; Michael Molloy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A new family of random graphs for testin

A new family of random graphs for testing spatial segregation

✍ Elvan Ceyhan; Carey E. Priebe; David J. Marchette 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 French ⚖ 382 KB

## Abstract The authors discuss a graph‐based approach for testing spatial point patterns. This approach falls under the category of data‐random graphs, which have been introduced and used for statistical pattern recognition in recent years. The authors address specifically the problem of testing c