Graph-indexed random walks (or equivalently M -Lipschitz mappings of graphs) are a generalization of standard random walk on Z. For M ∈ N, an M-Lipschitz mapping of a connected rooted graph G = (V,E) is a mapping f : V → Z such that root is mapped to zero and for every edge (u, v) ∈ E we have |f(u) − f(v)| ≤ M . We study two natural problems regarding graph-indexed random walks. 1. Computing th...

We investigate the interplay between the existence of fat triangulations, PL approximations of Lipschitz–Killing curvatures and the existence of quasiconformal mappings. In particular we prove that if there exists a quasiconformal mapping between two PL or smooth n-manifolds, then their Lipschitz–Killing curvatures are bilipschitz equivalent. An extension to the case of almost Riemannian manifo...

In the context of a strongly local Dirichlet space we show that if a function mapping the real line to itself (and fixing the origin) operates by composition on the left to map the Dirichlet space into itself, then the function is necessarily locally Lipschitz continuous. If, in addition, the Dirichlet space contains unbounded elements, then the function must be globally Lipschitz continuous. T...

Lipschitz self mappings of metric spaces appear in many branches of mathematics. In this paper we introduce a modification of the Lipschitz condition which takes into account not only the mapping itself but also the behaviour of a finite number of its iterates. We refer to such mappings as mean Lipschitzian. The study of this new class of mappings seems potentially interesting and leads to some...

in this paper we propose a descent method for solving variational inequality problems where the underlying operator is nonsmooth, locally Lipschitz, and monotone over a closed, convex feasible set. The idea is to combine a descent method for variational inequality problems whose operators are nonsmooth, locally Lipschitz, and strongly monotone, with the Tikonov-Browder regularization technique....

The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping in the intermediate sense and the set of solutions of a variational inequality problem for a monotone and Lipschitz continuous mapping. We introduce an extragradient-like iterative algorithm that is based on the extragradient-like a...

In this paper, we propose a new iteration method based on the hybrid steepest descent method and Ishikawa-type method for seeking a solution of a variational inequality involving a Lipschitz continuous and strongly monotone mapping on the set of common fixed points for a finite family of Lipschitz continuous and quasi-pseudocontractive mappings in a real Hilbert space. MSC: Primary 41A65; 47H17...

If u 7→ A(u) is a C0,α-mapping, for 0 < α ≤ 1, having as values unbounded self-adjoint operators with compact resolvents and common domain of definition, parametrized by u in an (even infinite dimensional) space, then any continuous (in u) arrangement of the eigenvalues of A(u) is indeed C0,α in u. Theorem. Let U ⊆ E be a c∞-open subset in a convenient vector space E, and 0 < α ≤ 1. Let u 7→ A(...

In this paper we introduce a viscosity relaxed-extragradient method for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for a monotone, Lipschitz-continuous mapping in a real Hilbert space H . The viscosity relaxed-extragradient method is based on two methods: extragradientlike approximation method and ...

Let X be a real or complex Banach space and Y be a normed linear space. Suppose that f:X → Y is a Frechet differentiable function and F:X ⇉ 2 is a set-valued mapping with closed graph. Uniform convergence of Chord method for solving generalized equation y ∈ f x + F x ...... . (∗), where y ∈ Y a parameter, is studied in the present paper. More clearly, we obtain the uniform convergence of the se...