Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 83-90).

The biological datasets produced as a result of high-throughput genomic research such as specifically microarrays, contain vast amounts of knowledge for entire genome and their expression affiliations. Gene clustering from such data is a challenging task due to the huge data size and high complexity of the algorithms as well as the visualization needs. Most of the existing analysis methods for genome-wide gene expression profiles are sequential programs using greedy algorithms and require subjective human decision. Recently, Zhu et al. proposed a parallel Random matrix theory (RMT) based approach for generating transcriptional networks, which is much more resistant to high level of noise in the data [9] without human intervention. Nowadays GPUs are designed to be used more efficiently for general purpose computing [1] and are vastly superior to CPUs [6] in terms of threading performance. Our kernel functions running on GPU utilizes the functions from both the libraries of Compute Unified Basic Linear Algebra Subroutines (CUBLAS) and Compute Unified Linear Algebra (CULA) which implements the Linear Algebra Package (LAPACK). Our experiment results show that GPU program can achieve an average speed-up of 2~3 times for some simulated datasets.

No description available.

Random matrix theory is an outstanding mathematical tool that has demonstrated its usefulness in many areas ranging from wireless communication to finance and economics. The main motivation behind its use comes from the fundamental role that random matrices play in modeling unknown and unpredictable physical quantities. In many situations, meaningful metrics expressed as scalar functionals of these random matrices arise naturally. Along this line, the present work consists in leveraging tools from random matrix theory in an attempt to answer fundamental questions related to applications from statistical signal processing and machine learning. In a first part, this thesis addresses the development of analytical tools for the computation of the inverse moments of random Gram matrices with one side correlation. Such a question is mainly driven by applications in signal processing and wireless communications wherein such matrices naturally arise. In particular, we derive closed-form expressions for the inverse moments and show that the obtained results can help approximate several performance metrics of common estimation techniques. Then, we carry out a large dimensional study of discriminant analysis classifiers. Under mild assumptions, we show that the asymptotic classification error approaches a deterministic quantity that depends only on the means and covariances associated with each class as well as the problem dimensions. Such result permits a better understanding of the underlying classifiers, in practical large but finite dimensions, and can be used to optimize the performance. Finally, we revisit kernel ridge regression and study a centered version of it that we call centered kernel ridge regression or CKRR in short. Relying on recent advances on the asymptotic properties of random kernel matrices, we carry out a large dimensional analysis of CKRR under the assumption that both the data dimesion and the training size grow simultaneiusly large at the same rate. We particularly show that both the empirical and prediction risks converge to a limiting risk that relates the performance to the data statistics and the parameters involved. Such a result is important as it permits a better undertanding of kernel ridge regression and allows to efficiently optimize the performance.

フランス国リヨン高等師範学校との共同学位プログラムによる学位 / 京都大学 / 新制・課程博士 / 博士(理学) / 甲第23449号 / 理博第4743号 / 新制||理||1680(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)教授 COLLINS Benoit Vincent Pierre, 教授 泉 正己, 教授 日野 正訓 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM

By endowing the base station with hundreds of antennas and relying on spatial multiplexing, massive multiple-input-multiple-output (MIMO) allows impressive advantages in many fronts. To reduce this promising technology to reality, thorough performance analysis has to be conducted. Along this line, this work is focused on the convenient high-dimensionality of massive MIMO’s corresponding model. Indeed, the large number of antennas allows us to harness asymptotic results from Random Matrix Theory to provide accurate approximations of the main performance metrics. The derivations yield simple closed-form expressions that can be easily interpreted and manipulated in contrast to their alternative random equivalents. Accordingly, in this dissertation, we investigate and optimize the performance of massive MIMO in different contexts. First, we explore the spectral efficiency of massive MIMO in large-scale multi-tier heterogeneous networks that aim at network densification. This latter is epitomized by the joint implementation of massive MIMO and small cells to reap their benefits. Our interest is on the design of coordinated beamforming that mitigates cross-tier interference. Thus, we propose a regularized SLNR-based precoding in which the regularization factor is used to allow better resilience to channel estimation errors. Second, we move to studying massive MIMO under Line-of-Sight (LoS) propagation conditions. To this end, we carry out an analysis of the uplink (UL) of a massive MIMO system with per-user channel correlation and Rician factor. We start by analyzing conventional processing schemes such as LMMSE and MRC under training-based imperfect-channel-estimates, and then, propose a statistical combining technique that is more suitable in LoS-prevailing environments. Finally, we look into the interplay between LoS and the fundamental limitation of massive MIMO systems, namely, pilot contamination. We propose to analyze and compare the performance using single-cell and multi-cell detection methods. In this regard, the single-cell schemes are shown to produce higher SEs as the LoS strengthens, yet remain hindered by LoS-induced interference and pilot contamination. In contrast, for multi-cell combining, we analytically demonstrate that M-MMSE outperforms both single-cell detectors by generating a capacity that scales linearly with the number of antennas, and is further enhanced with LoS.

No description available.

<p> Techniques from algebra and matrix theory are employed to study the total progeny of a multitype branching process from the point of probability generating functions. A result for the total progeny of different types of individuals having identical offspring distribution is developed, which extends the classic Dwass formula from single case to multitype case. An example with Poisson distributed offspring having different distributions of children is given to illustrate that total progeny does not preserve similar structure as Dwass' formula in general.</p> / Thesis / Master of Science (MSc)

No / Eigenvalue based spectrum sensing schemes such as Maximum Minimum Eigenvalue (MME), Maximum Energy Detection (MED) and Energy with Minimum Eigenvalue (EME) have higher spectrum sensing performance without requiring any prior knowledge of Primary User (PU) signal but the decision hypothesis used in these eigenvalue based sensing schemes depends on the calculation of maximum eigenvalue from covariance matrix of measured signal. Calculation of the covariance matrix followed by eigenspace analysis of the covariance matrix is a resource intensive operation and takes overhead time during critical process of spectrum sensing. In this paper we propose a new blind spectrum sensing scheme based on the approximation of the maximum eigenvalue using state of the art results from Random Matrix Theory (RMT). The proposed sensing scheme has been evaluated through extensive simulations on wireless microphone signals and the proposed scheme shows higher probability of detection (Pd) performance. The proposed spectrum sensing also shows higher detection performance as compared to energy detection scheme and RMT based sensing schemes such as MME and EME.

Reliability and computational efficiency of classification error estimators are critical factors in classifier design. In a high-dimensional data setting where data is scarce, the conventional method of error estimation, cross-validation, can be very computationally expensive. In this thesis, we consider a particular discriminant analysis type classifier, the Randomly-Projected RLDA ensemble classifier, which operates under the assumption of such a ‘small sample’ regime. We conduct an asymptotic study of the generalization error of this classifier under this regime, which necessitates the use of tools from the field of random matrix theory. The main outcome of this study is a deterministic function of the true statistics of the data and the problem dimension that approximates the generalization error well for large enough dimensions. This is demonstrated by simulation on synthetic data. The main advantage of this approach is that it is computationally efficient. It also constitutes a major step towards the construction of a consistent estimator of the error that depends on the training data and not the true statistics, and so can be applied to real data. An analogous quantity for the Randomly-Projected LDA ensemble classifier, which appears in the literature and is a special case of the former, is also derived. We motivate its use for tuning the parameter of this classifier by simulation on synthetic data.