Related papers: On the Non-Termination of Ruppert's Algorithm
The $k$-core of a graph is the largest subgraph of minimum degree at least $k$. We show that for $k$ sufficiently large, the $(k + 2)$-core of a random graph $\G(n,p)$ asymptotically almost surely has a spanning $k$-regular subgraph. Thus…
The $\chi$-stability index ${\rm es}_{\chi}(G)$ of a graph $G$ is the minimum number of its edges whose removal results in a graph with the chromatic number smaller than that of $G$. In this paper three open problems from [European J.\…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
The segment number of a planar graph $G$ is the smallest number of line segments needed for a planar straight-line drawing of $G$. Dujmovi\'c, Eppstein, Suderman, and Wood [CGTA'07] introduced this measure for the visual complexity of…
This paper presents a first-order {distributed continuous-time algorithm} for computing the least-squares solution to a linear equation over networks. Given the uniqueness of the solution, with nonintegrable and diminishing step size,…
The recently introduced graph parameter tree-cut width plays a similar role with respect to immersions as the graph parameter treewidth plays with respect to minors. In this paper, we provide the first algorithmic applications of tree-cut…
Dropout is a standard training technique for neural networks that consists of randomly deactivating units at each step of their gradient-based training. It is known to improve performance in many settings, including in the large-scale…
The worst-case expected length f(n) of the path taken by the simplex algorithm with the Random Edge pivot rule on a 3-dimensional linear program with n constraints is shown to be bounded by 1.3445 n <= f(n) <= 1.4943 n for large enough n.
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
The crossing resolution of a non-planar drawing of a graph is the value of the minimum angle formed by any pair of crossing edges. Recent experiments have shown that the larger the crossing resolution is, the easier it is to read and…
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…
In this paper, we shall study the Dirichlet problem for the minimal surfaces equation. We prove some results about the boundary behaviour of a solution of this problem. We describe the behaviour of a non-converging sequence of solutions in…
A mapping of avalanches occurring in the zero-temperature random-field Ising model (zt-RFIM) to life-periods of a population experiencing immigration is established. Such a mapping allows the microscopic criteria for occurrence of an…
For the right-angled Artin group action on the extension graph, it is known that the minimal asymptotic translation length is bounded above by 2 provided that the defining graph has diameter at least 3. In this paper, we show that the same…
In this note, we first recall the nonconvex problem setting and introduce the optimal PAGE algorithm (Li et al., ICML'21). Then we provide a simple and clean convergence analysis of PAGE for achieving optimal convergence rates. Moreover,…
We decrease the $rms$ mean curvature and area of a variable surface with a fixed boundary by iterating a few times through a curvature-based variational algorithm. For a boundary with a known minimal surface, starting with a deliberately…
The aim of the paper is to introduce a new systematic method that can produce lower bounds for eigenvalues. The main idea is to use nonconforming finite element methods. The general conclusion herein is that if local approximation…
In this paper, we prove that any parameter ray at a non-recurrent angle $\theta$ lands at a non-recurrent parameter $c$ with $\theta$ a characteristic angle of $f_c$; and conversely, every non-recurrent parameter $c$ is the landing point of…
In this paper, we obtain the finite-horizon and infinite-horizon ruin probability asymptotics for risk processes with claims of subexponential tails for non-stationary arrival processes that satisfy a large deviation principle. As a result,…
The crossing angle of a straight-line drawing $\Gamma$ of a graph $G=(V, E)$ is the smallest angle between two crossing edges in $\Gamma$. Deciding whether a graph $G$ has a straight-line drawing with a crossing angle of $90^\circ$ is…