2079 search results - page 33 / 416 » Universality of random graphs |
108
click to vote
NDJFL
2010
14 years 8 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...
105
click to vote
JCT
2008
15 years 1 months ago
2008
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
STOC
2009
ACM
16 years 2 months ago
2009
ACM
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
126
click to vote
ICOIN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
109
click to vote
RSA
2010
14 years 8 months ago
2010
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...