Results 1  10
of
169
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2148 (11 self)
 Add to MetaCart
(Show Context)
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as random graphs, it is increasingly recognized that the topology and evolution of real
LevelSpacing Distributions and the Airy Kernel
 COMMUNICATIONS IN MATHEMATICAL PHYSICS
, 1994
"... Scaling levelspacing distribution functions in the "bulk of the spectrum" in random matrix models of N x N hermitian matrices and then going to the limit N — » oo leads to the Fredholm determinant of the sine kernel sinπ(x — y)/π(x — y). Similarly a scaling limit at the "edge o ..."
Abstract

Cited by 430 (24 self)
 Add to MetaCart
Scaling levelspacing distribution functions in the "bulk of the spectrum" in random matrix models of N x N hermitian matrices and then going to the limit N — » oo leads to the Fredholm determinant of the sine kernel sinπ(x — y)/π(x — y). Similarly a scaling limit at the &quot;edge of the spectrum &quot; leads to the Airy kernel [Ai(x) Ai(y) — Ai (x) Ai(y)]/(x — y). In this paper we derive analogues for this Airy kernel of the following properties of the sine kernel: the completely integrable system of P.D.E.'s found by Jimbo, Miwa, Mori, and Sato; the expression, in the case of a single interval, of the Fredholm determinant in terms of a Painleve transcendent; the existence of a commuting differential operator; and the fact that this operator can be used in the derivation of asymptotics, for general n, of the probability that an interval contains precisely n eigenvalues.
A unified framework for highdimensional analysis of Mestimators with decomposable regularizers
"... ..."
Discrete orthogonal polynomial ensembles and the Plancherel measure
, 2001
"... We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of as probability measures on partitions. The Meixner ensemble i ..."
Abstract

Cited by 189 (10 self)
 Add to MetaCart
(Show Context)
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of as probability measures on partitions. The Meixner ensemble is related to a twodimensional directed growth model, and the Charlier ensemble is related to the lengths of weakly increasing subsequences in random words. The Krawtchouk ensemble occurs in connection with zigzag paths in random domino tilings of the Aztec diamond, and also in a certain simplified directed firstpassage percolation model. We use the Charlier ensemble to investigate the asymptotics of weakly increasing subsequences in random words and to prove a conjecture of Tracy and Widom. As a limit of the Meixner ensemble or the Charlier ensemble we obtain the Plancherel measure on partitions, and using this we prove a conjecture of Baik, Deift and Johansson that under the Plancherel measure, the distribution of the lengths of the first k rows in the partition, appropriately scaled, converges to the asymptotic joint distribution for the k largest eigenvalues of a random matrix from the Gaussian Unitary Ensemble. In this problem a certain discrete kernel, which we call the discrete Bessel kernel, plays an important role.
Discrete Polynuclear Growth and Determinantal processes
 Comm. Math. Phys
, 2003
"... Abstract. We consider a discrete polynuclear growth (PNG) process and prove a functional limit theorem for its convergence to the Airy process. This generalizes previous results by Prähofer and Spohn. The result enables us to express the F1 GOE TracyWidom distribution in terms of the Airy process. ..."
Abstract

Cited by 162 (11 self)
 Add to MetaCart
(Show Context)
Abstract. We consider a discrete polynuclear growth (PNG) process and prove a functional limit theorem for its convergence to the Airy process. This generalizes previous results by Prähofer and Spohn. The result enables us to express the F1 GOE TracyWidom distribution in terms of the Airy process. We also show some results and give a conjecture about the transversal fluctuations in a point to line last passage percolation problem. 1. Introduction and
Nonintersecting paths, random tilings and random matrices
 Probab. Theory Related Fields
, 2002
"... Abstract. We investigate certain measures induced by families of nonintersecting paths in domino tilings of the Aztec diamond, rhombus tilings of an abchexagon, a dimer model on a cylindrical brick lattice and a growth model. The measures obtained, e.g. the Krawtchouk and Hahn ensembles, have the s ..."
Abstract

Cited by 125 (11 self)
 Add to MetaCart
(Show Context)
Abstract. We investigate certain measures induced by families of nonintersecting paths in domino tilings of the Aztec diamond, rhombus tilings of an abchexagon, a dimer model on a cylindrical brick lattice and a growth model. The measures obtained, e.g. the Krawtchouk and Hahn ensembles, have the same structure as the eigenvalue measures in random matrix theory like GUE, which can in fact can be obtained from nonintersecting Brownian motions. The derivations of the measures are based on the KarlinMcGregor or LindströmGesselViennot method. We use the measures to show some asymptotic results for the models. 1.
Flux compactification
"... Contents We review recent work in which compactifications of string and M theory are constructed in which all scalar fields (moduli) are massive, and supersymmetry is broken with a small positive cosmological constant, features needed to reproduce real world physics. We explain how this work implies ..."
Abstract

Cited by 107 (4 self)
 Add to MetaCart
(Show Context)
Contents We review recent work in which compactifications of string and M theory are constructed in which all scalar fields (moduli) are massive, and supersymmetry is broken with a small positive cosmological constant, features needed to reproduce real world physics. We explain how this work implies that there is a “landscape ” of string/M theory vacua, perhaps containing many candidates
Universality of the Local Spacing Distribution in Certain Ensembles of Hermitian Wigner Matrices
 MATRICES, COMMUN. MATH. PHYS
, 2001
"... Consider an N × N hermitian random matrix with independent entries, not necessarily Gaussian, a so called Wigner matrix. It has been conjectured that the local spacing distribution, i.e. the distribution of the distance between nearest neighbour eigenvalues in some part of the spectrum is, in the ..."
Abstract

Cited by 102 (5 self)
 Add to MetaCart
Consider an N × N hermitian random matrix with independent entries, not necessarily Gaussian, a so called Wigner matrix. It has been conjectured that the local spacing distribution, i.e. the distribution of the distance between nearest neighbour eigenvalues in some part of the spectrum is, in the limit as N → ∞, the same as that of hermitian random matrices from GUE. We prove this conjecture for a certain subclass of hermitian Wigner matrices.
A note on universality of the distribution of the largest eigenvalues in certain sample covariance matrices
 J. Statist. Phys
, 2002
"... Recently Johansson (21) and Johnstone (16) proved that the distribution of the (properly rescaled) largest principal component of the complex (real) Wishart matrix X g X(X t X) converges to the Tracy–Widom law as n, p (the dimensions of X) tend to. in some ratio n/p Q c>0.We extend these results ..."
Abstract

Cited by 92 (4 self)
 Add to MetaCart
(Show Context)
Recently Johansson (21) and Johnstone (16) proved that the distribution of the (properly rescaled) largest principal component of the complex (real) Wishart matrix X g X(X t X) converges to the Tracy–Widom law as n, p (the dimensions of X) tend to. in some ratio n/p Q c>0.We extend these results in two directions. First of all, we prove that the joint distribution of the first, second, third, etc. eigenvalues of a Wishart matrix converges (after a proper rescaling) to the Tracy–Widom distribution. Second of all, we explain how the combinatorial machinery developed for Wigner random matrices in refs. 27, 38, and 39 allows to extend the results by Johansson and Johnstone to the case of X with nonGaussian entries, provided n − p=O(p 1/3). We also prove that l max [ (n 1/2 +p 1/2) 2 +O(p 1/2 log(p)) (a.e.) for general c>0. KEY WORDS: Sample covariance matrices; principal component; Tracy– Widom distribution.