Decompositions of complete multipartite graphs

This paper answers a recent question of Dobson and Maruši? by partitioning the edge set of a complete bipartite graph into two parts, both of which are edge sets of arc-transitive graphs, one primitive and the other imprimitive. The first member of the infinite family is the one constructed by Dobson and Maruši?.     

Unification of a differential inclusion with parameter in the guidance problem

A differential inclusion (d.i.) with a parameter α ∈ ?, where ? is a compact set in a finite-dimensional Euclidean space is considered. The problem under study is one of guiding a d.i. to a given compact set M in the phase space of the d.i. at a fixed moment of time. Issues concerning the unification of the d.i. with a parameter are discussed. A specific feature of the present unification is that it is performed for a parameterdependent d.i. that cannot be initially structured by a vector function similar to those determining the dynamics of systems in control and conflict control problems.     

Evolution of a semilinear parabolic system for migration and selection without dominance

The semilinear parabolic system that describes the evolution of the gene frequencies in the diffusion approximation for migration and selection at a multiallelic locus without dominance is investigated. The population occupies a finite habitat of arbitrary dimensionality and shape (i.e., a bounded, open domain in Rd). The selection coefficients depend on position; the drift and diffusion coefficients may depend on position. The primary focus of this paper is the dependence of the evolution of the gene frequencies on λ, the strength of selection relative to that of migration. It is proved that if migration is sufficiently strong (i.e., λ is sufficiently small) and the migration operator is in divergence form, then the allele with the greatest spatially averaged selection coefficient is ultimately fixed. The stability of each vertex (i.e., an equilibrium with exactly one allele present) is completely specified. The stability of each edge equilibrium (i.e., one with exactly two alleles present) is fully described when either (i) migration is sufficiently weak (i.e., λ is sufficiently large) or (ii) the equilibrium has just appeared as λ increases. The existence of unexpected, complex phenomena is established: even if there are only three alleles and migration is homogeneous and isotropic (corresponding to the Laplacian), (i) as λ increases, arbitrarily many changes of stability of the edge equilibria and corresponding appearance of an internal equilibrium can occur and (ii) the conditions for protection or loss of an allele can both depend nonmonotonically on λ. Neither of these phenomena can occur in the diallelic case.     

A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline

This paper considers a simple discrete-time queueing model with two types (classes) of customers (types 1 and 2) each having their own dedicated server (servers A and B resp.). New customers enter the system according to a general independent arrival process, i.e., the total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. Service times are deterministically equal to 1 slot each. The system uses a “global FCFS” service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their types. As a consequence of the “global FCFS” rule, customers of one type may be blocked by customers of the other type, in that they may be unable to reach their dedicated server even at times when this server is idle, i.e., the system is basically non-workconserving. One major aim of the paper is to estimate the negative impact of this phenomenon on the queueing performance of the system, in terms of the achievable throughput, the system occupancy, the idle probability of each server and the delay. As it is clear that customers of different types hinder each other more as they tend to arrive in the system more clustered according to class, the degree of “class clustering” in the arrival process is explicitly modeled in the paper and its very direct impact on the performance measures is revealed. The motivation of our work are systems where this kind of blocking is encountered, such as input-queueing network switches or road splits.     

Semi-aligned rank tests

Summary The distribution-free test based on semi-aligned rankings for no treatment effects in a two-way layout, with unequal number of replications in each cell is considered. The asymptotic χ-square distribution of the test statistic under the null hypothesis is derived. The Pitman asymptotic relative efficiency of the test (i) based on semi-aligned rankings with respect to the test (ii) based on within-block rankings, is shown to be larger than one as the number of blocks tends to infinity. Also the asymptotic properties of linear rank statistics (i) and (ii) are investigated and the asymptotic relative efficiency of the test (i) with respect to the test (ii) is again shown to be larger than one.     

I.I.D. STATISTICAL CONTRACTION OPERATORS AND STATISTICALLY SELF－SIMILAR SETS

