Research Repository

Large deviations in randomly coloured random graphs

Biggins, JD and Penman, DB (2009) 'Large deviations in randomly coloured random graphs.' Electronic Communications in Probability, 14. 290 - 301. ISSN 1083-589X

[img]
Preview
Text
1478-5008-1-PB.pdf

Download (161kB) | Preview

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. © 2009 Applied Probability Trust.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science and Health > Mathematical Sciences, Department of
Depositing User: David Penman
Date Deposited: 18 Oct 2012 22:20
Last Modified: 23 Jan 2019 05:15
URI: http://repository.essex.ac.uk/id/eprint/4025

Actions (login required)

View Item View Item