Stability of Manpower Systems

Members of an organization belong to one of the grades (1, 2,... k), and movements between grades are governed by a substochastic matrix P. The model can be deterministic, stochastic, or partially stochastic; and we may or may not insist that the total size be restored to a fixed quantity each year. Various notions of the stability of a structure x = (x₁, x₂, … x _k ), where x _i represents the number, or proportion, in grade i are considered. Mainly, but not exclusively, the case when P is upper triangular is considered.     

On reliability analysis of consecutive k-out-of-n systems with arbitrarily dependent components

In this paper, we consider the linear and circular consecutive k-out-of-n systems consisting of arbitrarily dependent components. Under the condition that at least n?r+1 components (r ≤ n) of the system are working at time t, we study the reliability properties of the residual lifetime of such systems. Also, we present some stochastic ordering properties of residual lifetime of consecutive k-out-of-n systems. In the following, we investigate the inactivity time of the component with lifetime T_r:n at the system level for the consecutive k-out-of-n systems under the condition that the system is not working at time t > 0, and obtain some stochastic properties of this conditional random variable.     

Mean-square stability of stochastic age-dependent delay population systems with jumps

In this paper, we present the compensated stochastic θ method for stochastic age-dependent delay population systems (SADDPSs) with Poisson jumps. The definition of mean-square stability of the numerical solution is given and a sufficient condition for mean-square stability of the numerical solution is derived. It is shown that the compensated stochastic θ method inherits stability property of the numerical solutions. Finally, the theoretical results are also confirmed by a numerical experiment.     

Processes of <Emphasis Type="Italic">r</Emphasis><Superscript><Emphasis Type="Italic">t</Emphasis><Emphasis Type="Italic">h</Emphasis></Superscript> largest

For integers n ≥ r, we treat the rth largest of a sample of size n as an \(\mathbb {R}^{\infty }\)-valued stochastic process in r which we denote as M^(r). We show that the sequence regarded in this way satisfies the Markov property. We go on to study the asymptotic behavior of M^(r) as r → ∞, and, borrowing from classical extreme value theory, show that left-tail domain of attraction conditions on the underlying distribution of the sample guarantee weak limits for both the range of M^(r) and M^(r) itself, after norming and centering. In continuous time, an analogous process Y^(r) based on a two-dimensional Poisson process on \(\mathbb {R}_{+}\times \mathbb {R}\) is treated similarly, but we note that the continuous time problems have a distinctive additional feature: there are always infinitely many points below the rth highest point up to time t for any t >?0. This necessitates a different approach to the asymptotics in this case.     

Deterministic Quadrature Formulas for SDEs Based on Simplified Weak Itô–Taylor Steps

We study the problem of approximating the expected value \({\mathbb E}f(X(1))\) of a function f of the solution X of a d-dimensional system of stochastic differential equations (SDE) at time point 1 based on finitely many evaluations of the coefficients of the SDE, the integrand f and their derivatives. We present a deterministic algorithm, which produces a quadrature rule by iteratively applying a Markov transition based on the distribution of a simplified weak Itô–Taylor step together with strategies to reduce the diameter and the size of the support of a discrete measure. We essentially assume that the coefficients of the SDE are s-times continuously differentiable and the diffusion coefficient satisfies a uniform non-degeneracy condition and that the integrand f is r-times continuously differentiable. In the case \(r \le (\lfloor s/2 \rfloor - 1) \cdot 2d/(d + 2)\), we almost achieve an error of order \(\min (r, s)/d\) in terms of the computational cost, which is optimal in a worst-case sense.     

On the optimal robust solution of IVPs with noisy information

We investigate the optimal solution of systems of initial-value problems with smooth right-hand side functions f from a Hölder class \(F^{r,\varrho }_{\text {reg}}\), where r ≥ 0 is the number of continuous derivatives of f, and ? ∈ (0, 1] is the Hölder exponent of rth partial derivatives. We consider algorithms that use n evaluations of f, the ith evaluation being corrupted by a noise δ_i of deterministic or random nature. For δ ≥ 0, in the deterministic case the noise δ_i is a bounded vector, ∥δ_i∥≤δ. In the random case, it is a vector-valued random variable bounded in average, (E(∥δ_i∥^q))^1/q ≤ δ, q ∈ [1, + ∞). We point out an algorithm whose L_p error (p ∈ [0, + ∞]) is O(n ^{? (r + ?)} + δ), independently of the noise distribution. We observe that the level n ^{? (r + ?)} + δ cannot be improved in a class of information evaluations and algorithms. For ε > 0, and a certain model of δ-dependent cost, we establish optimal values of n(ε) and δ(ε) that should be used in order to get the error at most ε with minimal cost.     

Positive invertibility of matrices and stability of Itô delay differential equations

We study the global exponential p-stability (1 ≤ p < ∞) of systems of Itô nonlinear delay differential equations of a special form using the theory of positively invertible matrices. To this end, we apply a method developed by N.V. Azbelev and his students for the stability analysis of deterministic functional-differential equations. We obtain sufficient conditions for the global exponential 2p-stability (1 ≤ p < ∞) of systems of Itô nonlinear delay differential equations in terms of the positive invertibility of a matrix constructed from the original system. We verify these conditions for specific equations.     

