We prove two stability results for Lipschitz functions on triangulable, compact metric spaces and consider applications of both to problems in systems biology. Given two functions, the first result is formulated in terms of the Wasserstein distance between their persistence diagrams and the second in terms of their total persistences.

Strong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently by the author and collaborators. To illustrate the power of these new results, we discuss applications in many different areas of mathematics, from combinatorial number theory to the theory of random ...

Given two functions f, g : {0, 1}n → {0, 1} a mapping ψ : {0, 1}n → {0, 1}n is said to be a mapping from f to g if it is a bijection and f(z) = g(ψ(z)) for every z ∈ {0, 1}n. In this paper we study Lipschitz mappings between boolean functions. Our first result gives a construction of a C-Lipschitz mapping from the Majority function to the Dictator function for some universal constant C. On the ...

A simple hierarchical structure is imposed on the set of Lipschitz functions on streams (i.e. sequences over a fixed alphabet set) under the standard metric. We prove that sets of non-expanding and contractive functions are closed under a certain coiterative construction. The closure property is used to construct new final stream coalgebras over finite alphabets. For an example, we show that th...

Control and state estimation of nonlinear systems satisfying a Lipschitz continuity condition have been important topics in nonlinear system theory for over three decades, resulting in a substantial amount of literature. The main criticism behind this approach, however, has been the restrictive nature of the Lipschitz continuity condition and the conservativeness of the related results. This wo...

This is one of a series of papers examining the interplay between differentiation theory for Lipschitz maps, X → V , and bi-Lipschitz nonembeddability, where X is a metric measure space and V is a Banach space. Here, we consider the case V = L, where differentiability fails. We establish another kind of differentiability for certain X , including R and H, the Heisenberg group with its Carnot-Ca...

We show, as our main theorem, that if a Lipschitz map from compact Riemannian manifold $M$ to connected $N$, where $\dim M \geq \dim N$, has no singular points on in the sense of Clarke, then admits smooth approximation via Ehresmann fibrations. also show Reeb sphere theorem for functions, i.e., closed function with exactly two is homeomorphic sphere.

We consider a pair of reflected Brownian motions in a Lipschitz planar domain starting from different points but driven by the same Brownian motion. First we construct such a pair of processes in a certain weak sense, since it is not known whether a strong solution to the Skorohod equation in Lipschitz domains exists. Then we prove that the distance between the two processes converges to zero w...

Write OK for the valuation ting, MK for the maximal ideal of K and kK for the residue field. Let us fix $ some uniformizer of K. We denote by acm : K → OK/(MK) the map sending some nonzero x ∈ K to x$−ord(x) mod MK , and sending zero to zero. This is a definable map. We denote by RV the union of K×/(1 +MK) and {0} and by rv : K → RV the quotient map. More generally, if m ∈ N∗, we set RVm = K×/(...

We propose a general scheme of reduction of a Lipschitz programming problem to a problem of minimizing increasing convex-along-rays function. It is based on the positively homogeneous extension of degree p of the objective function and projective transformation of IR n + onto the unit simplex. The application of cutting angle method to Lipschitz programming is considered.