113 search results - page 3 / 23 » Rigid Components of Random Graphs |
RSA
2000
13 years 7 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
RSA
2008
13 years 6 months ago
2008
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
PR
2006
2006
Correspondence matching using kernel principal components analysis and label consistency constraints
13 years 7 months ago
This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how ker...
WAW
2009
Springer
14 years 2 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...