Entropy of Some Models of Sparse Random Graphs With Vertex-Names
PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES(2014)
摘要
Consider the setting of sparse graphs on N vertices, where the vertices have distinct "names", which are strings of length O(logN) from a fixed finite alphabet. For many natural probability models, the entropy grows as cN logN for some model-dependent rate constant c. The mathematical content of this paper is the (often easy) calculation of c for a variety of models, in particular for various standard random graph models adapted to this setting. Our broader purpose is to publicize this particular setting as a natural setting for future theoretical study of data compression for graphs, and (more speculatively) for discussion of unorganized versus organized complexity.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络