Related papers: Consensus Division in an Arbitrary Ratio
Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…
In the "correlated sampling" problem, two players are given probability distributions $P$ and $Q$, respectively, over the same finite set, with access to shared randomness. Without any communication, the two players are each required to…
We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
We give a polynomial-time approximation algorithm for the (not necessarily metric) $k$-Median problem. The algorithm is an $\alpha$-size-approximation algorithm for $\alpha < 1 + 2 \ln(n/k)$. That is, it guarantees a solution having size at…
This is a survey of some recent results on the rational circulant covariance extension problem: Given a partial sequence $(c_0,c_1,\dots,c_n)$ of covariance lags $c_k=\mathbb{E}\{y(t+k)\overline{y(t)}\}$ emanating from a stationary periodic…
In this paper we discuss the existence, uniqueness and regularity of solutions of the following system of coupled semilinear Poisson equations on a smooth bounded domain $\Omega$ in $\mathbb{R}^n$: \[ \left\{{llll} \mathcal{A}^s u= v^p &…
In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…
Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer parameter $L>0$, an {\em $L$-bounded cut} is a subset $F$ of edges (vertices) such that the every path between $s$ and $t$ in $G\setminus F$ has length more…
Two fractional two-phase Stefan-like problems are considered by using Riemann-Liouville and Caputo derivatives of order $\alpha \in (0, 1)$ verifying that they coincide with the same classical Stefan problem at the limit case when…
Refining an argument of the second author, we improve the known bounds for the number of rational points near a submanifold of $\mathbb{R}^d$ of intermediate dimension under a natural curvature condition. Furthermore, in the codimension $2$…
We study the Requirement Cut problem, a generalization of numerous classical graph partitioning problems including Multicut, Multiway Cut, $k$-Cut, and Steiner Multicut among others. Given a graph with edge costs, terminal groups $(S_1,…
A new class of high-order maximum principle preserving numerical methods is proposed for solving parabolic equations, with application to the semilinear Allen--Cahn equation. The proposed method consists of a $k$th-order multistep…
We show that if $-A$ generates a bounded $\alpha$-times resolvent family for some $\alpha \in (0,2]$, then $-A^{\beta}$ generates an analytic $\gamma$-times resolvent family for $\beta \in(0,\frac{2\pi-\pi\gamma}{2\pi-\pi\alpha})$ and…
We study the computational complexity of decision problems in $k$-level linear programming (LP). Seminal work by Jeroslow establishes that determining whether the optimal objective value of a $k$-level LP is at least as good as a given…
For an edge-weighted connected undirected graph, the minimum $k$-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into $k$ connected components. The problem is NP-hard when $k$ is part…
Stochastic approximation (SA) is a classical approach for stochastic convex optimization. Previous studies have demonstrated that the convergence rate of SA can be improved by introducing either smoothness or strong convexity condition. In…
A semilinear initial-boundary value problem with a Caputo time derivative of fractional order $\alpha\in(0,1)$ is considered, solutions of which typically exhibit a singular behaviour at an initial time. For L1-type discretizations of this…
In this work we study the existence of positive solution to the fractional quasilinear problem, $$ \left\{ \begin{array}{rcll} (-\Delta )^s u &=&\lambda \dfrac{u}{|x|^{2s}}+ |\nabla u|^{p}+ \mu f &\inn \Omega,\\ u&>&0 & \inn\Omega,\\ u&=&0…
Sparse principal component analysis (PCA) is a popular dimensionality reduction technique for obtaining principal components which are linear combinations of a small subset of the original features. Existing approaches cannot supply…