SearcharxivSearch

arXiv subjects

Yohji Akama

Publications and source records attributed to Yohji Akama.

18 recordsLinked to original sources

Asymptotic locations of bounded and unbounded eigenvalues of sample correlation matrices of certain factor models -- application to a components retention rule

Let the dimension $N$ of data and the sample size $T$ tend to $\infty$ with $N/T \to c > 0$. The spectral properties of a sample correlation matrix $\mathbf{C}$ and a sample covariance matrix $\mathbf{S}$ are asymptotically equal whenever the population correlation matrix $\mathbf{R}$ is bounded (El Karoui 2009). We demonstrate this also for general linear models for unbounded $\mathbf{R}$, by examining the behavior of the singular values of multiplicatively perturbed matrices. By this, we establish: Given a factor model of an idiosyncratic noise variance $\sigma^2$ and a rank-$r$ factor loading matrix $\mathbf{L}$ which rows all have common Euclidean norm $L$. Then, the $k$th largest eigenvalues $\lambda_k$ $(1\le k\le N)$ of $\mathbf{C}$ satisfy almost surely: (1) $\lambda_r$ diverges, (2) $\lambda_k/s_k^2\to1/(L^2 + \sigma^2)$ $(1 \le k \le r)$ for the $k$th largest singular value $s_k$ of $\mathbf{L}$, and (3) $\lambda_{r + 1}\to(1-\rho)(1+\sqrt{c})^2$ for $\rho := L^2/(L^2 + \sigma^2)$. Whenever $s_r$ is much larger than $\sqrt{\log N}$, then broken-stick rule (Frontier 1976, Jackson 1993), which estimates $\mathrm{rank}\, \mathbf{L}$ by a random partition (Holst 1980) of $[0,\,1]$, tends to $r$ (a.s.). We also provide a natural factor model where the rule tends to "essential rank" of $\mathbf{L}$ (a.s.) which is smaller than $\mathrm{rank}\, \mathbf{L}$.

math.ST

Correlation matrix of equi-correlated normal population: fluctuation of the largest eigenvalue, scaling of the bulk eigenvalues, and stock market

Given an $N$-dimensional sample of size $T$ and form a sample correlation matrix $\mathbf{C}$. Suppose that $N$ and $T$ tend to infinity with $T/N $ converging to a fixed finite constant $Q>0$. If the population is a factor model, then the eigenvalue distribution of $\mathbf{C}$ almost surely converges weakly to Marčenko-Pastur distribution such that the index is $Q$ and the scale parameter is the limiting ratio of the specific variance to the $i$-th variable $(i\to\infty)$. For an $N$-dimensional normal population with equi-correlation coefficient $ρ$, which is a one-factor model, for the largest eigenvalue $λ$ of $\mathbf{C}$, we prove that $λ/N$ converges to the equi-correlation coefficient $ρ$ almost surely. These results suggest an important role of an equi-correlated normal population and a factor model in (Laloux et al. Random matrix theory and financial correlations, Int. J. Theor. Appl. Finance, 2000): the histogram of the eigenvalue of sample correlation matrix of the returns of stock prices fits the density of Marčenko-Pastur distribution of index $T/N $ and scale parameter $1-λ/N$. Moreover, we provide the limiting distribution of the largest eigenvalue of a sample covariance matrix of an equi-correlated normal population. We discuss the phase transition as to the decay rate of the equi-correlation coefficient in $N$.

math.ST

A dichotomous behavior of Guttman-Kaiser criterion from equi-correlated normal population

