Related papers: Splitting algorithm and normed convergence for dra…
There has been significant recent progress on algorithms for approximating graph spanners, i.e., algorithms which approximate the best spanner for a given input graph. Essentially all of these algorithms use the same basic LP relaxation, so…
We investigate the asymptotic structure of a random perfect graph $P_n$ sampled uniformly from the perfect graphs on vertex set $\{1,\ldots,n\}$. Our approach is based on the result of Pr\"omel and Steger that almost all perfect graphs are…
Here we present well-posedness results for first order stochastic differential inclusions, more precisely for sweeping process with a stochastic perturbation. These results are provided in combining both deterministic sweeping process…
We analyze a semi-discrete splitting method for conservation laws driven by a semilinear noise term. Making use of fractional $BV$ estimates, we show that the splitting method produces a compact sequence of approximate solutions converging…
This paper presents a class of new algorithms for distributed statistical estimation that exploit divide-and-conquer approach. We show that one of the key benefits of the divide-and-conquer strategy is robustness, an important…
Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the blow-up lemma. Intuitively, this means that there exists a…
Fractional Klein-Kramers equation can well describe subdiffusion in phase space. In this paper, we develop the fully discrete scheme for fractional Klein-Kramers equation based on the backward Euler convolution quadrature and local…
We analyze the local convergence of proximal splitting algorithms to solve optimization problems that are convex besides a rank constraint. For this, we show conditions under which the proximal operator of a function involving the rank…
Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…
In this work, we study the numerical approximation of a class of singular fully coupled forward backward stochastic differential equations. These equations have a degenerate forward component and non-smooth terminal condition. They are…
Given a set of 2-dimensional (2-D) scattering points, which are usually obtained from the edge detection process, the aim of ellipse fitting is to construct an elliptic equation that best fits the collected observations. However, some of…
The method of stable random projections is popular for efficiently computing the Lp distances in high dimension (where 0<p<=2), using small space. Because it adopts nonadaptive linear projections, this method is naturally suitable when the…
This article employs Schramm-Loewner Evolution to obtain intersection exponents for several chordal $SLE_{8/3}$ curves in a wedge. As $SLE_{8/3}$ is believed to describe the continuum limit of self-avoiding walks, these exponents correspond…
We study SLE$_\kappa(\rho)$ curves, with $\kappa$ and $\rho$ chosen so that the curves hit the boundary. More precisely, we study the sets on which the curves collide with the boundary at a prescribed "angle" and determine the almost sure…
Recently, the interpretability of deep learning has attracted a lot of attention. A plethora of methods have attempted to explain neural networks by feature visualization, saliency maps, model distillation, and so on. However, it is hard…
We present a new random walk for uniformly sampling high-dimensional convex bodies. It achieves state-of-the-art runtime complexity with stronger guarantees on the output than previously known, namely in R\'enyi divergence (which implies…
We introduce and study $\ell_p$-norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition of the vertex set into $k$ parts each containing exactly…
In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…
The subdiffusion equations with a Caputo fractional derivative of order $\alpha \in (0,1)$ arise in a wide variety of practical problems, which is describing the transport processes, in the force-free limit, slower than Brownian diffusion.…
The paper studies the rate of convergence of the weak Euler approximation for solutions to possibly completely degenerate SDEs driven by Levy processes, with Hoelder-continuous coefficients. It investigates the dependence of the rate on the…