Connected components and evolution of random graphs: an algebraic approach
Identifieur interne : 000178 ( Istex/Curation ); précédent : 000177; suivant : 000179Connected components and evolution of random graphs: an algebraic approach
Auteurs : René Schott [France] ; G. Stacey Staples [États-Unis]Source :
- Journal of Algebraic Combinatorics [ 0925-9899 ] ; 2012-02-01.
English descriptors
- KwdEn :
Abstract
Abstract: 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.
Url:
DOI: 10.1007/s10801-011-0297-1
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000178
Links to Exploration step
ISTEX:083FFCF3435C847D9495573D274E118171EDE50ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Connected components and evolution of random graphs: an algebraic approach</title>
<author><name sortKey="Schott, Rene" sort="Schott, Rene" uniqKey="Schott R" first="René" last="Schott">René Schott</name>
<affiliation wicri:level="1"><mods:affiliation>IECN and LORIA Nancy Université, Université Henri Poincaré, BP 239, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>IECN and LORIA Nancy Université, Université Henri Poincaré, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: schott@loria.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Staples, G Stacey" sort="Staples, G Stacey" uniqKey="Staples G" first="G. Stacey" last="Staples">G. Stacey Staples</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Mathematics and Statistics, Southern Illinois University Edwardsville, 62026-1653, Edwardsville, IL, USA</mods:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Mathematics and Statistics, Southern Illinois University Edwardsville, 62026-1653, Edwardsville, IL</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: sstaple@siue.edu</mods:affiliation>
<country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:083FFCF3435C847D9495573D274E118171EDE50A</idno>
<date when="2011" year="2011">2011</date>
<idno type="doi">10.1007/s10801-011-0297-1</idno>
<idno type="url">https://api.istex.fr/ark:/67375/VQC-JXR140R3-S/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000178</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000178</idno>
<idno type="wicri:Area/Istex/Curation">000178</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Connected components and evolution of random graphs: an algebraic approach</title>
<author><name sortKey="Schott, Rene" sort="Schott, Rene" uniqKey="Schott R" first="René" last="Schott">René Schott</name>
<affiliation wicri:level="1"><mods:affiliation>IECN and LORIA Nancy Université, Université Henri Poincaré, BP 239, 54506, Vandoeuvre-lès-Nancy, France</mods:affiliation>
<country xml:lang="fr">France</country>
<wicri:regionArea>IECN and LORIA Nancy Université, Université Henri Poincaré, BP 239, 54506, Vandoeuvre-lès-Nancy</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: schott@loria.fr</mods:affiliation>
<country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Staples, G Stacey" sort="Staples, G Stacey" uniqKey="Staples G" first="G. Stacey" last="Staples">G. Stacey Staples</name>
<affiliation wicri:level="1"><mods:affiliation>Department of Mathematics and Statistics, Southern Illinois University Edwardsville, 62026-1653, Edwardsville, IL, USA</mods:affiliation>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Mathematics and Statistics, Southern Illinois University Edwardsville, 62026-1653, Edwardsville, IL</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><mods:affiliation>E-mail: sstaple@siue.edu</mods:affiliation>
<country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">Journal of Algebraic Combinatorics</title>
<title level="j" type="sub">An International Journal</title>
<title level="j" type="abbrev">J Algebr Comb</title>
<idno type="ISSN">0925-9899</idno>
<idno type="eISSN">1572-9192</idno>
<imprint><publisher>Springer US; http://www.springer-ny.com</publisher>
<pubPlace>Boston</pubPlace>
<date type="published" when="2012-02-01">2012-02-01</date>
<biblScope unit="volume">35</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="page" from="141">141</biblScope>
<biblScope unit="page" to="156">156</biblScope>
</imprint>
<idno type="ISSN">0925-9899</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0925-9899</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Graph processes</term>
<term>Quantum probability</term>
<term>Random graphs</term>
</keywords>
</textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: 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.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000178 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 000178 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Curation |type= RBID |clé= ISTEX:083FFCF3435C847D9495573D274E118171EDE50A |texte= Connected components and evolution of random graphs: an algebraic approach }}
This area was generated with Dilib version V0.6.33. |