56,910 research outputs found
On the partition dimension of trees
Given an ordered partition of the vertex set
of a connected graph , the \emph{partition representation} of a vertex
with respect to the partition is the vector
, where represents the
distance between the vertex and the set . A partition of is
a \emph{resolving partition} of if different vertices of have different
partition representations, i.e., for every pair of vertices ,
. The \emph{partition dimension} of is the minimum
number of sets in any resolving partition of . In this paper we obtain
several tight bounds on the partition dimension of trees
Two-Level Rectilinear Steiner Trees
Given a set of terminals in the plane and a partition of into
subsets , a two-level rectilinear Steiner tree consists of a
rectilinear Steiner tree connecting the terminals in each set
() and a top-level tree connecting the trees . The goal is to minimize the total length of all trees. This problem
arises naturally in the design of low-power physical implementations of parity
functions on a computer chip.
For bounded we present a polynomial time approximation scheme (PTAS) that
is based on Arora's PTAS for rectilinear Steiner trees after lifting each
partition into an extra dimension. For the general case we propose an algorithm
that predetermines a connection point for each and
().
Then, we apply any approximation algorithm for minimum rectilinear Steiner
trees in the plane to compute each and independently.
This gives us a -factor approximation with a running time of
suitable for fast practical computations. The
approximation factor reduces to by applying Arora's approximation scheme
in the plane
Rate of convergence for polymers in a weak disorder
We consider directed polymers in random environment on the lattice Z d at
small inverse temperature and dimension d 3. Then, the normalized
partition function W n is a regular martingale with limit W. We prove that n
(d--2)/4 (W n -- W)/W n converges in distribution to a Gaussian law. Both the
polynomial rate of convergence and the scaling with the martingale W n are
different from those for polymers on trees
Random trees between two walls: Exact partition function
We derive the exact partition function for a discrete model of random trees
embedded in a one-dimensional space. These trees have vertices labeled by
integers representing their position in the target space, with the SOS
constraint that adjacent vertices have labels differing by +1 or -1. A
non-trivial partition function is obtained whenever the target space is bounded
by walls. We concentrate on the two cases where the target space is (i) the
half-line bounded by a wall at the origin or (ii) a segment bounded by two
walls at a finite distance. The general solution has a soliton-like structure
involving elliptic functions. We derive the corresponding continuum scaling
limit which takes the remarkable form of the Weierstrass p-function with
constrained periods. These results are used to analyze the probability for an
evolving population spreading in one dimension to attain the boundary of a
given domain with the geometry of the target (i) or (ii). They also translate,
via suitable bijections, into generating functions for bounded planar graphs.Comment: 25 pages, 7 figures, tex, harvmac, epsf; accepted version; main
modifications in Sect. 5-6 and conclusio
Simulations of lattice animals and trees
The scaling behaviour of randomly branched polymers in a good solvent is
studied in two to nine dimensions, using as microscopic models lattice animals
and lattice trees on simple hypercubic lattices. As a stochastic sampling
method we use a biased sequential sampling algorithm with re-sampling, similar
to the pruned-enriched Rosenbluth method (PERM) used extensively for linear
polymers. Essentially we start simulating percolation clusters (either site or
bond), re-weigh them according to the animal (tree) ensemble, and prune or
branch the further growth according to a heuristic fitness function. In
contrast to previous applications of PERM, this fitness function is {\it not}
the weight with which the actual configuration would contribute to the
partition sum, but is closely related to it. We obtain high statistics of
animals with up to several thousand sites in all dimension 2 <= d <= 9. In
addition to the partition sum (number of different animals) we estimate
gyration radii and numbers of perimeter sites. In all dimensions we verify the
Parisi-Sourlas prediction, and we verify all exactly known critical exponents
in dimensions 2, 3, 4, and >= 8. In addition, we present the hitherto most
precise estimates for growth constants in d >= 3. For clusters with one site
attached to an attractive surface, we verify the superuniversality of the
cross-over exponent at the adsorption transition predicted by Janssen and
Lyssy. Finally, we discuss the collapse of animals and trees, arguing that our
present version of the algorithm is also efficient for some of the models
studied in this context, but showing that it is {\it not} very efficient for
the `classical' model for collapsing animals.Comment: 17 pages RevTeX, 29 figures include
- …