I.i.d. random sequence is the simplest but very basic one in stochastic processes, and statistically self-similar set is the simplest but very basic one in random recursive sets in the theory of random fractal. Is there any relation between i.i.d. random sequence and statistically self-similar set? This paper gives a basic theorem which tells us that the random recursive set generated by a collection of i.i.d. statistical contraction operators is always a statistically self-similar set.     

Estimation of rating classes and default probabilities in credit risk models with dependencies

Let Y = m(X) + ε be a regression model with a dichotomous output Y and a one‐step regression function m . In the literature, estimators for the three parameters of m , that is, the breakpoint θ and the levels a and b , are proposed for independent and identically distributed (i.i.d.) observations. We show that these standard estimators also work in a non‐i.i.d. framework, that is, that they are strongly consistent under mild conditions. For that purpose, we use a linear one‐factor model for the input X and a Bernoulli mixture model for the output Y . The estimators for the split point and the risk levels are applied to a problem arising in credit rating systems. In particular, we divide the range of individuals' creditworthiness into two groups. The first group has a higher probability of default and the second group has a lower one. We also stress connections between the standard estimator for the cutoff θ and concepts prevalent in credit risk modeling, for example, receiver operating characteristic. Copyright © 2014 John Wiley & Sons, Ltd.     

Survival of multidimensional contact process in random environments

We consider contact processes in dimensiond≥2, with death rates identically one and random infection rates i.i.d distributed on the space. We show that the process may survive although the distribution λ of the infection rate is such that the expectation of [log(1+λ)] ^d−ε is as close to zero as one wishes.     

Definetti’s Theorem for Abstract Finite Exchangeable Sequences

We show that a finite collection of exchangeable random variables on an arbitrary measurable space is a signed mixture of i.i.d. random variables. Two applications of this idea are examined, one concerning Bayesian consistency, in which it is established that a sequence of posterior distributions continues to converge to the true value of a parameter θ under much wider assumptions than are ordinarily supposed, the next pertaining to Statistical Physics where it is demonstrated that the quantum statistics of Fermi-Dirac may be derived from the statistics of classical (i.e. independent) particles by means of a signed mixture of multinomial distributions.      

Parseval's equality in the abstract interpolation problem and the coupling of open systems. I

An abstract interpolation problem, introduced in a previous work by the author, V. é. Katsnel'son, and P. M. Yuditskii, is investigated. With the abstract interpolation problem one associates a certain open system, i.e., a unitary colligation. It is shown that the solution of the abstract interpolation problem is equivalent to the closure of the corresponding colligation.Translated from Teoriya Funktsii, Funktsional'nyi Analiz i Ikh Prilozheniya, No. 49, pp. 112–120, 1988.     

关于一般矩阵函数变差的不等式

该文首先展示了一般矩阵函数dχ(A)=∑[DD(X]σ∈H[DD)]χ(σ)∏[DD(]m[]i=1[DD)]aiσ(i)可作为一个酉空间张量的适当对称类的内积.然后，借助Schwarz不等式和范数证明了关于一般矩阵函数变差的三个主要不等式,而其中一个不等式是已知不等式的推广.     

Hammerstein型非线性积分方程正解的个数

<正> 本文是作者工作[8]、[9]的继续.在[9]中作者利用Leray-Schauder拓扑度理论研究了多项式型Hammerstein非线性积分方程的固有值,即设     

图的不可定向最大亏格

本文证明了:对于任何一个有圈连通图G,其不可定向最大亏格为这里,α₀,α₁分别为G的顶点和边的数目.从而,也解决了图的不可定向嵌入的存在性问题.     

Characterization of Translation Planes by Orbit Lengths

The Desarguesian, Hall, and Hering translation planes of order q² are characterized as exactly those translation planes of odd order with spreads in PG (3,q) that admit a linear collineation group with infinite orbits one of length q+1 and i of length (q-q) /i for i=1 or 2.     

