scholarly journals Braess's Paradox in large random graphs

2010 ◽  
Vol 37 (4) ◽  
pp. 495-515 ◽  
Author(s):  
Gregory Valiant ◽  
Tim Roughgarden
Keyword(s):  
Random Graphs ◽  
Braess’S Paradox

scholarly journals Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors

2016 ◽  
Vol 50 (4) ◽  
pp. 584-611 ◽  
Author(s):  
Ronen Eldan ◽  
Miklós Z. Rácz ◽  
Tselil Schramm
Keyword(s):  
Random Graphs ◽  
Spectral Gap ◽  
Braess’S Paradox

Random Graphs

1998 ◽  
Author(s):  
V. F. Kolchin
Keyword(s):  
Random Graphs

Applications of random graphs

2017 ◽  
Author(s):  
A.C.C. Coolen ◽  
A. Annibale ◽  
E.S. Roberts
Keyword(s):  
Social Networks ◽  
Random Graphs ◽  
Interaction Network ◽  
Power Grids ◽  
Protein Protein Interaction ◽  
Topological Features ◽  
First Case ◽  
The Stability ◽  
Protein Protein Interaction Network

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.

Random graphs

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
Large Scale ◽  
Random Network ◽  
Graph Model ◽  
Clustering Coefficient ◽  
Giant Component ◽  
Random Graph Model ◽  
Definition Of ◽  
Average Size

An introduction to the mathematics of the Poisson random graph, the simplest model of a random network. The chapter starts with a definition of the model, followed by derivations of basic properties like the mean degree, degree distribution, and clustering coefficient. This is followed with a detailed derivation of the large-scale structural properties of random graphs, including the position of the phase transition at which a giant component appears, the size of the giant component, the average size of the small components, and the expected diameter of the network. The chapter ends with a discussion of some of the shortcomings of the random graph model.

Sign in / Sign up

Export Citation Format

Share Document