Related papers: Concentration of cones in the Alt-Phillips problem
The degree-constrained subgraph problem asks for a subgraph of a given graph such that the degree of each vertex is within some specified bounds. We study the following reconfiguration variant of this problem: Given two solutions to a…
By a perturbative argument, we construct solutions for a plasma-type problem with two opposite-signed sharp peaks at levels $1$ and $-\gamma$, respectively, where $0<\gamma<1$. We establish some physically relevant qualitative properties…
Nonlinear convex problems arise in various areas of applied mathematics and engineering. Classical techniques such as the relaxed proximal point algorithm (PPA) and the prediction correction (PC) method were proposed for linearly…
We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the codomain of the constraint mapping are smooth manifolds. We…
We identify a new sufficient condition for the finite convergence of moment relaxations of polynomial optimization problems with correlative sparsity. This condition, which follows from a solution to a correlatively sparse version of the…
We consider a Hamiltonian describing three quantum particles in dimension one interacting through two-body short-range potentials. We prove that, as a suitable scale parameter in the potential terms goes to zero, such Hamiltonian converges…
We are presenting a simple and numerical stable algorithm for the solution of the cone projection problem which is suitable for relative small data sets and for simulation purposes needed for convexity tests. Not even one pseudo-inverse…
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
We consider a fractional version of Gauss capillarity energy. A suitable extension problem is introduced to derive a boundary monotonicity formula for local minimizers of this fractional capillarity energy. As a consequence, blow-up limits…
This paper studies how close random graphs are typically to their expectations. We interpret this question through the concentration of the adjacency and Laplacian matrices in the spectral norm. We study inhomogeneous Erd\"os-R\'enyi random…
The aim of this paper is to study the critical elliptic equations with Stein-Weiss type convolution parts $$ \displaystyle-\Delta u =\frac{1}{|x|^{\alpha}}\left(\int_{\mathbb{R}^{N}}\frac{|u(y)|^{2_{\alpha,…
The anti-continuum limit of a monotone variational recurrence relation consists of a lattice of uncoupled particles in a periodic background. This limit supports many trivial equilibrium states that persist as solutions of the model with…
Consider the directed polymer in one space dimension in log-gamma environment with boundary conditions, introduced by Sepp{\"a}l{\"a}inen. In the equilibrium case, we prove that the end point of the polymer converges in law as the length…
The study of domination in graphs has led to a variety of domination problems studied in the literature. Most of these follow the following general framework: Given a graph $G$ and an integer $k$, decide if there is a set $S$ of $k$…
By a combination of variational and topological techniques in the presence of invariant cones, we detect a new type of positive axially symmetric solutions of the Dirichlet problem for the elliptic equation $$ -\Delta u + u = a(x)|u|^{p-2}u…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
Spinning particle models can be used to describe higher spin fields in first quantization. In this paper we discuss how spinning particles with gauged O(N) supersymmetries on the worldline can be consistently coupled to conformally flat…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
The problem of constrained clustering has attracted significant attention in the past decades. In this paper, we study the balanced $k$-center, $k$-median, and $k$-means clustering problems where the size of each cluster is constrained by…
In this paper we analyze the asymptotic behavior of several fractional eigenvalue problems by means of Gamma-convergence methods. This method allows us to treat different eigenvalue problems under a unified framework. We are able to recover…