51 search results - page 3 / 11 » Embracing the Giant Component |
KDD
2008
ACM
14 years 6 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
RSA
2011
13 years 21 days ago
2011
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...
IJON
2007
13 years 5 months ago
2007
The calyx of Held is a giant glutamatergic synapse in the auditory system and displays multiple forms of short-term facilitation and depression. This study presents a detailed mod...
COCOON
2006
Springer
13 years 7 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...