We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first present an O(n log n)-time algorithm that produces a pseudo-triangulation of weight O(wt(M(S)) · log n) which is shown to be asymptotically worstcase optimal, i.e., there exists a point set S for which every pseudotriangulation has weight Ω(log n · wt(M(S))), where wt(M(S)) i...

In this paper, we use a unified framework to study Poisson stable (including stationary, periodic, quasi-periodic, almost automorphic, Birkhoff recurrent, recurrent in the sense of Bebutov, Levitan pseudo-periodic, pseudo-recurrent and stable) solutions for semilinear stochastic differential equations driven by infinite dimensional Lévy noise with large jumps. Under suitable conditions on drift...

The Nisan-Wigderson pseudo-random generator [NW94] was constructed to derandomize probabilistic algorithms under the assumption that there exist explicit functions which are hard for small circuits. We give the first explicit construction of a pseudo-random generator with asymptotically optimal seed length even when given a function which is hard for relatively small circuits. Generators with o...

In this paper, the two-stage procedure is considered for autoregressive parameters estimation in the p-order autoregressive model ( AR(p)). The point estimation and fixed-size confidence ellipsoids construction are investigated which are based on least-squares estimators. Performance criteria are shown including asymptotically risk efficient, asymptotically efficient, and asymptotically consist...

We discuss two constructions based on pseudo-random graphs: a bitprobe scheme with one-sided error that provides a very compact encoding for small sets from a large universe, and an asymptotically optimal randomized communication protocol that synchronizes remote strings of bits with a small Hamming distance. We show that in both cases rather standard derandomization technique (e.g., Nisan’s ge...

In this paper, we establish a weak convergence theorem and some strong convergence theorems of an explicit iteration process for a finite family of strictly asymptotically pseudo-contractive mappings in the intermediate sense and also establish a strong convergence theorem by a new hybrid method for above said iteration scheme and mappings in the setting of Hilbert spaces. AMS Mathematics Subje...

We propose a pseudo-market mechanism for no-transfer allocation of indivisible objects that honors priorities such as those in school choice. Agents are given token money, face priority-specific prices, and buy utility-maximizing assignments. The mechanism is asymptotically incentive compatible, and the resulting assignments are fair and constrained Pareto efficient. Hylland and Zeckhauser (197...

We consider cross-sectional data that exhibit no spatial correlation, but are feared to be spatially dependent. We demonstrate that a spatial version of the stochastic volatility model of …nancial econometrics, entailing a form of spatial autoregression, can explain such behaviour. The parameters are estimated by pseudo Gaussian maximum likelihood based on log-transformed squares, and consisten...