Large deviation principles for empirical measures of coloured random graphs
Doku-Amponsah, K. and Morters, P., 2010. Large deviation principles for empirical measures of coloured random graphs. Annals of Applied Probability, 20 (6), pp. 1989-2021.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below. (Contact Author)
For any finite colored graph we define the empirical neighborhood measure, which counts the number of vertices of a given color connected to a given number of vertices of each color, and the empirical pair measure, which counts the number of edges connecting each pair of colors. For a class of models of sparse colored random graphs, we prove large deviation principles for these empirical measures in the weak topology. The rate functions governing our large deviation principles can be expressed explicitly in terms of relative entropies. We derive a large deviation principle for the degree distribution of Erdos-Renyi graphs near criticality.
|Creators||Doku-Amponsah, K.and Morters, P.|
|Uncontrolled Keywords||random graph,degree distribution,typed graph,entropy,partition function,random randomly colored graph,relative entropy,spins,ising model on a random graph,erdos-renyi graph,joint large deviation principle,empirical pair measure,empirical measure|
|Departments||Faculty of Science > Mathematical Sciences|
Actions (login required)