A note on the warmth of random graphs with given expected degrees

DOI10.1155/2014/749856MaRDI QIDQ2330255zbMATH OpenOpenAlexWikidataFDO

Authors Yilun Shang

Publication date 28 October 2019

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/749856

zbMATH Keywords

combinatorial statistical mechanicsrandom graph model

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Warmth and edge spaces of graphs
• A remark on the spectra of random graphs with given expected degrees
• A critical point for random graphs with a given degree sequence
• On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
• The Spectra of Random Graphs with Given Expected Degrees

Cites work

• 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

Cited in

(1)

• Warmth and edge spaces of graphs

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)