This paper models and analyses downlink power assignment feasibility in Code Division Multiple Access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron-Frobenius eigenvalue of that matrix, w...

In the present paper the Renormalization Group (RG) method is adopted as a tool for a constructive analysis of the properties of the Frobenius-Perron Operator. The renormalization group reduction of a generic symplectic map in the case, where the unperturbed rotation frequency of the map is far from structural resonances driven by the kick perturbation has been performed in detail. It is furthe...

Finite time coherent sets [Froyland et al., 2010] have recently been defined by a measure-based objective function describing the degree that sets hold together, along with a Frobenius–Perron transfer operator method to produce optimally coherent sets. Here, we present an extension to generalize the concept to hierarchically define relatively coherent sets based on adjusting the finite time coh...

A pseudo-Anosov surface automorphism φ has associated to it an algebraic unit λφ called the dilatation of φ. It is known that in many cases λφ appears as the spectral radius of a Perron–Frobenius matrix preserving a symplectic form L. We investigate what algebraic units could potentially appear as dilatations by first showing that every algebraic unit λ appears as an eigenvalue for some integra...

The statistical properties of endomorphisms under the assumption that the associated Perron– Frobenius operator is quasicompact are considered. In particular, the central limit theorem, weak invariance principle and law of the iterated logarithm for sufficiently regular observations are examined. The approach clarifies the role of the usual assumptions of ergodicity, weak mixing, and exactness....

In this paper, we describe a copy-and-paste method for constructing a class of infinite self-similar trees. A copy-paste tree is constructed by repeatedly attaching copies of a finite tree (called a generator) to certain designated attachment vertices. We show that each generator has an associated nonnegative matrix which can be used to determine a formula for the growth function of the copy-pa...

Precis: We discuss the behaviour of prices in an n-sector, circulating capital model with no joint production, of the type considered by Sraffa in Part I of his book. Instead of following Sraffa's approach, which uses the notion of proportions of labour to means of production in the various "layers" of means of production, we base our analysis directly on the characteristic roots and vectors of...

The spectral radius of a matrix A is the maximum norm of all eigenvalues of A. In previous work we already formalized that for a complex matrix A, the values in A grow polynomially in n if and only if the spectral radius is at most one. One problem with the above characterization is the determination of all complex eigenvalues. In case A contains only non-negative real values, a simplification ...

A new approach to computation of optimal policies for MDP (Markov decision process) models is introduced. The main idea is to solve not one, but an entire family of MDPs, parameterized by a weighting factor ζ that appears in the one-step reward function. For an MDP with d states, the family of value functions {hζ : ζ ∈ R} is the solution to an ODE, d dζh ∗ ζ = V(hζ) where the vector field V : R...

we give a new proof of the well known wedderburn's little theorem (1905) that a finite‎ ‎division ring is commutative‎. ‎we apply the concept of frobenius kernel in frobenius representation theorem in finite group‎ ‎theory to build a proof‎.