Large Deviations in Generalized Random Graphs with Node Weights
Generalized random graphs are considered where the presence or absence of an edge depends on the weights of its nodes. Our main interest is to investigate large deviations for the number of edges per node in such a generalized random graph, where the node weights are deterministic under some regularity conditions, as well as chosen i.i.d. from a finite set with positive components. When the node weights are random variables, obstacles arise because the independence among edges no longer exists, our main tools are some results of large deviations for mixtures. After calculating, our results show that the corresponding rate functions for the deterministic case and the random case are very different.
KeywordsLarge deviations mixture generalized random graphs
MR(2010) Subject Classification05C80 60F10
Unable to display preview. Download preview PDF.
We thank the referees for their time and comments.
- Penman, D. B.: Ramdom Graphs with Correlation Structure, Ph. D thesis, University of Sheffield, 1998Google Scholar