منابع مشابه
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of Zn, and most recently, sparse gra...
متن کاملGeneration of Random Graphs with Prescribed Degree Sequences
The study of complex networks plays an increasingly important role in science. One common feature of complex networks is that they are large. Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs. Most practical use would require some property constraints on random graphs, usually with given degrees. There are several wa...
متن کاملThe degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Dorogovtsev et al [10]. We also consider a generalisation of the model with more randomisation, proving similar results. Finally, we use our results on the degree sequence to show that for certain values of parameters lo...
متن کاملUniform generation of random graphs with power-law degree sequences
We give a linear-time algorithm that approximately uniformly generates a randomsimple graph with a power-law degree sequence whose exponent is at least 2.8811.While sampling graphs with power-law degree sequence of exponent at least 3 is fairlyeasy, and many samplers work efficiently in this case, the problem becomes dramaticallymore difficult when the exponent drops below 3; ou...
متن کاملInduced subgraphs in sparse random graphs with given degree sequences
Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1981
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90253-3