Title :
Connections between probability estimation and graph theory
Author_Institution :
Dept. of Electr. Eng., Univ. of Hawaii, Honolulu, HI, USA
fDate :
Sept. 30 2009-Oct. 2 2009
Abstract :
Several authors have characterized limits of graph sequences in terms of extremal distributions on exchangeable random graphs. Parallely, information theorists and statisticians have used patterns of i.i.d. sequences as a framework to develop probability estimation techniques over large alphabets. In this brief note, we observe that measures over patterns of infinite i.i.d. sequences correspond to extremal distributions on exchangeable random graphs.
Keywords :
graph theory; probability; random sequences; exchangeable random graphs; extremal distributions; graph sequences; graph theory; infinite i.i.d sequences; probability estimation technique; Convergence; Dictionaries; Estimation theory; Force sensors; Graph theory; IP networks; Maximum likelihood estimation; Probability; Sensor phenomena and characterization; Testing;
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394509
