Abstract
Thus far we have employed what might be considered a static view of random graphs. We fix an edge probability p = p(n) and look at the behavior all first order sentences A in G ͠ G(n, p). Erdös and Rényi, as discussed in Section 1.1.1, always thought of the random graph as evolving from empty to full. Now we shall fix an arbitrary first order sentence A and consider what happens to Pr [A] as the random graphs evolves.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (2001). A Dynamic View. In: The Strange Logic of Random Graphs. Algorithms and Combinatorics, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04538-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-04538-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07499-8
Online ISBN: 978-3-662-04538-1
eBook Packages: Springer Book Archive