Spectral rational variation in two places for adjacency matrix is impossible
نویسندگان
چکیده
منابع مشابه
Places and Spaces: Adjacency Effects
The word "place" is curiously wide in its application, going beyond strict spatiality. A traditional town is a place, the right half of that field is a place, the vacuum cleaner has its place in the closet, the children's place is upstairs, the woman's place was in the home, the third line on the form is the place for this year's income, and as we grow up we try to find our place within the mes...
متن کاملSpectral Factorization of Non-Rational Matrix-Valued Spectral Densities
Recently, a necessary and sufficient uniform log-integrability condition has been established for the canonical spectral factorization mapping to be sequentially continuous. Under this condition, if a sequence of spectral densities converge to a limiting spectral density then the canonical spectral factors of the sequence converges to the canonical spectral factor of the limiting density. Howev...
متن کاملIs the Rational Addiction model inherently impossible to estimate?
The Rational Addiction (RA) model is increasingly often estimated using individual level panel data with mixed results; in particular, with regard to the implied rate of time discount. This paper suggests that the odd values of the rate of discount frequently found in the literature may in fact be a consequence of the saddle-point dynamics associated with individual level inter-temporal optimiz...
متن کاملJ-spectral factorization for rational matrix functions with alternative realization
In this paper, recent results by Petersen and Ran on the J-spectral factorization problem to rational matrix functions with constant signature that are not necessarily analytic at infinity are extended. In particular, a full parametrization of all J̃-spectral factors that have the same pole pair as a given square J-spectral factor is given. In this case a special realization involving a quintet ...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2005
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.02.021