15,719 research outputs found
On the expected number of perfect matchings in cubic planar graphs
A well-known conjecture by Lov\'asz and Plummer from the 1970s asserted that
a bridgeless cubic graph has exponentially many perfect matchings. It was
solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the other
hand, Chudnovsky and Seymour (Combinatorica 2012) proved the conjecture in the
special case of cubic planar graphs. In our work we consider random bridgeless
cubic planar graphs with the uniform distribution on graphs with vertices.
Under this model we show that the expected number of perfect matchings in
labeled bridgeless cubic planar graphs is asymptotically , where
and is an explicit algebraic number. We also
compute the expected number of perfect matchings in (non necessarily
bridgeless) cubic planar graphs and provide lower bounds for unlabeled graphs.
Our starting point is a correspondence between counting perfect matchings in
rooted cubic planar maps and the partition function of the Ising model in
rooted triangulations.Comment: 19 pages, 4 figure
Further results on random cubic planar graphs
We provide precise asymptotic estimates for the number of several classes of labeled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by Bodirsky and coworkers. We revisit their work and obtain new results on the enumeration of cubic planar graphs and on random cubic planar graphs. In particular, we determine the exact probability of a random cubic planar graph being connected, and we show that the distribution of the number of triangles in random cubic planar graphs is asymptotically normal with linear expectation and variance. To the best of our knowledge, this is the first time one is able to determine the asymptotic distribution for the number of copies of a fixed graph containing a cycle in classes of random planar graphs arising from planar maps.Peer ReviewedPostprint (author's final draft
Random cubic planar graphs revisited
The goal of our work is to analyze random cubic planar graphs according to the uniform distribution. More precisely, let G be the class of labelled cubic planar graphs and let gn be the number of graphs with n verticesPostprint (author's final draft
On the expected number of perfect matchings in cubic planar graphs
A well-known conjecture by Lov'asz and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Esperet et al. ([13]). On the other hand, Chudnovsky and Seymour ([8]) proved the conjecture in the special case of cubic planar graphs. In our work we consider random bridgeless cubic planar graphs with the uniform distribution on graphs with n vertices. Under this model we show that the expected number of perfect matchings in labeled bridgeless cubic planar graphs is asymptotically cγn, where c > 0 and γ ∼ 1.14196 is an explicit algebraic number. We also compute the expected number of perfect matchings in (not necessarily bridgeless) cubic planar graphs and provide lower bounds for unlabeled graphs. Our starting point is a correspondence between counting perfect matchings in rooted cubic planar maps and the partition function of the Ising model in rooted triangulations
Random cubic planar graphs converge to the Brownian sphere
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere.
The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic planar graphs into their 3-connected components, the metric structure of a random cubic planar graph is shown to be well approximated by its unique 3-connected component of linear size, with modified distances.
Then, Whitney's theorem ensures that a 3-connected cubic planar graph is the dual of a simple triangulation, for which it is known that the scaling limit is the Brownian sphere. Curien and Le Gall have recently developed a framework to study the modification of distances in general triangulations and in their dual. By extending this framework to simple triangulations, it is shown that 3-connected cubic planar graphs with modified distances converge jointly with their dual triangulation to the Brownian sphere
Random cubic planar graphs converge to the Brownian sphere
In this paper, the scaling limit of random connected cubic planar graphs
(respectively multigraphs) is shown to be the Brownian sphere.
The proof consists in essentially two main steps. First, thanks to the known
decomposition of cubic planar graphs into their 3-connected components, the
metric structure of a random cubic planar graph is shown to be well
approximated by its unique 3-connected component of linear size, with modified
distances.
Then, Whitney's theorem ensures that a 3-connected cubic planar graph is the
dual of a simple triangulation, for which it is known that the scaling limit is
the Brownian sphere. Curien and Le Gall have recently developed a framework to
study the modification of distances in general triangulations and in their
dual. By extending this framework to simple triangulations, it is shown that
3-connected cubic planar graphs with modified distances converge jointly with
their dual triangulation to the Brownian sphere.Comment: 55 page
Kertesz on Fat Graphs?
The identification of phase transition points, beta_c, with the percolation
thresholds of suitably defined clusters of spins has proved immensely fruitful
in many areas of statistical mechanics. Some time ago Kertesz suggested that
such percolation thresholds for models defined in field might also have
measurable physical consequences for regions of the phase diagram below beta_c,
giving rise to a ``Kertesz line'' running between beta_c and the bond
percolation threshold, beta_p, in the M, beta plane.
Although no thermodynamic singularities were associated with this line it
could still be divined by looking for a change in the behaviour of high-field
series for quantities such as the free energy or magnetisation. Adler and
Stauffer did precisely this with some pre-existing series for the regular
square lattice and simple cubic lattice Ising models and did, indeed, find
evidence for such a change in high-field series around beta_p. Since there is a
general dearth of high-field series there has been no other work along these
lines.
In this paper we use the solution of the Ising model in field on planar
random graphs by Boulatov and Kazakov to carry out a similar exercise for the
Ising model on random graphs (i.e. coupled to 2D quantum gravity). We generate
a high-field series for the Ising model on random graphs and examine
its behaviour for evidence of a Kertesz line
- …