46 research outputs found
Exploring hypergraphs with martingales
Recently, we adapted exploration and martingale arguments of Nachmias and
Peres, in turn based on ideas of Martin-L\"of, Karp and Aldous, to prove
asymptotic normality of the number of vertices in the largest component
of the random -uniform hypergraph throughout the supercritical regime.
In this paper we take these arguments further to prove two new results: strong
tail bounds on the distribution of , and joint asymptotic normality of
and the number of edges of . These results are used in a
separate paper "Counting connected hypergraphs via the probabilistic method" to
enumerate sparsely connected hypergraphs asymptotically.Comment: 32 pages; significantly expanded presentation. To appear in Random
Structures and Algorithm
Counting connected hypergraphs via the probabilistic method
In 1990 Bender, Canfield and McKay gave an asymptotic formula for the number
of connected graphs on with edges, whenever and the nullity
tend to infinity. Asymptotic formulae for the number of connected
-uniform hypergraphs on with edges and so nullity
were proved by Karo\'nski and \L uczak for the case ,
and Behrisch, Coja-Oghlan and Kang for . Here we prove such a
formula for any fixed, and any satisfying and
as . This leaves open only the (much simpler) case
, which we will consider in future work. ( arXiv:1511.04739 )
Our approach is probabilistic. Let denote the random -uniform
hypergraph on in which each edge is present independently with
probability . Let and be the numbers of vertices and edges in
the largest component of . We prove a local limit theorem giving an
asymptotic formula for the probability that and take any given pair
of values within the `typical' range, for any in the supercritical
regime, i.e., when where
and ; our enumerative result then follows
easily.
Taking as a starting point the recent joint central limit theorem for
and , we use smoothing techniques to show that `nearby' pairs of values
arise with about the same probability, leading to the local limit theorem.
Behrisch et al used similar ideas in a very different way, that does not seem
to work in our setting.
Independently, Sato and Wormald have recently proved the special case ,
with an additional restriction on . They use complementary, more enumerative
methods, which seem to have a more limited scope, but to give additional
information when they do work.Comment: Expanded; asymptotics clarified - no significant mathematical
changes. 67 pages (including appendix