Probabilistic stable rules and Nash equilibrium in two-sided matching problems

We study many-to-many matching with substitutable and cardinally monotonic preferences. We analyze stochastic dominance (sd) Nash equilibria of the game induced by any probabilistic stable matching rule. We show that a unique match is obtained as the outcome of each sd-Nash equilibrium. Furthermore, individual-rationality with respect to the true preferences is a necessary and sufficient condition for an equilibrium outcome. In the many-to-one framework, the outcome of each equilibrium in which firms behave truthfully is stable for the true preferences. In the many-to-many framework, we identify an equilibrium in which firms behave truthfully and yet the equilibrium outcome is not stable for the true preferences. However, each stable match for the true preferences can be achieved as the outcome of such equilibrium.     

Well-posedness and stability for an elliptic-parabolic free boundary problem modeling the growth of multi-layer tumors

In this paper we study a free boundary problem modeling the growth of multi-layer tumors. This free boundary problem contains one parabolic equation and one elliptic equation, defined on an unbounded domain in R2 of the form 0 〈 y 〈p（x,t）, where p（x,t） is an unknown function. Unlike previous works on this tumor model where unknown functions are assumed to be periodic and only elliptic equations are evolved in the model, in this paper we consider the case where unknown functions are not periodic functions and both elliptic and parabolic equations appear in the model. It turns out that this problem is more difficult to analyze rigorously. We first prove that this problem is locally well-posed in little H61der spaces. Next we investigate asymptotic behavior of the solution. By using the principle of linearized stability, we prove that if the surface tension coefficient y is larger than a threshold value y〉0, then the unique flat equilibrium is asymptotically stable provided that the constant c representing the ratio between the nutrient diffusion time and the tumor-cell doubling time is sufficiently small.     

Stability of secant bundles on the second symmetric power of curves

Given a rank r stable bundle over a smooth irreducible projective curve C,  there is an associated rank 2r bundle over \(S^2(C),\) the second symmetric power of C. In this article we study the slope (semi-)stability of this bundle.     

On the Well-Posedness for Stochastic Schr¨odinger Equations with Quadratic Potential

The authors investigate the influence of a harmonic potential and random perturbations on the nonlinear Schrödinger equations. The local and global well-posedness are proved with values in the space Σ(? ⁿ ) = {f ∈ H ₁(? ⁿ ), |·|f ∈ L ²(? ⁿ )}. When the nonlinearity is focusing and L ²-supercritical, the authors give sufficient conditions for the solutions to blow up in finite time for both confining and repulsive potential. Especially for the repulsive case, the solution to the deterministic equation with the initial data satisfying the stochastic blow-up condition will also blow up in finite time. Thus, compared with the deterministic equation for the repulsive case, the blow-up condition is stronger on average, and depends on the regularity of the noise. If ? = 0, our results coincide with the ones for the deterministic equation.     