We consider a $p$-dimensional, centered normal population such that all variables have a positive variance $σ^2$ and any correlation coefficient between different variables is a given nonnegative constant $ρ<1$. Suppose that both the sample size $n$ and population dimension $p$ tend to infinity with $p/n \to c>0$. We prove that the limiting spectral distribution of a sample correlation matrix is Marčenko-Pastur distribution of index $c$ and scale parameter $1-ρ$. By the limiting spectral distributions, we rigorously show the limiting behavior of widespread stopping rules Guttman-Kaiser criterion and cumulative-percentage-of-variation rule in PCA and EFA. As a result, we establish the following dichotomous behavior of Guttman-Kaiser criterion when both $n$ and $p$ are large, but $p/n$ is small: (1) the criterion retains a small number of variables for $ρ>0$, as suggested by Kaiser, Humphreys, and Tucker [Kaiser, H. F. (1992). On Cliff's formula, the Kaiser-Guttman rule and the number of factors. Percept. Mot. Ski. 74]; and (2) the criterion retains $p/2$ variables for $ρ=0$, as in a simulation study [Yeomans, K. A. and Golder, P. A. (1982). The Guttman-Kaiser criterion as a predictor of the number of common factors. J. Royal Stat. Soc. Series D. 31(3)].

math.ST

Hyperbolic polyhedral surfaces with regular faces

We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2π.$ The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywhere. We prove that there is a gap between areas of non-smooth hyperbolic polyhedral surfaces and the area of smooth hyperbolic surfaces. The numerical result for the gap is obtained for hyperbolic polyhedral surfaces, homeomorphic to the double torus, whose 1-skeletons are cubic graphs.

math.MG

Graphs on surfaces with positive Forman curvature or corner curvature

On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete classification. On the other hand, we classify the class of graphs on surfaces with positive corner curvature.

math.CO

A curvature notion for planar graphs stable under planar duality

Woess \cite{Woess98} introduced a curvature notion on the set of edges of a planar graph, called $Ψ$-curvature in our paper, which is stable under the planar duality. We study geometric and combinatorial properties for the class of infinite planar graphs with non-negative $Ψ$-curvature. By using the discharging method, we prove that for such an infinite graph the number of vertices (resp. faces) of degree $k,$ except $k=3,4$ or $6,$ is finite. As a main result, we prove that for an infinite planar graph with non-negative $Ψ$-curvature the sum of the number of vertices of degree at least $8$ and the number of faces of degree at least $8$ is at most one.

math.CO

Classification of spherical tilings by congruent quadrangles over pseudo-double wheels (II)

We classify all edge-to-edge spherical isohedral 4-gonal tilings such that the skeletons are pseudo-double wheels. For this, we characterize these spherical tilings by a quadratic equation for the cosine of an edge-length. By the classification, we see: there are indeed two non-congruent, edge-to-edge spherical isohedral 4-gonal tilings such that the skeletons are the same pseudo-double wheel and the cyclic list of the four inner angles of the tiles are the same. This contrasts with that every edge-to-edge spherical tiling by congruent 3-gons is determined by the skeleton and the inner angles of the skeleton. We show that for a particular spherical isohedral tiling over the pseudo-double wheel of twelve faces, the quadratic equation has a double solution and the copies of the tile also organize a spherical non-isohedral tiling over the same skeleton.

math.MG

Confluent terminating extensional lambda-calculi with surjective pairing and terminal type

For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo were inspired by Knuth-Bendix completion, and introduced a confluent rewriting system that (1) extends the naive rewriting system, and (2) is stable under contexts. The rewriting system has (i) a rule that rewrites term of a terminal type rewrites to a term constant *, unless the term is not *, (ii) rewrite rules for the extensionality of function types and product types, and rewrite rules mediating the rewrite rules (i) and (ii). Curien and Di Cosmo supposed that because of (iii), any reducibility method cannot prove the strong normalization (SN) of Curien-Di Cosmo's rewriting system, and they left the SN open. By relativizing Girard's reducibility method to the *-free terms, we prove SN of their rewriting, and SN of the extension by polymorphism. The relativization works because: for any SN term t, and for any variable z of terminal type not occurring in $t$, t with all the occurrences of * of terminal type replaced by the variable z is SN.

cs.LO

Areas of spherical polyhedral surfaces with regular faces

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of planar graphs which admit spherical polyhedral surfaces with the curvature bounded below by 1 in the sense of Alexandrov, i.e. the total angle at each vertex is at most $2π$. We classify all spherical tilings with regular spherical polygons, i.e. total angles at vertices are exactly $2π$. We prove that for any graph in this class which does not admit a spherical tiling, the area of the associated spherical polyhedral surface with the curvature bounded below by 1 is at most $4π- ε_0$ for some $ε_0 > 0$. That is, we obtain a definite gap between the area of such a surface and that of the unit sphere.

math.MG

Spherical tilings by congruent quadrangles over pseudo-double wheels (III) - the essential uniqueness in case of convex tiles

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the graph is a Platonic solid, an Archimedean dual, an n-gonal bipyramid (n>2), or an n-gonal trapezohedron (i.e., the pseudo-double wheel of 2n faces)". In the classification of spherical monohedral tilings, one naturally asks an "inverse problem" of their result: For a spherical monohedral tiling of the above mentioned topologies, when is the tiling isohedral? We prove that for any spherical monohedral quadrangular tiling being topologically a trapezohedron, if the number of faces is 6, or 8, if the tile is a kite, a dart or a rhombi, or if the tile is convex, then the tiling is isohedral.

math.MG

Realizability Interpretation of PA by Iterated Limiting PCA

For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the limiting partial functions of A-representable partial functions(Akama, "Limiting partial combinatory algebras" Theoret. Comput. Sci. Vol.311 2004). The n-times iteration of this construction results in a PCA that represents any n-iterated limiting partial recursive functions, and the inductive limit of the PCAs over all n is a PCA that represents any arithmetical, partial function. Kleene's realizability interpretation over the former PCA interprets the logical principles of double negation elimination for Σ^0_n-formulas, and that over the latter PCA interprets Peano's arithmetic (PA for short). A hierarchy of logical systems between Heyting's arithmetic and PA is used to discuss the prenex normal form theorem, the relativized independence-of-premise schemes, and "PA is an unbounded extension of HA."

math.LO

Classification of spherical tilings by congruent quadrangles over pseudo-double wheels (I) -- a special tiling by congruent concave quadrangles

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54, 2005). So, toward classification of the spherical tilings by congruent quadrangles, we propose to classify those with the tiles being convex and the graphs being pseudo-double wheels. In this paper, we verify that a certain series of assignments of edge-lengths to pseudo-double wheels does not admit a tiling by congruent convex quadrangles. Actually, we prove the series admits only one tiling by twelve congruent concave quadrangles such that the symmetry of the tiling has only three perpendicular 2-fold rotation axes, and the tiling seems new.

