<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00990478</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T06:02:06+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Random 2-SAT Solution Components and a Fitness Landscape</title>
            <author role="aut">
              <persName>
                <forename type="first">Damien</forename>
                <surname>Pitman</surname>
              </persName>
              <idno type="halauthorid">826206-0</idno>
              <affiliation ref="#struct-361557"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Service Ist</forename>
                <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
              </persName>
              <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-05-13 15:39:03</date>
              <date type="whenModified">2025-02-28 16:28:48</date>
              <date type="whenReleased">2014-05-13 16:18:30</date>
              <date type="whenProduced">2011-06-13</date>
              <date type="whenEndEmbargoed">2014-05-13</date>
              <ref type="file" target="https://inria.hal.science/hal-00990478v1/document">
                <date notBefore="2014-05-13"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00990478v1/file/1024-6321-1-PB.pdf" id="file-990478-761381">
                <date notBefore="2014-05-13"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="129574">
                <persName>
                  <forename>Service Ist</forename>
                  <surname>Inria Sophia Antipolis-Méditerranée / I3s</surname>
                </persName>
                <email type="md5">7c88c2dda46d455591481b4e07aef779</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00990478</idno>
            <idno type="halUri">https://inria.hal.science/hal-00990478</idno>
            <idno type="halBibtex">pitman:hal-00990478</idno>
            <idno type="halRefHtml">&lt;i&gt;Discrete Mathematics and Theoretical Computer Science&lt;/i&gt;, 2011, Vol. 13 no. 2 (2), pp.45--62. &lt;a target="_blank" href="https://dx.doi.org/10.46298/dmtcs.534"&gt;&amp;#x27E8;10.46298/dmtcs.534&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 2 (2), pp.45--62. &amp;#x27E8;10.46298/dmtcs.534&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-990478-761381"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DMTCS">DMTCS</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Graphs and Algorithms</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Random 2-SAT Solution Components and a Fitness Landscape</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Damien</forename>
                    <surname>Pitman</surname>
                  </persName>
                  <idno type="halauthorid">826206-0</idno>
                  <affiliation ref="#struct-361557"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">649</idno>
                <idno type="issn">1462-7264</idno>
                <idno type="eissn">1365-8050</idno>
                <title level="j">Discrete Mathematics and Theoretical Computer Science</title>
                <imprint>
                  <publisher>DMTCS</publisher>
                  <biblScope unit="volume">Vol. 13 no. 2</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">45--62</biblScope>
                  <date type="datePub">2011-06-13</date>
                </imprint>
              </monogr>
              <idno type="doi">10.46298/dmtcs.534</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We describe a limiting distribution for the number of connected components in the subgraph of the discrete cube induced by the satisfying assignments to a random 2-SAT formula. We show that, for the probability range where formulas are likely to be satisfied, the random number of components converges weakly (in the number of variables) to a distribution determined by a Poisson random variable. The number of satisfying assignments or solutions is known to grow exponentially in the number of variables. Thus, our result implies that exponentially many solutions are organized into a stochastically bounded number of components. We also describe an application to biological evolution; in particular, to a type of fitness landscape where satisfying assignments represent viable genotypes and connectivity of genotypes is limited by single site mutations. The biological result is that, with probability approaching 1, each viable genotype is connected by single site mutations to an exponential number of other viable genotypes while the number of viable clusters is finite.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="regroupinstitution" xml:id="struct-361557" status="VALID">
          <idno type="IdRef">026425157</idno>
          <idno type="ROR">https://ror.org/01q1z8k08</idno>
          <orgName>State University of New York</orgName>
          <orgName type="acronym">SUNY</orgName>
          <desc>
            <address>
              <country key="US"/>
            </address>
            <ref type="url">http://www.suny.edu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>