Related papers: Effective Topological Degree Computation Based on …
In this paper we analyze the necessary number of samples to estimate the gradient of any multidimensional smooth (possibly non-convex) function in a zero-order stochastic oracle model. In this model, an estimator has access to noisy values…
We revisit the problem of designing sublinear algorithms for estimating the average degree of an $n$-vertex graph. The standard access model for graphs allows for the following queries: sampling a uniform random vertex, the degree of a…
The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…
Automatic numerical algorithms attempt to provide approximate solutions that differ from exact solutions by no more than a user-specified error tolerance. The computational cost is often determined \emph{adaptively} by the algorithm based…
Let $\pi$ be a factor code from a one dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$. If $\pi$ is finite-to-one then the number of preimages of a typical point in $Y$ is an invariant called the degree of $\pi$. In…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…
Robust topology optimization (RTO), as a class of topology optimization problems, identifies a design with the best average performance while reducing the response sensitivity to input uncertainties, e.g. load uncertainty. Solving RTO is…
There is a way of assigning a realizability notion to each degree of incomputability. In our setting, we make use of Weihrauch degrees (degrees of incomputability/discontinuity of partial multi-valued functions) to obtain Lifschitz-like…
We exhibit an algorithm that, given input a curve $X$ over a number field, computes as output the minimal degree of a Belyi map $X \to \mathbb{P}^1$.
The number of equations needed to cut out a variety given by an ideal is called the arithmetic rank (of the ideal). It was shown in [8] that the notion of arithmetic rank is strongly related to the concept of regular sequences on the Matlis…
Studying ceratin combinatorial properties of non-unique factorizations have been a subject of recent literatures. Little is known about two combinatorial invariants, namely the catenary degree and the tame degree, even in the case of…
In this note we give an overview of various quantities that are used to measure the complexity of an algebraic dynamical system f:X-->X, including the dynamical degree d(f), which gives a coarse measure of the geometric complexity of the…
Temporal difference (TD) learning is a fundamental algorithm for estimating value functions in reinforcement learning. Recent finite-time analyses of TD with linear function approximation quantify its theoretical convergence rate. However,…
We consider the prospect of a processor that can perform interval arithmetic at the same speed as conventional floating-point arithmetic. This makes it possible for all arithmetic to be performed with the superior security of interval…
We present a detailed study of roundoff errors in probabilistic floating-point computations. We derive closed-form expressions for the distribution of roundoff errors associated with a random variable, and we prove that roundoff errors are…
This paper presents a parallel algorithm for calculating the eight-directional (D8) up-slope contributing area in digital elevation models (DEMs). In contrast with previous algorithms, which have potentially unbounded inter-node…
These notes survey and explore an emerging method, which we call the low-degree method, for predicting and understanding statistical-versus-computational tradeoffs in high-dimensional inference problems. In short, the method posits that a…
In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…
For a continuous map on a topological graph containing a unique loop S it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
The work is devoted to the construction of a new type of intervals -- functional intervals. These intervals are built on the idea of expanding boundaries from numbers to functions. Functional intervals have shown themselves to be promising…