DocumentCode
3230140
Title
Connections between probability estimation and graph theory
Author
Santhanam, N.P.
Author_Institution
Dept. of Electr. Eng., Univ. of Hawaii, Honolulu, HI, USA
fYear
2009
fDate
Sept. 30 2009-Oct. 2 2009
Firstpage
1427
Lastpage
1429
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;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/ALLERTON.2009.5394509
Filename
5394509
Link To Document