Search Sciweavers | Sciweavers

100 search results - page 3 / 20

» Unicyclic Components in Random Graphs

click to vote

CPC
2007

76views more CPC 2007»

A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution

14 years 10 months ago

Download www.cs.nyu.edu

We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...

Svante Janson, Joel Spencer

claim paper

Read More »

click to vote

WAW
2009
Springer

150views Algorithms» more WAW 2009»

The Giant Component in a Random Subgraph of a Given Graph

15 years 4 months ago

Download www.math.ucsd.edu

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...

Fan Chung Graham, Paul Horn, Linyuan Lu

claim paper

Read More »

click to vote

CORR
2008
Springer

75views Education» more CORR 2008»

On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs

14 years 10 months ago