38 research outputs found
One-loop diagrams in the Random Euclidean Matching Problem
The matching problem is a notorious combinatorial optimization problem that
has attracted for many years the attention of the statistical physics
community. Here we analyze the Euclidean version of the problem, i.e. the
optimal matching problem between points randomly distributed on a
-dimensional Euclidean space, where the cost to minimize depends on the
points' pairwise distances. Using Mayer's cluster expansion we write a formal
expression for the replicated action that is suitable for a saddle point
computation. We give the diagrammatic rules for each term of the expansion, and
we analyze in detail the one-loop diagrams. A characteristic feature of the
theory, when diagrams are perturbatively computed around the mean field part of
the action, is the vanishing of the mass at zero momentum. In the non-Euclidean
case of uncorrelated costs instead, we predict and numerically verify an
anomalous scaling for the sub-sub-leading correction to the asymptotic average
cost.Comment: 17 pages, 7 figure
On the strong partition dimension of graphs
We present a different way to obtain generators of metric spaces having the
property that the ``position'' of every element of the space is uniquely
determined by the distances from the elements of the generators. Specifically
we introduce a generator based on a partition of the metric space into sets of
elements. The sets of the partition will work as the new elements which will
uniquely determine the position of each single element of the space. A set
of vertices of a connected graph strongly resolves two different vertices
if either or
, where . An ordered vertex partition of
a graph is a strong resolving partition for if every two different
vertices of belonging to the same set of the partition are strongly
resolved by some set of . A strong resolving partition of minimum
cardinality is called a strong partition basis and its cardinality the strong
partition dimension. In this article we introduce the concepts of strong
resolving partition and strong partition dimension and we begin with the study
of its mathematical properties. We give some realizability results for this
parameter and we also obtain tight bounds and closed formulae for the strong
metric dimension of several graphs.Comment: 16 page
Complexity Results for the Spanning Tree Congestion Problem
We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the complexity of this problem. First, we show that for every fixed k and d the problem to determine whether a given graph has spanning tree congestion at most k can be solved in linear time for graphs of degree at most d. In contrast, if we allow only one vertex of unbounded degree, the problem immediately becomes NP-complete for any fixed k ≥ 10. For very small values of k however, the problem becomes polynomially solvable. We also show that it is NP-hard to approximate the spanning tree congestion within a factor better than 11/10. On planar graphs, we prove the problem is NP-hard in general, but solvable in linear time for fixed k