Realization of Metric Spaces as Inverse Limits, and Bilipschitz Embedding in L 1

We give sufficient conditions for a metric space to bilipschitz embed in L ₁. In particular, if X is a length space and there is a Lipschitz map ${u: X \rightarrow \mathbb R}$ such that for every interval ${I \subset \mathbb R}$ , the connected components of u ^?1(I) have diameter ${\leq {\rm const} \cdot {\rm diam}(I)}$ , then X admits a bilipschitz embedding in L ₁. As a corollary, the Laakso examples, (Geom Funct Anal 10(1):111–123, 2000), bilipschitz embed in L ₁, though they do not embed in any any Banach space with the Radon–Nikodym property (e.g. the space ? ₁ of summable sequences). The spaces appearing the statement of the bilipschitz embedding theorem have an alternate characterization as inverse limits of systems of metric graphs satisfying certain additional conditions. This representation, which may be of independent interest, is the initial part of the proof of the bilipschitz embedding theorem. The rest of the proof uses the combinatorial structure of the inverse system of graphs and a diffusion construction, to produce the embedding in L ₁.     

On the stochastic independence properties of hard-core distributions

A probability measurep on the set of matchings in a graph (or, more generally 2-bounded hypergraph) ishard-core if for some : [0,), the probabilityp(M) ofM is proportional to . We show that such distributions enjoy substantial approximate stochastic independence properties. This is based on showing that, withM chosen according to the hard-core distributionp, MP () the matching polytope of , and >0, if the vector ofmarginals, (Pr(AM):A an edge of ), is in (1–) MP (), then the weights (A) are bounded by someA(). This eventually implies, for example, that under the same assumption, with fixed, as the distance betweenA, B tends to infinity.Thought to be of independent interest, our results have already been applied in the resolutions of several questions involving asymptotic behaviour of graphs and hypergraphs (see [14, 16], [11]–[13]).Supported in part by NSFThis work forms part of the author's doctoral dissertation [16]; see also [17]. The author gratefully acknowledges NSERC for partial support in the form of a 1967 Science and Engineering Scholarship.     

Towards a new framework for evaluating systemic problem structuring methods

Operational researchers and social scientists often make significant claims for the value of systemic problem structuring and other participative methods. However, when they present evidence to support these claims, it is usually based on single case studies of intervention. There have been very few attempts at evaluating across methods and across interventions undertaken by different people. This is because, in any local intervention, contextual factors, the skills of the researcher and the purposes being pursued by stakeholders affect the perceived success or failure of a method. The use of standard criteria for comparing methods is therefore made problematic by the need to consider what is unique in each intervention. So, is it possible to develop a single evaluation approach that can support both locally meaningful evaluations and longer-term comparisons between methods? This paper outlines a methodological framework for the evaluation of systemic problem structuring methods that seeks to do just this.     

Differentiability of Lipschitz Maps from Metric Measure Spaces to Banach Spaces with the Radon–Nikodym Property

We prove the differentiability of Lipschitz maps X → V, where X denotes a PI space, i.e. a complete metric measure space satisfying a doubling condition and a Poincaré inequality, and V denotes a Banach space with the Radon–Nikodym Property (RNP). As a consequence, we obtain a bi-Lipschitz nonembedding theorem for RNP targets. The differentiation theorem depends on a new specification of the differentiable structure for PI spaces involving directional derivatives in the direction of velocity vectors to rectifiable curves. We give two different proofs of this, the second of which relies on a new characterization of the minimal upper gradient. There are strong implications for the infinitesimal structure of PI spaces which will be discussed elsewhere.     

A law of large numbers result for a bifurcating process with an infinite moving average representation

This paper derives a law of large numbers theorem for bifurcating processes defined on a perfect binary tree. This theorem can be viewed as a generalization of some results that have already appeared in the literature. For instance, all that is required of the bifurcating process is an infinite moving average representation with geometrically decaying coefficients and a finite moment assumption. In addition, the summands are assumed to belong to a flexible class of functions that satisfy a generalized Lipschitz type condition. These two criteria allow for an expansive range of applicability. Two examples are given as corollaries to the theorem.     

On using compressibility to detect when slime mould completed computation

Slime mould Physarum polycephalum is a single cell visible by an unaided eye. The slime mould optimizes its network of protoplasmic tubes in gradients of attractants and repellents. This behavior is interpreted as computation. Several prototypes of the slime mould computers were designed to solve problems of computation geometry, graphs, transport networks, and to implement universal computing circuits. Being a living substrate, the slime mould does not halt its behavior when a task is solved but often continues foraging the space thus masking the solution found. We propose to use temporal changes in compressibility of the slime mould patterns as indicators of the halting of the computation. Compressibility of a pattern characterizes the pattern's morphological diversity, that is, a number of different local configurations. At the beginning of computation the slime explores the space, thus generating less compressible patterns. After gradients of attractants and repellents are detected the slime spans data sites with its protoplasmic network and retracts scouting branches, thus generating more compressible patterns. We analyze the feasibility of the approach on results of laboratory experiments and computer modelling. © 2015 Wiley Periodicals, Inc. Complexity 21: 162–175, 2016     

The threshold for combs in random graphs

For let denote the tree consisting of an ‐vertex path with disjoint ‐vertex paths beginning at each of its vertices. An old conjecture says that for any the threshold for the random graph to contain is at . Here we verify this for with any fixed . In a companion paper, using very different methods, we treat the complementary range, proving the conjecture for (with ). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 794–802, 2016     

Diffeomorphism finiteness for manifolds with ricci curvature andL n/2-norm of curvature bounded

Partially supported by NSF Grants.     

A Homological Approach to Two Problems on Finite Sets

We propose a homological approach to two conjectures descended from the Erdös-Ko-Rado Theorem, one due to Chvátal and the other to Frankl and Füredi. We apply the method to reprove, and in one case improve, results of these authors related to their conjectures.     

Conformally invariant Monge-Ampère equations: Global solutions

In this paper we will examine a class of fully nonlinear partial differential equations which are invariant under the conformal group . These equations are elliptic and variational. Using this structure and the conformal invariance, we will prove a global uniqueness theorem for solutions in with a quadratic growth condition at infinity.