In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by conjoining “building block” subsets of length three in V(G). We prove the correctness of this algorithm and present an asymptotic time complexity analysis of...

The recent introduction of a boundary stress tensor for asymptotically flat spacetimes enabled a new construction of energy, momentum, and Lorentz charges. These charges are known to generate the asymptotic symmetries of the theory, but their explicit formulas are not identical to previous constructions in the literature. This paper corrects an earlier comparison with other approaches, includin...

Abstract. Maximum likelihood (ML) estimation based on bivariate record data is considered as the general inference problem. Assume that the process of observing k records is repeated m times, independently. The asymptotic properties including consistency and asymptotic normality of the Maximum Likelihood (ML) estimates of parameters of the underlying distribution is then established, when m is ...

In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...

In this paper we develop an asymptotic theory for estimation based on signed ranks in the ARMA model when the innovation density is symmetrical. We provide two classes of estimators and we establish their asymptotic normality with the help of the asymptotic properties for serial signed rank statistics. Finally, we compare our procedure to the one of least-squares, and we illustrate the performa...

It is highly plausible that the region of space-time far from an isolated gravitating body is, in some sense, asymptotically Minkowskian. However theoretical studies of the full nonlin-ear theory, initiated by Bondi et al. careful, clever, a-priori choices of chart (and tetrad) and so are not readily accessible to the numerical relativist, who chooses her/his chart on the basis of quite differe...

Recently, a word-valued source has been proposed as a new class of information source models. A word-valued source is regarded as a source with a probability distribution over a word set. Although a word-valued source is a nonstationary source in general, it has been proved that an entropy rate of the source exists and the Asymptotic Equipartition Property (AEP) holds when the word set of the s...

In this study, the stochastic restricted and unrestricted two-parameter estimators of fixed and random effects are investigated in the linear mixed measurement error models. For this purpose, the asymptotic properties and then the comparisons under the criterion of mean squared error matrix (MSEM) are derived. Furthermore, the proposed methods are used for estimating the biasing parameters. Fin...

we present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step q-superlinear convergence. the approach is based on an adaptive structured scheme due to mahdavi-amiri and bartels of the exact penalty method of coleman and conn for nonlinearly constrained optimization problems. the structured adaptation also makes use of the ideas of n...

We introduce a new measure of manipulability of anonymous voting rules, which reflects both the size and the prevalence of the manipulating coalitions. We give a simple common framework that describes this and previously known measures and connects them to recent literature. We discuss aspects of computation of the measures and present exact numerical results in the case of 3 candidates that al...