Related papers: Minimal Lipschitz and $\infty$-Harmonic Extensions…

In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…

This paper proposes a mechanism to produce equivalent Lipschitz surrogates for zero-norm and rank optimization problems by means of the global exact penalty for their equivalent mathematical programs with an equilibrium constraint (MPECs).…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

We consider adaptations of the Mumford-Shah functional to graphs. These are based on discretizations of nonlocal approximations to the Mumford-Shah functional. Motivated by applications in machine learning we study the random geometric…

In this paper we consider the minimization of a novel class of fractional linear growth functionals involving the Riesz fractional gradient. These functionals lack the coercivity properties in the fractional Sobolev spaces needed to apply…

The aim of this paper is to deal with the asymptotics of generalized Orlicz norms when the lower growth rate tends to infinity. $\Gamma$-convergence results and related representation theorems in terms of $L^\infty$ functionals are proven…

We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…

We give sufficient conditions for a metric space to bilipschitz embed in L_1. In particular, if X is a length space and there is a Lipschitz map u:X--->R such that for every interval I in R, the connected components of the inverse image…

The linear complementarity problem is a continuous optimization problem that generalizes convex quadratic programming, Nash equilibria of bimatrix games and several such problems. This paper presents a continuous optimization formulation…

We prove that, given~$p>\max\left\{\frac{2n}{n+2},1\right\}$, the nonnegative almost minimizers of the nonlinear free boundary functional $$ J_p(u,\Omega):=\int_{\Omega}\Big( |\nabla u(x)|^p+\chi_{\{u>0\}}(x)\Big)\,dx$$ are Lipschitz…

A mixed graph is obtained from an unoriented graph by orienting a subset of its edges. Yu, Liu, and Qu in 2017 have established the expression for the determinant of Hermitian (quasi-) Laplacian matrix of a mixed graph. Here we find general…

The tent map is an elementary example of an interval map possessing many interesting properties, such as dense periodicity, exactness, Lipschitzness and a kind of length-expansiveness. It is often used in constructions of dynamical systems…

We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…

A highly influential ingredient of many techniques designed to exploit sparsity in numerical optimization is the so-called chordal extension of a graph representation of the optimization problem. The definitive relation between chordal…

We give necessary and sufficient conditions for interpolation inequalities of the type considered by Marcinkiewicz and Zygmund to be true in the case of Banach space-valued polynomials and Jacobi weights and nodes. We also study the…

We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for decomposable functions, improving Janson's Hoeffding-type…

Having studied families of antiderivatives and their envelopes in the setting of classical convex analysis, we now extend and apply these notions and results in settings of abstract convex analysis. Given partial data regarding a…

Let (X, d) be a quasi-convex, complete and separable metric space with reference probability measure m. We prove that the set of of real valued Lipschitz function with non zero point-wise Lipschitz constant m-almost everywhere is residual,…

In this paper we provide a characterization of intrinsic Lipschitz graphs in the sub-Riemannian Heisenberg groups in terms of their distributional gradients. Moreover, we prove the equivalence of different notions of continuous weak…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…