Queries are easier than you thought (probably)
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
A probabilistic view of Datalog parallelization
Theoretical Computer Science - Special issue: database theory
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Random evolution in massive graphs
Handbook of massive data sets
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
The degree sequence of an n-vertex graph is d0,…,dn−1, where each di is the number of vertices of degree i in the graph. A random graph with degree sequence d0,…,dn−1 is a randomly selected member of the set of graphs on {1,…,n} with that degree sequence, all choices being equally likely. Let λ0,λ1,… be a sequence of nonnegative reals summing to 1. A class of finite graphs has degree sequences approximated by λ0,λ1,… if, for every i and n, the members of the class of size n have λi n + o(n) vertices of degree i. Our main result is a convergence law for random graphs with degree sequences approximated by some sequence λ0,λ1,…. With certain conditions on the sequence λ0,λ1,…, the probability of any first-order sentence on random graphs of size n converges to a limit as n grows.