Asymptotic theory of greedy approximations to minimal k-point random graphs
From MaRDI portal
Publication:4503369
DOI10.1109/18.782114zbMath0945.90073MaRDI QIDQ4503369
Alfred O. III Hero, Olivier J. J. Michel
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.782114
90C35: Programming involving graphs or networks
62G30: Order statistics; empirical distribution functions
60C05: Combinatorial probability
Related Items
Parametric Bayesian estimation of differential entropy and relative entropy, Cross-cumulants measure for independence, A class of Rényi information estimators for multidimensional densities