The giant k-core of a random graph with a speci ed degree sequence
暂无分享,去创建一个
[1] Brendan D. McKay,et al. Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..
[2] Jon M. Kleinberg,et al. The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.
[3] O. Kallenberg. Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.
[4] Bruce A. Reed,et al. A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.
[5] Bruce A. Reed,et al. The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.
[6] Fan Chung Graham,et al. A random graph model for massive graphs , 2000, STOC '00.