Inhomogeneous Markov Chains and Ergodicity Coefficients: John Hajnal (1924–2008)

In 1958, a paper by John Hajnal, a demographer and mathematical statistician, was fundamental in the revival of the theory of inhomogeneous Markov chains. Hajnal made his contribution by the development of tools for the analysis of weak ergodicity, and proofs of fundamental theorems. This article reviews Hajnal's career, and then focuses on the four topics: 1. ergodicity coefficients and the weak ergodicity theorem; 2. scrambling matrices; 3. the coupling theorem; and 4. non-negative matrix products. Related work by other authors, especially Wolfgang Doeblin, is mentioned in context. Attention is given to some recent surveys and applications of ergodicity coefficients, including the Google matrix.     

Intrinsically Dynamic Multistate Models

Multistate life table models, which follow persons through more than one living state, have found increasing use in demographic analyses. Multistate stable populations, however, are infrequently used because the constant rate assumption is quite strong and such populations can take centuries to approach stability. Dynamic models, that is models where the rates can change over time, are examined to derive a new solution for the size and composition of a multistate population in terms of the sequence of underlying population projection matrices (PPMs). Constraints on the subordinate eigenvalues and the subordinate eigenvectors of the time-varying PPMs produce a model population that grows according to the dominant eigenvalues of each time-specific PPM and has a state composition that depends only on the most recent PPM. The two living state model is examined in detail, relationships between the PPM elements and the size and composition of the model are explored, and two illustrative applications of the model are presented.     

非负矩阵谱半径的新估计

对于非负矩阵的谱半径进行研究,分析了文[1,2]中的结果,给出了非负矩阵谱半径的新估计,该结果改进了文[1,2]中的相关结果.     

广义对角占优矩阵判定条件的改进

给出广义对角占优矩阵的判定条件,改进和包含了文献[1～3]的主要结果,从而也推广了Shivakumar的结果。作为应用,得到了判定非奇M矩阵和几种迭代法新的收敛准则。     

Some results on optimality in models with heteroscedastic errors from partial optimum designs

This paper studies optimum designs for linear models when the errors are heteroscedastic. Sufficient conditions are given in order to obtainD-, A- andE-optimum designs for a complete regression model from partial optimum designs for some sub-parameters. A result about optimality for a complete model from the optimality for the submodels is included. Supported by Junta de Andalucía, research group FQM244.     

ASSESSING CONGRUENCEAMONG DISTANCE MATRICES: SINGLE-MALT SCOTCH WHISKIES REVISITED

A test of congruence among distance matrices is described. It tests the hypothesis that several matrices, containing different types of variables about the same objects, are congruent with one another, so they can be used jointly in statistical analysis. Raw data tables are turned into similarity or distance matrices prior to testing; they can then be compared to data that naturally come in the form of distance matrices. The proposed test can be seen as a generalization of the Mantel test of matrix correspondence to any number of distance matrices. This paper shows that the new test has the correct rate of Type I error and good power. Power increases as the number of objects and the number of congruent data matrices increase; power is higher when the total number of matrices in the study is smaller. To illustrate the method, the proposed test is used to test the hypothesis that matrices representing different types of organoleptic variables (colour, nose, body, palate and finish) in single‐malt Scotch whiskies are congruent.     

配体场势与d轨道分裂的相对能量

以ｄ１组态的简单晶体场理论为基础,根据点群的对称性及配体场势的可加和性原则,讨论了各配体场中ｄ轨道分裂的相对能量的计算方法     

和矩阵奇异值的极值表征

本文讨论两个m×n矩阵和的奇异值问题,给出了一个用矩阵迹的和表示奇异值之和的极值表达式。     

（0，1）—矩阵类U（R，S）的势函数

讨论了（０，１）—矩阵类Ｕ（Ｒ，Ｓ）中所含指定的行和向量Ｒ＝（ｒ１，ｒ２，…，ｒｍ），列和向量Ｓ＝（ｓ１，ｓ２；，…，ｓｎ）的（０，１）—矩阵的势ｆｍ，ｎ（Ｒ，Ｓ），给出了求ｆｍ，ｎ（Ｒ，Ｓ）的递归公式．     

Portfolio optimization: New capabilities and future methods

Summary  This paper addresses the problem of portfolio selection in finance. In many cases, currently available software to compute the efficient frontier runs into difficulty in problems with more than about 600 securities. To proceed beyond this size, it is often necessary to modify the problem in which case there is typically a loss of information. In this paper, we discuss a computer capability that can exactly compute mean-variance efficient frontiers of problems with up to 2,000 securities in very reasonable time (even if a problem’s covariance matrix is 100% dense). The paper also discusses an augmentation to the theory of portfolio selection that allows multiple objectives (such as dividends, liquidity, social responsibility, amount invested in R&D, and so forth) to be incorporated into the portfolio selection process. In such problems, the efficient set is no longer a “frontier,” but is now best described as a “surface” with the interesting property that it is composed of platelets (like on the back of a turtle). Moreover, the computer capability that can compute the exact efficient frontier of a mean-variance problem with up to 2,000 securities also has, after additional coding, the ability to compute exactly all platelets of the efficient surface of a tri-criterion portfolio problem with up to 400 securities.

---

Zusammenfassung  In dieser Arbeit stellen wir einen leistungsf?higen Rechenalgorithmus vor, um den effizienten Rand (die nichtdominierten Alternativen) von Portfolio-Auswahlproblemen in der Finanzierung zu bestimmen. Wir bezeichnen den Berechnungsalgorithmus, der in Java programmiert ist, mit MPQ (multi-parametric quadratic programming). MPQ weist gegenüber bisherigen Berechnungsverfahren eine Reihe von Vorteilen auf: Es kann für umfangreiche Anwendungsf?lle genutzt werden, ist durch passable Rechenzeiten charakterisiert und kann die Menge effizienter Alternativen in einem Bruchteil bisher üblicher Rechenzeiten bestimmen.