math.MG

Random fields on model sets with localized dependency and their diffraction

For a random field on a general discrete set, we introduce a condition that the range of the correlation from each site is within a predefined compact set D. For such a random field omega defined on the model set Lambda that satisfies a natural geometric condition, we develop a method to calculate the diffraction measure of the random field. The method partitions the random field into a finite number of random fields, each being independent and admitting the law of large numbers. The diffraction measure of omega consists almost surely of a pure-point component and an absolutely continuous component. The former is the diffraction measure of the expectation E[omega], while the inverse Fourier transform of the absolutely continuous component of omega turns out to be a weighted Dirac comb which satisfies a simple formula. Moreover, the pure-point component will be understood quantitatively in a simple exact formula if the weights are continuous over the internal space of Lambda Then we provide a sufficient condition that the diffraction measure of a random field on a model set is still pure-point.

math.DS

A new order theory of set systems and better quasi-orderings

By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory of this new order type and continuous, monotone function between set systems corresponds to the theory of well quasi-orderings (WQOs). As Nash-Williams developed the theory of WQOs to the theory of better quasi-orderings (BQOs), we introduce a set system that has order type and corresponds to a BQO. We prove that the class of set systems corresponding to BQOs is closed by any monotone function. In (Shinohara and Arimura. "Inductive inference of unbounded unions of pattern languages from positive data." Theoretical Computer Science, pp. 191-209, 2000), for any set system L, they considered the class of arbitrary (finite) unions of members of L. From viewpoint of WQOs and BQOs, we characterize the set systems L such that the class of arbitrary (finite) unions of members of L has order type. The characterization shows that the order structure of the set system L with respect to the set-inclusion is not important for the resulting set system having order type. We point out continuous, monotone function of set systems is similar to positive reduction to Jockusch-Owings' weakly semirecursive sets.

math.CO

VC dimension of ellipsoids

We will establish that the VC dimension of the class of d-dimensional ellipsoids is (d^2+3d)/2, and that maximum likelihood estimate with N-component d-dimensional Gaussian mixture models induces a geometric class having VC dimension at least N(d^2+3d)/2. Keywords: VC dimension; finite dimensional ellipsoid; Gaussian mixture model

math.CO

Set systems: order types, continuous nondeterministic deformations, and quasi-orders

By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in symbol) are (1) We can represent any well-quasi-order (wqo for short) by the set system L of the upper-closed sets of the wqo such that the maximal order type of the wqo is equal to dim L. (2) dim L is an upper bound of the mind-change complexity of L. dim L is defined iff L has a finite elasticity (fe for short), where, according to computational learning theory, if an indexed family of recursive languages has fe then it is learnable by an algorithm from positive data. Regarding set systems as subspaces of Cantor spaces, we prove that fe of set systems is preserved by any continuous function which is monotone with respect to the set-inclusion. By it, we prove that finite elasticity is preserved by various (nondeterministic) language operators (Kleene-closure, shuffle-closure, union, product, intersection,. . ..) The monotone continuous functions represent nondeterministic computations. If a monotone continuous function has a computation tree with each node followed by at most n immediate successors and the order type of a set system L is α, then the direct image of L is a set system of order type at most n-adic diagonal Ramsey number of α. Furthermore, we provide an order-type-preserving contravariant embedding from the category of quasi-orders and finitely branching simulations between them, into the complete category of subspaces of Cantor spaces and monotone continuous functions having Girard's linearity between them. Keyword: finite elasticity, shuffle-closure

cs.LO