<Emphasis Type="Italic">r</Emphasis>-Dynamic Chromatic Number of Some Line Graphs

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, deg(v)}, for each v ∈ V (G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of the line graph of helm graphs H_n for all r between minimum and maximum degree of H_n. Moreover, our proofs are constructive, what means that we give also polynomial time algorithms for the appropriate coloring. Finally, as the first, we define an equivalent model for edge coloring.     

A nested family of $$\varvec{}$$-total effective rewards for positional games

We consider Gillette’s two-person zero-sum stochastic games with perfect information. For each \(k \in \mathbb {N}=\{0,1,\ldots \}\) we introduce an effective reward function, called k-total. For \(k = 0\) and 1 this function is known as mean payoff and total reward, respectively. We restrict our attention to the deterministic case. For all k, we prove the existence of a saddle point which can be realized by uniformly optimal pure stationary strategies. We also demonstrate that k-total reward games can be embedded into \((k+1)\)-total reward games.     

Maximum number of sum-free colorings in finite abelian groups

An r-coloring of a subset A of a finite abelian group G is called sum-free if it does not induce a monochromatic Schur triple, i.e., a triple of elements a, b, c ∈ A with a + b = c. We investigate κ_r,G, the maximum number of sum-free r-colorings admitted by subsets of G, and our results show a close relationship between κ_r,G and largest sum-free sets of G.Given a sufficiently large abelian group G of type I, i.e., |G| has a prime divisor q with q ≡ 2 (mod 3). For r = 2, 3 we show that a subset A ? G achieves κ_r,G if and only if A is a largest sum-free set of G. For even order G the result extends to r = 4, 5, where the phenomenon persists only if G has a unique largest sum-free set. On the contrary, if the largest sum-free set in G is not unique, then A attains κ_r,G if and only if it is the union of two largest sum-free sets (in case r = 4) and the union of three (“independent”) largest sum-free sets (in case r = 5).Our approach relies on the so called container method and can be extended to larger r in case G is of even order and contains sufficiently many largest sum-free sets.     

Spherical means in annular regions in the <Emphasis Type="Italic">n</Emphasis>-dimensional real hyperbolic spaces

Let Z _r,R be the class of all continuous functions f on the annulus Ann(r, R) in the real hyperbolic space \(\mathbb B^n\) with spherical means M _s f(x)?=?0, whenever s?>?0 and \(x\in\mathbb B^n\) are such that the sphere S _s (x)???Ann(r, R) and \(B_r(o)\subseteq B_s(x).\) In this article, we give a characterization for functions in Z _r,R . In the case R?=?∞, this result gives a new proof of Helgason’s support theorem for spherical means in the real hyperbolic spaces.     

Maximal regularity of second order delay equations in Banach spaces

Using known Ca-multiplier result, we give necessary and sufficient conditions for the second order delay equations：
u″（t）=Au（t）＋Fut＋Gu′＋f（t）,t∈R
to have maximal regularity in HSlder continuous function spaces C^α （R, X）, where X is a Banach space, A is a closed operator in X, F, G ∈L（C（[-r, 0], X）, X） are delay operators for some fixed r 〉 0.     

On the Nitsche conjecture for harmonic mappings in ℝ<Superscript>2</Superscript> and ℝ<Superscript>3</Superscript>

We give the new inequality related to the J. C. C. Nitsche conjecture (see [6]). Moreover, we consider the two- and three-dimensional case. LetA(r, 1)={z:r<|z|<1}. Nitsche's conjecture states that if there exists a univalent harmonic mapping from an annulusA(r, 1), to an annulusA(s, 1), thens is at most 2r/(r ²+1).Lyzzaik's result states thats<t wheret is the length of the Grötzsch's ring domain associated withA(r, 1) (see [5]). Weitsman's result states thats≤1/(1+1/2(r logr)²) (see [8]).Our result for two-dimensional space states thats≤1/(1+1/2 log² r) which improves Weitsman's bound for allr, and Lyzzaik's bound forr close to 1. For three-dimensional space the result states thats≤1/(r?logr).     

Independence numbers of random subgraphs of distance graphs

We consider the distance graph G(n, r, s), whose vertices can be identified with r-element subsets of the set {1, 2,..., n}, two arbitrary vertices being joined by an edge if and only if the cardinality of the intersection of the corresponding subsets is s. For s = 0, such graphs are known as Kneser graphs. These graphs are closely related to the Erd?s–Ko–Rado problem and also play an important role in combinatorial geometry and coding theory. We study some properties of random subgraphs of G(n, r, s) in the Erd?s–Rényi model, in which every edge occurs in the subgraph with some given probability p independently of the other edges. We find the asymptotics of the independence number of a random subgraph of G(n, r, s) for the case of constant r and s. The independence number of a random subgraph is Θ(log₂n) times as large as that of the graph G(n, r, s) itself for r ≤ 2s + 1, while for r > 2s + 1 one has asymptotic stability: the two independence numbers asymptotically coincide.     

Mappings connected with the gradient of conformal radius

In this paper we prove the following conformity criterion for the gradient of conformal radius ?R(D, z) of a convex domain D: the boundary ?D has to be a circumference. We calculate coefficients K(r) for K(r)-quasiconformal mappings ?R(D(r), z), D(r) ? D, 0 < r < 1, and complete the results obtained by F. G. Avkhadiev and K.-J. Wirths for the structure of boundary elements of quasiconformal mappings of the domain D.     

A Note on Generalized Lagrangians of Non-uniform Hypergraphs

Set \(A\subset {\mathbb N}\) is less than \(B\subset {\mathbb N}\) in the colex ordering if m a x(A△B)∈B. In 1980’s, Frankl and Füredi conjectured that the r-uniform graph with m edges consisting of the first m sets of \({\mathbb N}^{(r)}\) in the colex ordering has the largest Lagrangian among all r-uniform graphs with m edges. A result of Motzkin and Straus implies that this conjecture is true for r=2. This conjecture seems to be challenging even for r=3. For a hypergraph H=(V,E), the set T(H)={|e|:e∈E} is called the edge type of H. In this paper, we study non-uniform hypergraphs and define L(H) a generalized Lagrangian of a non-uniform hypergraph H in which edges of different types have different weights. We study the following two questions: 1. Let H be a hypergraph with m edges and edge type T. Let C _m,T denote the hypergraph with edge type T and m edges formed by taking the first m sets with cardinality in T in the colex ordering. Does L(H)≤L(C _m,T ) hold? If T={r}, then this question is the question by Frankl and Füredi. 2. Given a hypergraph H, find a minimum subhypergraph G of H such that L(G) = L(H). A result of Motzkin and Straus gave a complete answer to both questions if H is a graph. In this paper, we give a complete answer to both questions for {1,2}-hypergraphs. Regarding the first question, we give a result for {1,r ₁,r ₂,…,r _l }-hypergraph. We also show the connection between the generalized Lagrangian of {1,r ₁,r ₂,? ,r _l }-hypergraphs and {r ₁,r ₂,? ,r _l }-hypergraphs concerning the second question.