90,864 research outputs found
Local limit of labeled trees and expected volume growth in a random quadrangulation
Exploiting a bijective correspondence between planar quadrangulations and
well-labeled trees, we define an ensemble of infinite surfaces as a limit of
uniformly distributed ensembles of quadrangulations of fixed finite volume. The
limit random surface can be described in terms of a birth and death process and
a sequence of multitype Galton--Watson trees. As a consequence, we find that
the expected volume of the ball of radius around a marked point in the
limit random surface is .Comment: Published at http://dx.doi.org/10.1214/009117905000000774 in the
Annals of Probability (http://www.imstat.org/aop/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Geodesic rays in the uniform infinite half-planar quadrangulation return to the boundary
We show that all geodesic rays in the uniform infinite half-planar
quadrangulation (UIHPQ) intersect the boundary infinitely many times, answering
thereby a recent question of Curien. However, the possible intersection points
are sparsely distributed along the boundary. As an intermediate step, we show
that geodesic rays in the UIHPQ are proper, a fact that was recently
established by Caraceni and Curien (2015) by a reasoning different from ours.
Finally, we argue that geodesic rays in the uniform infinite half-planar
triangulation behave in a very similar manner, even in a strong quantitative
sense.Comment: 29 pages, 13 figures. Added reference and figur
Distributed Dominating Sets on Grids
This paper presents a distributed algorithm for finding near optimal
dominating sets on grids. The basis for this algorithm is an existing
centralized algorithm that constructs dominating sets on grids. The size of the
dominating set provided by this centralized algorithm is upper-bounded by
for grids and its difference
from the optimal domination number of the grid is upper-bounded by five. Both
the centralized and distributed algorithms are generalized for the -distance
dominating set problem, where all grid vertices are within distance of the
vertices in the dominating set.Comment: 10 pages, 9 figures, accepted in ACC 201
Prioritized Metric Structures and Embedding
Metric data structures (distance oracles, distance labeling schemes, routing
schemes) and low-distortion embeddings provide a powerful algorithmic
methodology, which has been successfully applied for approximation algorithms
\cite{llr}, online algorithms \cite{BBMN11}, distributed algorithms
\cite{KKMPT12} and for computing sparsifiers \cite{ST04}. However, this
methodology appears to have a limitation: the worst-case performance inherently
depends on the cardinality of the metric, and one could not specify in advance
which vertices/points should enjoy a better service (i.e., stretch/distortion,
label size/dimension) than that given by the worst-case guarantee.
In this paper we alleviate this limitation by devising a suit of {\em
prioritized} metric data structures and embeddings. We show that given a
priority ranking of the graph vertices (respectively,
metric points) one can devise a metric data structure (respectively, embedding)
in which the stretch (resp., distortion) incurred by any pair containing a
vertex will depend on the rank of the vertex. We also show that other
important parameters, such as the label size and (in some sense) the dimension,
may depend only on . In some of our metric data structures (resp.,
embeddings) we achieve both prioritized stretch (resp., distortion) and label
size (resp., dimension) {\em simultaneously}. The worst-case performance of our
metric data structures and embeddings is typically asymptotically no worse than
of their non-prioritized counterparts.Comment: To appear at STOC 201
- …