A note on the warmth of random graphs with given expected degrees
Summary: We consider the random graph model \(G(\mathbf{w})\) for a given expected degree sequence \(\mathbf{w} = (w_1, w_2, \dots, w_n)\). 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(\mathbf{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^\alpha)\) with \(0 < \alpha < 1 / 2\).
- A remark on the chromatic polynomials of incomparability graphs of posets
- A remark on the spectra of random graphs with given expected degrees
- Complex graphs and networks
- Connected components in random graphs with given expected degree sequences
- Eigenvalues of random power law graphs
- Every monotone graph property has a sharp threshold
- scientific article; zbMATH DE number 2151248 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Large dicliques in a directed inhomogeneous random graph
- Multi-type directed scale-free percolation
- Non-hyperbolicity of random graphs with given expected degrees
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
- Random graphs.
- The Average Distance in a Random Graph with Given Expected Degrees
- The concentration of the chromatic number of random graphs
- The natural connectivity of colored random graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- The spectral gap of random graphs with given expected degrees
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
This page was built for publication: A note on the warmth of random graphs with given expected degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330255)
