The first cycles in an evolving graph (Q910415): Difference between revisions

Analytical methods based on generating functions are used to prove various results on waiting times for cycles in a random graph process with successively added edges. Cycle lengths and other properties are also investigated. Asymptotic results are given for graphs of large order.

0 references

zbMATH Keywords

graph evolution

0 references

generating functions

0 references

random graph process

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Poisson convergence and Poisson processes with applications to random graphs

0 references

The expected linearity of a simple equivalence algorithm

0 references

Q3680834

0 references

A Random Graph With a Subcritical Number of Edges

0 references

Q5645344

0 references

The number of connected sparsely edged graphs

0 references

full work available at URL

https://doi.org/10.1016/0012-365x(89)90087-3

0 references

Identifiers

zbMATH Open document ID

0696.05045

0 references

DOI

10.1016/0012-365X(89)90087-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:910415

@@ Property / author @@
-Boris G. Pittel
@@ Property / author: Boris G. Pittel / rank @@
-Normal rank
@@ Property / author @@
+Boris G. Pittel
@@ Property / author: Boris G. Pittel / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3661894
@@ Property / cites work: Q3661894 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3250680
@@ Property / cites work: Q3250680 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5625163
@@ Property / cites work: Q5625163 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3669422
@@ Property / cites work: Q3669422 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5682013
@@ Property / cites work: Q5682013 / rank @@
+Normal rank
@@ Property / cites work @@
+Poisson convergence and Poisson processes with applications to random graphs
+Normal rank
@@ Property / cites work @@
+The expected linearity of a simple equivalence algorithm
+Normal rank
@@ Property / cites work @@
+Q3680834
@@ Property / cites work: Q3680834 / rank @@
+Normal rank
@@ Property / cites work @@
+A Random Graph With a Subcritical Number of Edges
@@ Property / cites work: A Random Graph With a Subcritical Number of Edges / rank @@
+Normal rank
@@ Property / cites work @@
+Q5645344
@@ Property / cites work: Q5645344 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of connected sparsely edged graphs
@@ Property / cites work: The number of connected sparsely edged graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(89)90087-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1966433910
@@ Property / OpenAlex ID: W1966433910 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:910415