Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Convergence law for random graphs with specified degree sequence

Convergence law for random graphs with specified degree sequence 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Convergence law for random graphs with specified degree sequence

Loading next page...
 
/lp/association-for-computing-machinery/convergence-law-for-random-graphs-with-specified-degree-sequence-xhH5H0izSy

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2005 by ACM Inc.
ISSN
1529-3785
DOI
10.1145/1094622.1094627
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Oct 1, 2005

There are no references for this article.