Random graphs with arbitrary degree distributions and their applications.

@article{Newman2001RandomGW,
  title={Random graphs with arbitrary degree distributions and their applications.},
  author={Mark E. J. Newman and Steven H. Strogatz and Duncan J. Watts},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2001},
  volume={64 2 Pt 2},
  pages={
          026118
        }
}
  • M. Newman, S. Strogatz, D. Watts
  • Published 2001
  • Mathematics, Physics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past. In this paper we develop in detail the theory of random graphs with arbitrary degree distributions. In addition to simple undirected, unipartite graphs, we examine the properties of directed and bipartite graphs. Among other results, we derive exact… Expand
Directed Random Graphs with given Degree Distributions
Given two distributions F and G on the nonnegative integers we propose an algorithm to construct in- and out-degree sequences from samples of i.i.d. observations from F and G, respectively, that withExpand
The average distances in random graphs with given expected degrees
  • F. Chung, L. Lu
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
It is shown that for certain families of random graphs with given expected degrees the average distance is almost surely of order log n/log d́, where d̃ is the weighted average of the sum of squares of the expected degrees. Expand
Properties of dense partially random graphs.
  • S. Risau-Gusman
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
This work studies the properties of random graphs where for each vertex a neighborhood has been previously defined and obtains analytically the distribution of eigenvalues of the corresponding adjacency matrices and applies the results to the calculation of the mixing rate and synchronizability threshold. Expand
Distances in power-law random graphs
In many real-world networks, such as the Internet and social networks, power-law degree sequences have been observed. This means that, when the graph is large, the proportion of vertices with degreeExpand
The Average Distance in a Random Graph with Given Expected Degrees
TLDR
It is shown that for certain families of random graphs with given expected degrees, the average distance is almost surely of order log n/ logd̃ where d̃ is the weighted average of the sum of squares of the expected degrees. Expand
Effect of volume growth on the percolation threshold in random directed acyclic graphs with a given degree distribution.
TLDR
It is proved that for a given degree distribution the percolation threshold for weakly connected components is not affected by the volume growth function, and it is shown that the size of the giant component and the cyclomatic number areNot affected by volume scaling. Expand
Connected Graphs with a Given Degree Sequence: Efficient Sampling, Correlations, Community Detection and Robustness
TLDR
It is argued that keeping graphs in one connected piece, or component, is key for many applications where complex graphs are assumed to be connected either by definition or by construction. Expand
Techniques for analyzing dynamic random graph models of web-like networks: An overview
Various random graph models have recently been proposed to replicate and explain the topology of large, complex, real-life networks such as the World Wide Web and the Internet. These models areExpand
Subgraphs in random networks.
TLDR
It is found that certain subgraphs appear much more frequently than in Erdos networks, and the power exponent of the degree distribution, gamma, is used as a control parameter, and it is shown that random networks exhibit transitions between three regimes. Expand
Universality for the Distance in Finite Variance Random Graphs
AbstractWe generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class containsExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 85 REFERENCES
A random graph model for massive graphs
TLDR
A random graph model is proposed which is a special case of sparse random graphs with given degree sequences which involves only a small number of parameters, called logsize and log-log growth rate, which capture some universal characteristics of massive graphs. Expand
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
TLDR
The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i. Expand
The Web as a Graph: Measurements, Models, and Methods
TLDR
This paper describes two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery, and proposes a new family of random graph models that point to a rich new sub-field of the study of random graphs, and raises questions about the analysis of graph algorithms on the Internet. Expand
A Critical Point for Random Graphs with a Given Degree Sequence
TLDR
It is shown that if Σ i(i - 2)λi > 0, then such graphs almost surely have a giant component, while if λ0, λ1… which sum to 1, then almost surely all components in such graphs are small. Expand
A portion of the well-known collaboration graph
TLDR
An on-going project in which a portion of this graph—in particular, a list of all people with small Erdős numbers—is made available in electronic form is reported on. Expand
ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH
If G is an arbitrary non-complete graph, let cp(G) denote the least number к such that by deleting к appropriately chosen vertices from G (i. e. deleting the к points in question and all edgesExpand
On the strength of connectedness of a random graph
If G is an arbitrary non-complete graph, let cZ1(G) denote the least number k such that by deleting k appropriately chosen vertices from G (i. e. deleting the k points in question and all edgesExpand
On the evolution of random graphs
(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 is increased . In this investigation we endeavour to find what is theExpand
Exact solution of site and bond percolation on small-world networks.
  • C. Moore, M. Newman
  • Mathematics, Physics
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
TLDR
An exact solution of the model for both site and bond percolation is given, including the position of thePercolation transition at which epidemic behavior sets in, the values of the critical exponents governing this transition, the mean and variance of the distribution of cluster sizes below the transition, and the size of the giant component (epidemic) above the transition. Expand
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
...
1
2
3
4
5
...