Numerical evidence against a conjecture on the cover time of planar graphs

J. Ricardo G. Mendonça
Phys. Rev. E 84, 022103 – Published 25 August 2011

Abstract

We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time τ(GN) of a planar graph GN of N vertices and maximal degree d is lower bounded by τ(GN)CdN(lnN)2 with Cd=(d/4π)tan(π/d), with equality holding for some geometries. We tested this conjecture on the regular honeycomb (d=3), regular square (d=4), regular elongated triangular (d=5), and regular triangular (d=6) lattices, as well as on the nonregular Union Jack lattice (dmin=4, dmax=8). Indeed, the Monte Carlo data suggest that the rigorous lower bound may hold as an equality for most of these lattices, with an interesting issue in the case of the Union Jack lattice. The data for the honeycomb lattice, however, violate the bound with the conjectured constant. The empirical probability distribution function of the cover time for the square lattice is also briefly presented, since very little is known about cover time probability distribution functions in general.

  • Figure
  • Figure
  • Figure
  • Received 20 June 2011

DOI:https://doi.org/10.1103/PhysRevE.84.022103

©2011 American Physical Society

Authors & Affiliations

J. Ricardo G. Mendonça*

  • Instituto de Física, Universidade de São Paulo, Caixa Postal 66318, CEP 05314-970 São Paulo, SP, Brazil

  • *jricardo@if.usp.br

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 84, Iss. 2 — August 2011

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×