Connected components and evolution of random graphs: An algebraic approach
Journal of Algebraic Combinatorics, Tome 35 (2012) no. 1, pp. 141-156.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: Questions about a graph's connected components are answered by studying appropriate powers of a special "adjacency matrix" constructed with entries in a commutative algebra whose generators are idempotent. The approach is then applied to the Erdös-Rényi model of sequences of random graphs. Developed herein is a method of encoding the relevant information from graph processes into a "second quantization" operator and using tools of quantum probability and infinite-dimensional analysis to derive formulas that reveal the exact values of quantities that otherwise can only be approximated. In particular, the expected size of a maximal connected component, the probability of existence of a component of particular size, and the expected number of spanning trees in a random graph are obtained.
Keywords: keywords random graphs, graph processes, quantum probability
@article{JAC_2012__35_1_a1,
     author = {Schott, Ren\'e and Staples, G.Stacey},
     title = {Connected components and evolution of random graphs: {An} algebraic approach},
     journal = {Journal of Algebraic Combinatorics},
     pages = {141--156},
     publisher = {mathdoc},
     volume = {35},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_2012__35_1_a1/}
}
TY  - JOUR
AU  - Schott, René
AU  - Staples, G.Stacey
TI  - Connected components and evolution of random graphs: An algebraic approach
JO  - Journal of Algebraic Combinatorics
PY  - 2012
SP  - 141
EP  - 156
VL  - 35
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_2012__35_1_a1/
LA  - en
ID  - JAC_2012__35_1_a1
ER  - 
%0 Journal Article
%A Schott, René
%A Staples, G.Stacey
%T Connected components and evolution of random graphs: An algebraic approach
%J Journal of Algebraic Combinatorics
%D 2012
%P 141-156
%V 35
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_2012__35_1_a1/
%G en
%F JAC_2012__35_1_a1
Schott, René; Staples, G.Stacey. Connected components and evolution of random graphs: An algebraic approach. Journal of Algebraic Combinatorics, Tome 35 (2012) no. 1, pp. 141-156. http://geodesic.mathdoc.fr/item/JAC_2012__35_1_a1/