A Note on the Warmth of Random Graphs with Given Expected Degrees
Author
Source
International Journal of Mathematics and Mathematical Sciences
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-06-30
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Abstract EN
We consider the random graph model G(w) for a given expected degree sequence w=(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 of G(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 degree m=O(nα) with 0<α<1/2.
American Psychological Association (APA)
Shang, Yilun. 2014. A Note on the Warmth of Random Graphs with Given Expected Degrees. International Journal of Mathematics and Mathematical Sciences،Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-495724
Modern Language Association (MLA)
Shang, Yilun. A Note on the Warmth of Random Graphs with Given Expected Degrees. International Journal of Mathematics and Mathematical Sciences No. 2014 (2014), pp.1-4.
https://search.emarefa.net/detail/BIM-495724
American Medical Association (AMA)
Shang, Yilun. A Note on the Warmth of Random Graphs with Given Expected Degrees. International Journal of Mathematics and Mathematical Sciences. 2014. Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-495724
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-495724