Biggins, J.D. and Penman, D.B.
(2009)
*Large Deviations in randomly coloured random graphs.*
Electronic Communications in Probability, 14.
pp. 290-301.
ISSN 1083-589X

Text
Maths_3.pdf Download (157Kb) |

## Abstract

Models of random graphs are considered where the presence or absence of an edge depends on the random types (colours) of its vertices, so that whether or not edges are present can be dependent. The principal objective is to study large deviations in the number of edges. These graphs provide a natural example with two different non-degenerate large deviation regimes, one arising from large deviations in the colourings followed by typical edge placement and the other from large deviation in edge placement. A secondary objective is to illustrate the use of a general result on large deviations for mixtures.

Item Type: | Article |
---|---|

Copyright, Publisher and Additional Information: | © 2009 Institute of Mathematical Statistics. Reproduced in accordance with the publisher's self-archiving policy. |

Institution: | The University of Sheffield |

Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) > School of Mathematics and Statistics (Sheffield) |

Depositing User: | Mrs Megan Hobbs |

Date Deposited: | 19 Mar 2010 13:03 |

Last Modified: | 09 Jun 2014 04:28 |

Published Version: | http://www.math.washington.edu/~ejpecp/ECP/ |

Status: | Published |

Publisher: | Institute of Mathematical Statistics |

URI: | http://eprints.whiterose.ac.uk/id/eprint/10605 |