Introduction to Random Graphs

@inproceedings{Frieze2016IntroductionTR,
  title={Introduction to Random Graphs},
  author={Alan M. Frieze and Michal Karonski},
  year={2016}
}
From social networks such as Facebook, the World Wide Web and the Internet, to the complex interactions between proteins in the cells of our bodies, we constantly face the challenge of understanding the structure and development of networks. The theory of random graphs provides a framework for this understanding, and in this book the authors give a gentle introduction to the basic tools for understanding and applying the theory. Part I includes sufficient material, including exercises, for a… 

Spectrum of Complex Networks

The limiting distribution of (the bulk of) the spectrum as the size of the network grows to infinity is determined and it is shown that the leading eigenvectors are strongly localized.

Spatial networks. A complete introduction: from graph theory and statistical physics to real-world applications.

This book describes and studies a range of network models and discusses relations between statistical features of networks, and how these features affect economic or other activities involving the network.

Large-scale structures in random graphs

In recent years there has been much progress in graph theory on questions of the following type. What is the threshold for a certain large substructure to appear in a random graph? When does a random

Large-scale structures in random graphs

This work surveys progress in graph theory on questions of the following type, and highlights the vital role played by some newly developed methods, such as the sparse regularity method, the absorbing method, and the container method.

Geometric Inhomogeneous Random Graphs and Graph Coloring Games

GIRGs generalize hyperbolic random graphs to higher dimensions and are technically simpler while preserving their qualitative behavior, which serves as benchmarks for network algorithms like routing or link prediction.

Generating graphs randomly

This work will focus mainly on the set of all simple graphs with a particular degree sequence, and describe several different algorithms for sampling graphs from this family uniformly, or almost uniformly.

The Impact of Edge Correlations in Random Networks

  • A. Faragó
  • Computer Science, Mathematics
    Complex Syst.
  • 2021
Two models of more general random graphs in which the edges may be dependent are analyzed and some interesting, nontrivial properties about both models are proved.

Mathematics of Epidemics on Networks: From Exact to Approximate Models

This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to

Approximating sparse graphs: The random overlapping communities model

A simple, easy to sample, random graph model that captures the limiting spectra of many sequences of interest, including the sequence of hypercube graphs, and it is shown that the model is an effective approximation for individual graphs.

Connectivity of a general class of inhomogeneous random digraphs

It is shown that by choosing the joint distribution of the vertex attributes according to a multivariate regularly varying distribution, one can obtain scale-free graphs with arbitrary in-degree/outdegree dependence.
...

References

SHOWING 1-10 OF 696 REFERENCES

Random Graphs and Complex Networks

  • R. Hofstad
  • Computer Science
    Cambridge Series in Statistical and Probabilistic Mathematics
  • 2016
This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.

Random dot product graphs: a flexible model for complex networks

This thesis proposes a robust and general model for complex networks that incorporates at a fundamental level semantic information and exhibits the three hallmark properties of complex networks: small diameter, clustering, and skewed degree distribution.

Width of a scale-free tree

The width of the tree is shown and it is shown that it is W n ∼ n/√π log n at the nth step; this also holds for a slight generalization of the model with another constant.

Clustering and the Hyperbolic Geometry of Complex Networks

This article considers the global clustering coefficient of random graphs on the hyperbolic plane, proposed recently by Krioukov and colleagues as a mathematical model of complex networks, under the fundamental assumption thathyperbolic geometry underlies the structure of these networks.

Random Hyperbolic Graphs: Degree Sequence and Clustering

This work initiates the rigorous study of random hyperbolic graphs and confirms rigorously that the degree sequence follows a power-law distribution with controllable exponent and that the clustering is nonvanishing.

The Power of Local Information in Social Networks

It is concluded that a network provider's decision of how much structure to make visible to its users can have a significant effect on a user's ability to interact strategically with the network.

On the Largest Component of a Hyperbolic Model of Complex Networks

The present paper focuses on the evolution of the component structure of the random graph, and shows that for $\alpha > 1$ and $\nu$ arbitrary, with high probability, as the number of vertices grows, the largest component of therandom graph has sublinear order.

The Diameter of a Scale-Free Random Graph

We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability

On the Hyperbolicity of Small-World and Treelike Random Graphs

This study provides one of the first significant analytic results on the hyperbolicity of a rich class of random graphs, which sheds light on the relationship between hyperbolicsity and navigability of random graph models, as well as on the sensitivity of hyperBolic δ to noises in random graphs.

Recent Progress in Complex Network Analysis: Properties of Random Intersection Graphs

This work surveys recent results concerning various random intersection graph models showing that they have tunable clustering coefficient, a rich class of degree distributions including power-laws, and short average distances.
...