F ρ Functions

In the paper, the notion of F function, i.e., a partial recursive function whose resemblance type consists of one isomorphism type, is generalized.     

On uniform closeness of local times of Markov chains and i.i.d. sequences

In this paper we consider the field of local times of a discrete-time Markov chain on a general state space, and obtain uniform (in time) upper bounds on the total variation distance between this field and the one of a sequence of $n$ i.i.d. random variables with law given by the invariant measure of that Markov chain. The proof of this result uses a refinement of the soft local time method of Popov and Teixeira (2015).     

A large deviation principle for bootstrapped sample means

A large deviation principle for bootstrapped sample means is established. It relies on the Bolthausen large deviation principle for sums of i.i.d. Banach space valued random variables. The rate function of the large deviation principle for bootstrapped sample means is the same as the classical one.

     

On the hydrodynamic interaction of two circular cylinders oscillating in a viscous fluid

The present paper deals with the plane flow fields induced by two parallel circular cylinders with radiia andb oscillating in a direction which is i) parallel or ii) perpendicular to the plane containing their axes. The effect of the cylinders' hydrodynamic interaction on steady streaming has been studied analytically at high frequency by the method of matched asymptotic expansions.It is found that ifa=b the steady streaming is directed symmetrically to the cylinders while whenab (in the case i)) the secondary steady flow is directed towards the larger cylinder and one of the outer steady vortices disappears.It is shown in case i) that the drag force acting on each cylinder is smaller than the same force experienced on a single cylinder with the same radius which is placed in an unbounded oscillating flow. When the cylinder radii are equal, the drag is greater on the forward cylinder than on the rear one.In contrast, in case ii), wherea=b, it is shown that the drag on each of the two cylinders is greater than the drag acting on a single cylinder with the same radius placed in an unbounded oscillating stream and also each of the cylinders experiences a repulsive force in a direction perpendicular to the oscillating flow.     

The change-of-variance function for dependent data

Summary The infinitesimal stability of the asymptotic variance is considered forM-estimators of a location parameter when the nominal sample with i.i.d. data is contaminated by a possibly dependent process. It is shown that the resulting change-of-variance function can be expressed as a sum of two terms, one corresponding contamination of the univariate distribution, and one to contamination of the bivariate distributions. A change-of-variance sensitivity is introduced, the form of which is closely related to the average patch length of the outliers. Finally, optimalV-robust and mostV-robust score functions are derived. The resulting family of estimators is the same as for independent data in the general case, but the truncation point approaches zero when dependency is accounted for. For redescending score-functions, the family of estimators is changed.This paper was written under support by the Swedish Board for Technical Development, contract 712-89-1073     

The homomorphisms between the Dickson–Mùi algebras as modules over the Steenrod algebra

The Dickson–Mùi algebra consists of all invariants in the mod p cohomology of an elementary abelian p-group under the general linear group. It is a module over the Steenrod algebra, A{\mathcal {A}} . We determine explicitly all the A{\mathcal {A}} -module homomorphisms between the (reduced) Dickson–Mùi algebras and all the A{\mathcal {A}} -module automorphisms of the (reduced) Dickson–Mùi algebras. The algebra of all A{\mathcal {A}} -module endomorphisms of the (reduced) Dickson–Mùi algebra is claimed to be isomorphic to a quotient of the polynomial algebra on one indeterminate. We prove that the reduced Dickson–Mùi algebra is atomic in the meaning that if an A{\mathcal {A}} -module endomorphism of the algebra is non-zero on the least positive degree generator, then it is an automorphism. This particularly shows that the reduced Dickson–Mùi algebra is an indecomposable A{\mathcal {A}} -module. The similar results also hold for the odd characteristic Dickson algebras. In particular, the odd characteristic reduced Dickson algebra is atomic and therefore indecomposable as a module over the Steenrod algebra.