Javascript must be enabled to continue!
Applications of random graphs
View through CrossRef
This chapter reviews graph generation techniques in the context of applications. The first case study is power grids, where proposed strategies to prevent blackouts have been tested on tailored random graphs. The second case study is in social networks. Applications of random graphs to social networks are extremely wide ranging – the particular aspect looked at here is modelling the spread of disease on a social network – and how a particular construction based on projecting from a bipartite graph successfully captures some of the clustering observed in real social networks. The third case study is on null models of food webs, discussing the specific constraints relevant to this application, and the topological features which may contribute to the stability of an ecosystem. The final case study is taken from molecular biology, discussing the importance of unbiased graph sampling when considering if motifs are over-represented in a protein–protein interaction network.
Title: Applications of random graphs
Description:
This chapter reviews graph generation techniques in the context of applications.
The first case study is power grids, where proposed strategies to prevent blackouts have been tested on tailored random graphs.
The second case study is in social networks.
Applications of random graphs to social networks are extremely wide ranging – the particular aspect looked at here is modelling the spread of disease on a social network – and how a particular construction based on projecting from a bipartite graph successfully captures some of the clustering observed in real social networks.
The third case study is on null models of food webs, discussing the specific constraints relevant to this application, and the topological features which may contribute to the stability of an ecosystem.
The final case study is taken from molecular biology, discussing the importance of unbiased graph sampling when considering if motifs are over-represented in a protein–protein interaction network.
Related Results
Specific constructions
Specific constructions
This chapter presents network-generating models which cannot be neatly categorized as growing, nor as defined primarily through a target degree distribution. They are best understo...
Surveys in Combinatorics, 1995
Surveys in Combinatorics, 1995
The fifteenth British Combinatorial Conference took place in July 1995 at the University of Stirling. This volume consists of the papers presented by the invited lecturers at the m...
Graph Algorithms
Graph Algorithms
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with...
Light Localisation and Lasing
Light Localisation and Lasing
The properties of quasi-random and random photonic systems have been extensively studied over the last two decades, but recent technological advances have opened new horizons in th...
On Product Measures Associated with Stationary Processes
On Product Measures Associated with Stationary Processes
This article considers the connections between product measures and stationary processes. It first provides an overview of historical facts and relevant terminology, basic concepts...
Introduction
Introduction
This introductory chapter sets the scene for the material which follows by briefly introducing the study of networks and describing their wide scope of application. It discusses th...
Ensembles with hard constraints
Ensembles with hard constraints
This chapter introduces random graph ensembles involving hard constraints such as setting a fixed total number of links or fixed degree sequence, including properties of the partit...
Time Series
Time Series
Abstract
Time series analysis is one of several branches of statistics whose practical importance has increased with the availability of powerful computing tools. Me...


