✦ LIBER ✦

MOMENT PROPERTIES OF SUBGRAPH COUNTS IN STOCHASTIC GRAPHS

✍ Scribed by Ove Frank

Book ID: 118717654
Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 479 KB
Volume: 319
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1979.tb32791.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Compound Poisson approximations of subgr

Compound Poisson approximations of subgraph counts in random graphs

✍ Dudley Stark 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 1 views

Subgraph counts in random graphs using i

Subgraph counts in random graphs using incomplete u-statistics methods

✍ Krzysztof Nowicki; John C. Wierman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Subgraph Counts and Containment Probabil

Subgraph Counts and Containment Probabilities of Balanced and Unbalanced Subgraphs in a Large Random Graph

✍ BÉLA BOLLOBÁS; JOHN C. WIERMAN 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

Forbidden subgraphs and Hamiltonian prop

Forbidden subgraphs and Hamiltonian properties of graphs

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Estimations of subgraph positions in mol

Estimations of subgraph positions in molecular graphs and their common subgraph peculiarities

✍ L. I. Makarov 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 91 KB

Small variance of subgraph counts in a r

Small variance of subgraph counts in a random tournament

✍ Pontus Andersson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 78 KB

It is known that, for 'most' digraphs D on v vertices, the variance of the number of copies of D in a random tournament on n vertices (chosen uniformly from all such tournaments) is of degree 2v -3 as a polynomial in n. Here we prove that there are arbitrarily large D for which this degree is as sma