Name
Abstract | ||
|---|---|---|
We study the following min-min random graph process G=(G\"0,G\"1,...): the initial state G\"0 is an empty graph on n vertices (n even). Further, G\"M\"+\"1 is obtained from G\"M by choosing a pair {v,w} of distinct vertices of minimum degree uniformly at random among all such pairs in G\"M and adding the edge {v,w}. The process may produce multiple edges. We show that G\"M is asymptotically almost surely disconnected if M@?n, and that for M=(1+t)n, 0 |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2009.02.015 | Discrete Mathematics |
Keywords | Field | DocType |
giant component,random graph process,connectedness,gamma distribution. keywords: random graph,random graph,connectedne ss,gamma distribution | Discrete mathematics,Combinatorics,Random graph,Bound graph,Vertex (geometry),Giant component,Null graph,Almost surely,Function composition,Multiple edges,Mathematics | Journal |
Volume | Issue | ISSN |
309 | 13 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amin Coja-Oghlan | 1 | 543 | 47.25 |
| Mihyun Kang | 2 | 163 | 29.18 |