1949 search results - page 29 / 390 » Random graphs on surfaces |
STOC
2009
ACM
16 years 12 days 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...
100
click to vote
ICOIN
2004
Springer
15 years 5 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...
RSA
2010
14 years 6 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...
WWW
2007
ACM
16 years 14 days ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
110
click to vote
AML
1999
14 years 11 months ago
1999
We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the mon...