scholarly journals The scaling window for a random graph with a given degree sequence

2012 ◽  
Vol 41 (1) ◽  
pp. 99-123 ◽  
Author(s):  
Hamed Hatami ◽  
Michael Molloy
Author(s):  
Yilun Shang

We consider the random graph modelG(w)for a given expected degree sequencew=(w1,w2,…,wn). Warmth, introduced by Brightwell and Winkler in the context of combinatorial statistical mechanics, is a graph parameter related to lower bounds of chromatic number. We present new upper and lower bounds on warmth ofG(w). In particular, the minimum expected degree turns out to be an upper bound of warmth when it tends to infinity and the maximum expected degreem=O(nα)with0<α<1/2.


2012 ◽  
Vol 42 (3) ◽  
pp. 301-348 ◽  
Author(s):  
Alexander Barvinok ◽  
J.A. Hartigan
Keyword(s):  

2009 ◽  
Vol 46 (4) ◽  
pp. 1213-1220 ◽  
Author(s):  
Xian-Yuan Wu ◽  
Zhao Dong ◽  
Ke Liu ◽  
Kai-Yuan Cai

In this paper we focus on the problem of the degree sequence for a random graph process with edge deletion. We prove that, while a specific parameter varies, the limit degree distribution of the model exhibits critical phenomenon.


2011 ◽  
Vol 121 (4) ◽  
pp. 885-895 ◽  
Author(s):  
Kai-Yuan Cai ◽  
Zhao Dong ◽  
Ke Liu ◽  
Xian-Yuan Wu

2017 ◽  
Vol 170 (1-2) ◽  
pp. 263-310 ◽  
Author(s):  
Felix Joos ◽  
Guillem Perarnau ◽  
Dieter Rautenbach ◽  
Bruce Reed

Author(s):  
Brendan D. McKay ◽  
Nicholas C. Wormald
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document