Static search games played over graphs and general metric spaces

We define a general game which forms a basis for modelling situations of static search and concealment over regions with spatial structure. The game involves two players, the searching player and the concealing player, and is played over a metric space. Each player simultaneously chooses to deploy at a point in the space; the searching player receiving a payoff of 1 if his opponent lies within a predetermined radius r of his position, the concealing player receiving a payoff of 1 otherwise. The concepts of dominance and equivalence of strategies are examined in the context of this game, before focusing on the more specific case of the game played over a graph. Methods are presented to simplify the analysis of such games, both by means of the iterated elimination of dominated strategies and through consideration of automorphisms of the graph. Lower and upper bounds on the value of the game are presented and optimal mixed strategies are calculated for games played over a particular family of graphs.     

Unit-distance graphs in Minkowski metric spaces

The Unit-Distance Graph problem in Euclidean plane asks for the minimum number of colors, so that each point on the Euclidean plane can be assigned a single color with the condition that the points at unit distance apart are assigned different colors. It is well known that this number is between 4 and 7, but the exact value is not known. Here this problem is generalized to Minkowski metric spaces and once again the answer is shown to be between 4 and 7. In extreme special cases where the unit circle is a parallelogram or a hexagon the answer is shown to be exactly 4.     

On optimal realizations of finite metric spaces by graphs

Graph realizations of finite metric spaces have widespread applications, for example, in biology, economics, and information theory. The main results of this paper are:

1. Finding optimal realizations of integral metrics (which means all distances are integral) is NP-complete.
2. There exist metric spaces with a continuum of optimal realizations.

Furthermore, two conditions necessary for a weighted graph to be an optimal realization are given and an extremal problem arising in connection with the realization problem is investigated.     

A general metric regularity in asplund banach spaces

This paper establishes a simple and easily-applied criterion for determining whether a multivalued mapping is metrically regular relatively to a subset in the range space.     

On approximation of functions from Sobolev spaces on metric graphs

Some results on the approximation of functions from the Sobolev spaces on metric graphs by step functions are obtained. In particular, we show that the approximation numbers a_n of the embedding operator of the Sobolev space on a graph G of finite length |G| into the space , where μ is an arbitrary finite Borel measure on G, satisfy the inequality

     

Low distortion embeddings of some metric graphs into Banach spaces

We give a simple example of a countable metric graph M such that M Lipschitz embeds with distortion strictly less than 2 into a Banach space X only if X contains an isomorphic copy of l ₁. Further we show that, for each ordinal α < ω ₁, the space C([0, ω ^α ]) does not Lipschitz embed into C(K) with distortion strictly less than 2 unless K ^(α) ≠ 0. Also \(C\left( {\left[ {0,{\omega ^{{\omega ^\alpha }}}} \right]} \right)\) does not Lipschitz embed into a Banach space X with distortion strictly less than 2 unless Sz(X) ≥ ω ^α+1.     

A Representation theorem for probabilistic metric spaces in general

In this paper, we present a representation theorem for probabilistic metric spaces in general.     

Weak uncertainty principle for fractals, graphs and metric measure spaces

We develop a new approach to formulate and prove the weak uncertainty inequality, which was recently introduced by Okoudjou and Strichartz. We assume either an appropriate measure growth condition with respect to the effective resistance metric, or, in the absence of such a metric, we assume the Poincaré inequality and reverse volume doubling property. We also consider the weak uncertainty inequality in the context of Nash-type inequalities. Our results can be applied to a wide variety of metric measure spaces, including graphs, fractals and manifolds.

     

Moduli spaces of metric graphs of genus 1 with marks on vertices

In this paper we study homotopy type of certain moduli spaces of metric graphs. More precisely, we show that the spaces , which parametrize the isometry classes of metric graphs of genus 1 with n marks on vertices are homotopy equivalent to the spaces TM1,n, which are the moduli spaces of tropical curves of genus 1 with n marked points. Our proof proceeds by providing a sequence of explicit homotopies, with key role played by the so-called scanning homotopy. We conjecture that our result generalizes to the case of arbitrary genus.     

Ultrametricity and metric betweenness in tangent spaces to metric spaces

The paper deals with pretangent spaces to general metric spaces. An ultrametricity criterion for pretangent spaces is found and it is closely related to the metric betweenness in the pretangent spaces.     

Capacities in metric spaces

We discuss the potential theory related to the variational capacity and the Sobolev capacity on metric measure spaces. We prove our results in the axiomatic framework of [17].46E35, 31C15, 31C45     

Plasticity in metric spaces

In this paper we examine the properties of EC-plastic metric spaces, spaces which have the property that any noncontractive bijection from the space onto itself must be an isometry.     

Chirality in metric spaces

A definition of chirality based on group theory is presented. It is shown to be equivalent to the usual one in the case of Euclidean spaces, and it permits to define chirality in metric spaces which are not Euclidean.