Sciweavers

42 search results - page 2 / 9
» Component Evolution in General Random Intersection Graphs
Sort
View
STOC
2000
ACM
112views Algorithms» more  STOC 2000»
13 years 9 months ago
A random graph model for massive graphs
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
William Aiello, Fan R. K. Chung, Linyuan Lu
WWW
2003
ACM
14 years 6 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
RSA
2011
124views more  RSA 2011»
13 years 8 days ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
ICTAI
1996
IEEE
13 years 9 months ago
Order in Space: A General Formalism for Spatial Reasoning
In this paper we propose a general approach for reasoning in space. The approach is composed of a set of two general constraints to govern the spatial relationships between object...
Baher A. El-Geresy, Alia I. Abdelmoty
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 5 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald