• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 55
  • 11
  • 7
  • 5
  • 3
  • 2
  • 1
  • 1
  • Tagged with
  • 85
  • 85
  • 25
  • 16
  • 13
  • 12
  • 12
  • 11
  • 11
  • 11
  • 10
  • 9
  • 9
  • 8
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Aspects of random matrix theory concentration and subsequence problems /

Xu, Hua. January 2008 (has links)
Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009. / Committee Chair: Christian Houdre; Committee Member: Heinrich Matzinger; Committee Member: Ionel Popescu; Committee Member: Mikhail Lifshits; Committee Member: Robert Foley; Committee Member: Vladimir I Kolchinskii; Committee Member: Yuri Bakhtin. Part of the SMARTech Electronic Thesis and Dissertation Collection.
2

Using random matrix theory to determine the intrinsic dimension of a hyperspectral image

Cawse-Nicholson, Kerry 04 February 2013 (has links)
Determining the intrinsic dimension of a hyperspectral image is an important step in the spectral unmixing process, since under- or over- estimation of this number may lead to incorrect unmixing for unsupervised methods. In this thesis we introduce a new method for determining the intrinsic dimension, using recent advances in Random Matrix Theory (RMT). This method is not sensitive to non-i.i.d. and correlated noise, and it is entirely unsupervised and free from any user-determined parameters. The new RMT method is mathematically derived, and robustness tests are run on synthetic data to determine how the results are a ected by: image size; noise levels; noise variability; noise approximation; spectral characteristics of the endmembers, etc. Success rates are determined for many di erent synthetic images, and the method is compared to two principal state of the art methods, Noise Subspace Projection (NSP) and HySime. All three methods are then tested on twelve real hyperspectral images, including images acquired by satellite, airborne and land-based sensors. When images that were acquired by di erent sensors over the same spatial area are evaluated, RMT gives consistent results, showing the robustness of this method to sensor characterisics.
3

Products of random matrices and Lyapunov exponents.

January 2010 (has links)
Tsang, Chi Shing Sidney. / "October 2010." / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 58-59). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.6 / Chapter 1.1 --- The main results --- p.6 / Chapter 1.2 --- Structure of the thesis --- p.8 / Chapter 2 --- The Upper Lyapunov Exponent --- p.10 / Chapter 2.1 --- Notation --- p.10 / Chapter 2.2 --- The upper Lyapunov exponent --- p.11 / Chapter 2.3 --- Cocycles --- p.12 / Chapter 2.4 --- The Theorem of Furstenberg and Kesten --- p.14 / Chapter 3 --- Contraction Properties --- p.19 / Chapter 3.1 --- Two basic lemmas --- p.20 / Chapter 3.2 --- Contracting sets --- p.25 / Chapter 3.3 --- Strong irreducibility --- p.29 / Chapter 3.4 --- A key property --- p.30 / Chapter 3.5 --- Contracting action on P(Rd) and converges in direction --- p.36 / Chapter 3.6 --- Lyapunov exponents --- p.39 / Chapter 3.7 --- Comparison of the top Lyapunov exponents and Fursten- berg's theorem --- p.43 / Chapter 4 --- Analytic Dependence of Lyapunov Exponents on The Probabilities --- p.48 / Chapter 4.1 --- Continuity and analyticity properties for i.i.d. products --- p.49 / Chapter 4.2 --- The proof of the main result --- p.50 / Chapter 5 --- The Expression of The Upper Lyapunov Exponent in Complex Functions --- p.54 / Chapter 5.1 --- The set-up --- p.54 / Chapter 5.2 --- The main result --- p.56 / Bibliography --- p.58
4

Topics in Combinatorics and Random Matrix Theory

Novak, JONATHAN 27 September 2009 (has links)
Motivated by the longest increasing subsequence problem, we examine sundry topics at the interface of enumerative/algebraic combinatorics and random matrix theory. We begin with an expository account of the increasing subsequence problem, contextualizing it as an ``exactly solvable'' Ramsey-type problem and introducing the RSK correspondence. New proofs and generalizations of some of the key results in increasing subsequence theory are given. These include Regev's single scaling limit, Gessel's Toeplitz determinant identity, and Rains' integral representation. The double scaling limit (Baik-Deift-Johansson theorem) is briefly described, although we have no new results in that direction. Following up on the appearance of determinantal generating functions in increasing subsequence type problems, we are led to a connection between combinatorics and the ensemble of truncated random unitary matrices, which we describe in terms of Fisher's random-turns vicious walker model from statistical mechanics. We prove that the moment generating function of the trace of a truncated random unitary matrix is the grand canonical partition function for Fisher's random-turns model with reunions. Finally, we consider unitary matrix integrals of a very general type, namely the ``correlation functions'' of entries of Haar-distributed random matrices. We show that these expand perturbatively as generating functions for class multiplicities in symmetric functions of Jucys-Murphy elements, thus addressing a problem originally raised by De Wit and t'Hooft and recently resurrected by Collins. We argue that this expansion is the CUE counterpart of genus expansion. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2009-09-27 12:27:21.479
5

Characteristic polynomials of random matrices and quantum chaotic scattering

Nock, Andre January 2017 (has links)
Scattering is a fundamental phenomenon in physics, e.g. large parts of the knowledge about quantum systems stem from scattering experiments. A scattering process can be completely characterized by its K-matrix, also known as the \Wigner reaction matrix" in nuclear scattering or \impedance matrix" in the electromagnetic wave scattering. For chaotic quantum systems it can be modelled within the framework of Random Matrix Theory (RMT), where either the K-matrix itself or its underlying Hamiltonian is taken as a random matrix. These two approaches are believed to lead to the same results due to a universality conjecture by P. Brouwer, which is equivalent to the claim that the probability distribution of K, for a broad class of invariant ensembles of random Hermitian matrices H, converges to a matrix Cauchy distribution in the limit of large matrix dimension of H. For unitarily invariant ensembles, this conjecture will be proved in the thesis by explicit calculation, utilising results about ensemble averages of characteristic polynomials. This thesis furthermore analyses various characteristics of the K-matrix such as the distribution of a diagonal element at the spectral edge or the distribution of an off-diagonal element in the bulk of the spectrum. For the latter it is necessary to know correlation functions involving products and ratios of half-integer powers of characteristic polynomials of random matrices for the Gaussian Orthogonal Ensemble (GOE), which is an interesting and important topic in itself, as they frequently arise in various other applications of RMT to physics of quantum chaotic systems, and beyond. A larger part of the thesis is dedicated to provide an explicit evaluation of the large-N limits of a few non-trivial objects of that sort within a variant of the supersymmetry formalism, and via a related but different method.
6

Overcrowding asymptotics for the Sine(beta) process

Holcomb, Diane, Valkó, Benedek 08 1900 (has links)
We give overcrowding estimates for the Sine(beta) process, the bulk point process limit of the Gaussian beta-ensemble. We show that the probability of having exactly n points in a fixed interval is given by e(-beta/2n2) log(n)+O(n(2)) as n -> infinity. We also identify the next order term in the exponent if the size of the interval goes to zero.
7

Order determination for large matrices with spiked structure

Zeng, Yicheng 20 August 2019 (has links)
Motivated by dimension reduction in regression analysis and signal detection, we investigate order determination for large dimensional matrices with spiked structures in which the dimensions of the matrices are proportional to the sample sizes. Because the asymptotic behaviors of the estimated eigenvalues differ completely from those in fixed dimension scenarios, we then discuss the largest possible order, say q, we can identify and introduce criteria for different settings of q. When q is assumed to be fixed, we propose a "valley-cliff" criterion with two versions - one based on the original differences of eigenvalues and the other based on the transformed differences - to reduce the effect of ridge selection in the criterion. This generic method is very easy to implement and computationally inexpensive, and it can be applied to various matrices. As examples, we focus on spiked population models, spiked Fisher matrices and factor models with auto-covariance matrices. For the case of divergent q, we propose a scale-adjusted truncated double ridge ratio (STDRR) criterion, where a scale adjustment is implemented to deal with the bias in scale parameter for large q. Again, examples include spiked population models, spiked Fisher matrices. Numerical studies are conducted to examine the finite sample performances of the method and to compare it with existing methods. As for theoretical contributions, we investigate the limiting properties, including convergence in probability and central limit theorems, for spiked eigenvalues of spiked Fisher matrices with divergent q. Keywords: Auto-covariance matrix, factor model, finite-rank perturbation, Fisher matrix, principal component analysis (PCA), phase transition, random matrix theory (RMT), ridge ratio, spiked population model.
8

Gaussian fluctuations in some determinantal processes

Hägg, Jonas January 2007 (has links)
This thesis consists of two parts, Papers A and B, in which some stochastic processes, originating from random matrix theory (RMT), are studied. In the first paper we study the fluctuations of the kth largest eigenvalue, xk, of the Gaussian unitary ensemble (GUE). That is, let N be the dimension of the matrix and k depend on N in such a way that k and N-k both tend to infinity as N - ∞. The main result is that xk, when appropriately rescaled, converges in distribution to a Gaussian random variable as N → ∞. Furthermore, if k1 < ...< km are such that k1, ki+1 - ki and N - km, i =1, ... ,m - 1, tend to infinity as N → ∞ it is shown that (xk1 , ... , xkm) is multivariate Gaussian in the rescaled N → ∞ limit. In the second paper we study the Airy process, A(t), and prove that it fluctuates like a Brownian motion on a local scale. We also prove that the Discrete polynuclear growth process (PNG) fluctuates like a Brownian motion in a scaling limit smaller than the one where one gets the Airy process. / QC 20100716
9

Aspects of random matrix theory: concentration and subsequence problems

Xu, Hua 17 November 2008 (has links)
The present work studies some aspects of random matrix theory. Its first part is devoted to the asymptotics of random matrices with infinitely divisible, in particular heavy-tailed, entries. Its second part focuses on relations between limiting law in subsequence problems and spectra of random matrices.
10

Ranks of random matrices and graphs

Costello, Kevin1981-, January 2007 (has links)
Thesis (Ph. D.)--Rutgers University, 2007. / "Graduate Program in Mathematics." Includes bibliographical references (p. 64-65).

Page generated in 0.0878 seconds