Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
The degree sequence of an n -vertex graph is d 0 ,…, d n −1 , where each d i is the number of vertices of degree i in the graph. A random graph with degree sequence d 0 ,…, d n −1 is a randomly selected member of the set of graphs on {1,…, n } with that degree sequence, all choices being equally likely. Let λ 0 ,λ 1 ,… be a sequence of nonnegative reals summing to 1. A class of finite graphs has degree sequences approximated by λ 0 ,λ 1 ,… if, for every i and n , the members of the class of size n have λ i n + o(n) vertices of degree i . Our main result is a convergence law for random graphs with degree sequences approximated by some sequence λ 0 ,λ 1 ,…. With certain conditions on the sequence λ 0 ,λ 1 ,…, the probability of any first-order sentence on random graphs of size n converges to a limit as n grows.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Oct 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.