ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES
From MaRDI portal
Publication:5416367
DOI10.1017/S0269964813000399zbMath1288.05241arXiv1301.0337MaRDI QIDQ5416367
Publication date: 20 May 2014
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0337
05C80: Random graphs (graph-theoretic aspects)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A history of graph entropy measures
- The continuum random tree. I
- Processes on unimodular random networks
- Universal Compression of Memoryless Sources Over Unknown Alphabets
- The t-Improper Chromatic Number of Random Graphs
- Inequalities with applications to percolation and reliability
- Pattern matching and lossy data compression on random fields
- Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments
- Probability Estimation in the Rare-Events Regime
- Elements of Information Theory