Use this URL to cite or link to this record in EThOS:
Title: Random graphs with correlation structure
Author: Penman, David Binnie
ISNI:       0000 0001 3482 9325
Awarding Body: University of Sheffield
Current Institution: University of Sheffield
Date of Award: 1998
Availability of Full Text:
Access from EThOS:
Access from Institution:
In this thesis we consider models of random graphs where, unlike in the classical models G (n, p) the probability of an edge arising can be correlated with that of other edges arising. Attention focuses on graphs whose vertices are each assigned a colour (type) at random and where edges between differently coloured vertices subsequently arise with different probabilities (so-called RRC graphs), especially the special case with two colours. Various properties of these graphs are considered, often by comparing and contrasting them with the classical model with the same probability of each particular edge existing. Topics examined include the probabilities of trees and cycles, how the joint probability of two subgraphs compares with the product of their probabilities, the number of edges in the graph (including large deviations results), connectedness, connectivity, the number and order of complete graphs and cliques, and tournaments with correlation structure.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Statistics