Loynes’ distribution, which characterizes the one dimensional marginal of the stationary solution to Lindley’s recursion, possesses an ultimately exponential tail for a large class of increment processes. If one can observe increments but does not know their probabilistic properties, what are the statistical limits of estimating the tail exponent of Loynes’ distribution? We conjecture that in b...

different discrete models of population dynamics of certain insects have been investigated under various feasible conditions within the framework of nonlinear dynamics. evolutionary phenomena are discussed through bifurcation analysis leading to chaos. some tools of nonlinear dynamics, such as lyapunov characteristic exponents (lce), lyapunov numbers, correlation dimension, etc. are calculated ...

‎given an integer $n$‎, ‎we denote by $mathfrak b_n$ and $mathfrak c_n$ the classes of all groups $g$ for which the map $phi_{n}:gmapsto g^n$ is a monomorphism and an epimorphism of $g$‎, ‎respectively‎. ‎in this paper we give a characterization for groups in $mathfrak b_n$ and for groups in $mathfrak c_n$‎. ‎we also obtain an arithmetic description of the set of all integers $n$ such that a gr...

We find a bound for the exponent of the Schur multiplier of a finite p-group in terms of the exponent and Engel length of the given group. It is also proved that if G is a 3-Engel group of finite exponent, then the exponent of H2(G) divides exp G. When G is a 4-Engel group of exponent e, the exponent of H2(G) divides 10e.

The Hurst Exponent is a dimensionless estimator for the self-similarity of a time series. Initially defined by Harold Edwin Hurst to develop a law for regularities of the Nile water level, it now has applications in medicine and finance. Meaningful values are in the range [0, 1]. Different methods for estimating the Hurst Exponent have been evaluated: The classical “Rescaled Range” method devel...

Primitive digraphs on n vertices with exponents at least b!n=2c + 2, where !n = (n 1) + 1, are considered. For n 3, all such digraphs containing a Hamilton cycle are characterized; and for n 6, all such digraphs containing a cycle of length n 1 are characterized. Each eigenvalue of any stochastic matrix having a digraph in one of these two classes is proved to be geometrically simple.

We initiate a study of the homomorphism domination exponent of a pair of graphs F and G, defined as the maximum real number c such that |Hom(F, T )| > |Hom(G,T )| for every graph T . The problem of determining whether HDE(F,G) > 1 is known as the homomorphism domination problem and its decidability is an important open question arising in the theory of relational databases. We investigate the c...

An allometric height-mass exponent γ gives an approximative power-law relation 〈M〉 ∝ H between the average mass 〈M〉 and the height H , for a sample of individuals. The individuals in the present study are humans but could be any biological organism. The sampling can be for a specific age of the individuals or for an age-interval. The body-mass index (BMI) is often used for practical purposes wh...