Estimation of Parameters of PTRC SRGM using Non-informative Priors

Reliability is an essentially important characteristic of software. The reliability of software has been assessed by considering Poisson Type occurrence of software failures and the failure intensity of one parameter say (η_1 ) Rayleigh class. Here, it is assumed that the software contains fixed number of inherent faults say (η_0 ). The scale parameter of Rayleigh density (η_1 ) and fixed number of inherent faults contained in software are the parameters of interest. The failure intensity and mean failure function of this Poisson Type Rayleigh Class (PTRC) Software Reliability Growth Model (SRGM) have been studied. The estimates of above parameters can be obtained by using maximum likelihood method. Bayesian technique has been used to about estimates of η_0 and η_1 if prior knowledge about these parameters is available. The prior knowledge about these parameters is considered in the form of non- informative priors for both the parameters. The proposed Bayes estimators are compared with their corresponding maximum likelihood estimators on the basis of risk efficiencies under squared error loss. The Monte Carlo simulation technique is used for calculating risk efficiencies. It is seen that both the proposed Bayes estimators can be preferred over corresponding MLEs for the proper choice of the values of execution time.

Characterizations of Herglotz–Nevanlinna Functions Using Positive Semi-Definite Functions and the Nevanlinna Kernel in Several Variables

In this paper, we give several characterizations of Herglotz–Nevanlinna functions in terms of a specific type of positive semi-definite functions called Poisson-type functions. This allows us to propose a multidimensional analogue of the classical Nevanlinna kernel and a definition of generalized Nevanlinna functions in several variables. Furthermore, a characterization of the symmetric extension of a Herglotz–Nevanlinna function is also given. The subclass of Loewner functions is discussed as well, along with an interpretation of the main result in terms of holomorphic functions on the unit polydisk with non-negative real part.

Complete Gradient Estimates of Quantum Markov Semigroups

In this article we introduce a complete gradient estimate for symmetric quantum Markov semigroups on von Neumann algebras equipped with a normal faithful tracial state, which implies semi-convexity of the entropy with respect to the recently introduced noncommutative 2-Wasserstein distance. We show that this complete gradient estimate is stable under tensor products and free products and establish its validity for a number of examples. As an application we prove a complete modified logarithmic Sobolev inequality with optimal constant for Poisson-type semigroups on free group factors.

Distributions for Nonsymmetric Monotone and Weakly Monotone Position Operators

We study the vacuum distribution, under an appropriate scaling, of a family of partial sums of nonsymmetric position operators on weakly monotone and monotone Fock spaces, respectively. We preliminary treat the case of weakly monotone Fock space, and show that any single operator has the vacuum law belonging to the free Meixner class. After establishing some relations between the combinatorics of Motzkin and Riordan paths, we give a recursive formula for the vacuum moments of the law of any finite sum. Since the operators are monotone independent, the distribution is the monotone convolution of the free Meixner law above. We also investigate the asymptotic measure for these sums, which can be seen as “Poisson type” limit law. It turns out to belong to the free Meixner class, with an atomic and an absolutely continuous part (w.r.t. the Lebesgue measure). Finally, we briefly apply analogous considerations to the case of monotone Fock space.

ON APPROXIMATION OF FUNCTIONS FROM ZYGMUND CLASSES BY BIHARMONIC POISSON INTEGRALS

The paper is devoted to a behavior investigation of the upper bound of deviation of functions from Zygmund classes from their biharmonic Poisson integrals. Systematic research in this direction was conducted by a number of Ukrainian as well as foreign scientists. But most of the known results relate to an estimation of deviations of functions from different classes from operators that were constructed based on triangular l-methods of the Fourier series summation (Fejer, Valle Poussin, Riesz, Rogozinsky, Steklov, Favard, etc.). Concerning the results relating to linear methods of the Fourier series summation, given by a set of functions of natural argument (Abel-Poisson, Gauss-Weierstrass, biharmonic and threeharmonic Poisson integrals), in this direction the progress was less notable. This may be due to the fact that the above-mentioned linear methods the Fourier series summation are solutions of corresponding integral and differential equations of elliptic type. And, therefore, they require more time-consuming calculations in order to obtain some estimates, that are suitable for a direct use for applied purposes. At the same time, in the present paper we investigate approximative characteristics of linear positive Poisson-type operators on Zygmund classes of functions. According to the well-known results by P.P. Korovkin, these positive linear operators realize the best asymptotic approximation of functions from Zygmund classes. Thus, the estimate obtained in this paper for the deviation of functions from Zygmund classes from their biharmonic Poisson integrals (the least studied and most valuable among all linear positive operators) is relevant from the viewpoint of applied mathematics.

Combinatorial anti-concentration inequalities, with applications

We prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn, we prove some “Poisson-type” anti-concentration theorems that give bounds of the form 1/e + o(1) for the point probabilities of certain polynomials. Second, we prove an anti-concentration inequality for polynomials with nonnegative coefficients which extends the classical Erdős–Littlewood–Offord theorem and improves a theorem of Meka, Nguyen and Vu for polynomials of this type. As an application, we prove some new anti-concentration bounds for subgraph counts in random graphs.

Joint Poisson distribution of prime factors in sets

Abstarct Given disjoint subsets T1, …, Tm of “not too large” primes up to x, we establish that for a random integer n drawn from [1, x], the m-dimensional vector enumerating the number of prime factors of n from T1, …, Tm converges to a vector of m independent Poisson random variables. We give a specific rate of convergence using the Kubilius model of prime factors. We also show a universal upper bound of Poisson type when T1, …, Tm are unrestricted, and apply this to the distribution of the number of prime factors from a set T conditional on n having k total prime factors.