论文信息 - Graph evolution by stochastic additions of points and lines

Graph evolution by stochastic additions of points and lines

We define the graph G"1 recursively from G"t"-"1 by adding a point or a line with probability @r and q, respectively, if G"t"-"1 is not complete; if G"t"-"1 is complete we always add a point. By using recursions we investigate the probability distribution of the order and size of G"@r of the minimum and maximum orders for a fixed size, and of the minimum and maximum sizes for a fixed order. Expected values and generating functions are determined.

Michael Capobianco | Ove Frank | O. Frank | M. Capobianco

[1] Ove Frank,et al. Estimation of the Number of Connected Components in a Graph by Using a Sampled Subgraph , 1978 .

[2] M. Capobianco. Estimating the connectivity of a graph , 1972 .

[3] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[4] Michael Capobianco,et al. Section of Mathematics: STATISTICAL INFERENCE IN FINITE POPULATIONS HAVING STRUCTURE* , 1970 .

[5] Ove Frank,et al. CHAPTER 16 – ESTIMATION OF POPULATION TOTALS BY USE OF SNOWBALL SAMPLES , 1979 .

[6] P. R. Stein,et al. The combinatorics of random walk with absorbing barriers , 1977, Discret. Math..

[7] Michal Karonski,et al. A review of random graphs , 1982, J. Graph Theory.

[8] Lajos Takács,et al. Combinatorial Methods in the Theory of Stochastic Processes , 1967 .

[9] Samuel Leinhardt,et al. A dynamic model for social networks , 1977 .

[10] Ove Frank,et al. Survey sampling in graphs , 1977 .

[11] O. Frank. A Survey of Statistical Methods for Graph Analysis , 1981 .

[12] R. E. Fagen,et al. The Number of Components in Random Linear Graphs , 1959 .