Semantic Scholar uses AI to extract papers important to this topic.
1. Overview 2. Erdos-Renyi random graphs 3. Fixed degree distributions 4. Power laws 5. Small worlds 6. Random walks 7. CHKNS… Expand We will review some of the major results in random graphs and some of the more challenging open problems. We will cover… Expand 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… Expand This text is an in-depth account of graph theory. It reflects the current state of the subject and emphasizes connections with… Expand Let E,, .V denote the set of all graphs having n given labelled vertices VI, L’s;,., Vn and N edges. The graphs considered are… Expand Recently, Barabasi and Albert  suggested modeling complex real-world networks such as the worldwide web as follows: consider a… Expand Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved… Expand We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves… Expand Given a sequence of nonnegative real numbers λ0, λ1… which sum to 1, we consider random graphs having approximately λi n vertices… Expand (n) k edges have equal probabilities to be chosen as the next one . We shall 2 study the "evolution" of such a random graph if N… Expand