Tail asymptotics for the supremum of an independent subadditive process are obtained as a function of the logarithmic moment generating function. We use this analysis to obtain large deviations results for queueing networks in their stationary regime. In the particular case of (max,plus)-linear recursions, the rate of exponential decay of the stationary solution can be explicitly computed.

The relations between solutions of the three types of totally linear partial differential equations of first order are presented. The approach is based on factorization of a non-homogeneous first order differential operator to products consisting of a scalar function, a homogeneous first order differential operator and the reciprocal of the scalar function. The factorization procedure is utiliz...

ABSTRACT. We extend a recent result on third and fourth-order Cauchy-Euler equations by establishing the Hyers-Ulam stability of higher-order linear non-homogeneous Cauchy-Euler dynamic equations on time scales. That is, if an approximate solution of a higher-order Cauchy-Euler equation exists, then there exists an exact solution to that dynamic equation that is close to the approximate one. We...

We consider the context of “stochastic recursions,” that is, recursions that involve quantities needing to be estimated using a stochastic simulation. Examples include certain stochastic adaptations of fixed-point recursions, line search recursions, and trust-region recursions obtained by replacing function and derivative values appearing within the recursion by their Monte Carlo counterparts. ...

Following results are sketched in this extended abstract Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded with an e ective con struction of equivalent non recursive programs A generalized chain program which allow IDB predicates of arbitrary arity and remove the uniqueness condition of chain variables is bounded if and only if it ...

A general method to map a polynomial recursion on a matrix linear one is suggested. The solution of the recursion is represented as a product of a matrix multiplied by the vector of initial values. This matrix is product of transfer matrices whose elements depend only on the polynomial and not on the initial conditions. The method is valid for systems of polynomial recursions and for polynomial...

the bem is applied to the solution of the torsion problem of non-homogeneous anisotropic non-circular prismatic bars. the problem is formulated in terms of the warping function. this formulation leads to a second order partial differential equation with variable coefficients, subjected to a generalized neumann type boundary condition. the problem is solved using the analog equation method (aem)...

Hurwitz numbers, which count certain covers of the projective line (or, equivalently, factorizations of permutations into transpositions), have been extensively studied for over a century. The Gromov-Witten potential F of a point, the generating series for Hodge integrals on the moduli space of curves, has been a central object of study in Gromov-Witten theory. We define a slightly enriched Gro...

The diffusion least mean square (DLMS) and the normalized (DNLMS) algorithms are analyzed for a network having fusion center. This structure reduces dimensionality of resulting stochastic models while preserving important properties. analysis is done in system identification framework cyclostationary white nodal inputs. parameters vary according to random walk model. cyclostationarity modeled b...

for 0 ≤ i, j ∈ N. The matrix P is hence the famous Pascal triangle yielding the binomial coefficients and can be recursively constructed by the rules p0,i = pi,0 = 1 for i ≥ 0 and pi,j = pi−1,j + pi,j−1 for 1 ≤ i, j. In this paper we are interested in (sequences of determinants of finite) matrices related to P . The present section deals with determinants of some minors of the above Pascal tria...