A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1705.08768v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Threshold functions for small subgraphs: an analytic approach
[article]
<span title="2017-05-24">2017</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to describe the possible overlapping of copies. This paper is a version, extended to include proofs, of the paper with the same title to be presented at the Eurocomb 2017 meeting.
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.08768v1">arXiv:1705.08768v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wwwwa4zy5zer7jvfuj46ah44p4">fatcat:wwwwa4zy5zer7jvfuj46ah44p4</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200901090551/https://arxiv.org/pdf/1705.08768v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/73/6e734bcf064da46164f9148399224df9f359649e.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.08768v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>