The paper focuses on the largest eigenvalues of theβ-Hermite ensemble and theβ-Laguerre ensemble. In particular, we obtain the precise moment convergence rates of their largest eigenvalues. The results are motivated...The paper focuses on the largest eigenvalues of theβ-Hermite ensemble and theβ-Laguerre ensemble. In particular, we obtain the precise moment convergence rates of their largest eigenvalues. The results are motivated by the complete convergence for partial sums of i.i.d, random variables, and the proofs depend on the small deviations for largest eigenvalues of the β ensembles and tail inequalities of the generalβ Tracy-Widom law.展开更多
We use tridiagonal models to study the limiting behavior of β-Laguerre and β-Jacobi ensembles,focusing on the limiting behavior of the extremal eigenvalues and the central limit theorem for the two ensembles.For the...We use tridiagonal models to study the limiting behavior of β-Laguerre and β-Jacobi ensembles,focusing on the limiting behavior of the extremal eigenvalues and the central limit theorem for the two ensembles.For the central limit theorem of β-Laguerre ensembles,we follow the idea in[1]while giving a modified version for the generalized case.Then we use the total variation distance between the two sorts of ensembles to obtain the limiting behavior of β-Jacobi ensembles.展开更多
We first apply non-negative matrix theory to the matrix K=D+A,where D and A are the degree-diagonal and adjacency matrices of a graph G,respectively,to establish a relation on the largest Laplacian eigenvalue λ_1(G)o...We first apply non-negative matrix theory to the matrix K=D+A,where D and A are the degree-diagonal and adjacency matrices of a graph G,respectively,to establish a relation on the largest Laplacian eigenvalue λ_1(G)of G and the spectral radius ρ(K)of K.And then by using this relation we present two upper bounds for λ_1(G)and determine the extremal graphs which achieve the upper bounds.展开更多
The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adj...The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results.展开更多
We offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least n+1/n−1 provided the graph is not complete and that equality is attained if and onl...We offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least n+1/n−1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size n−1/2.With the same method,we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree,provided this is at most n−1/2.展开更多
Let G（V, E） be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V（Cm）. The G - E（Cm） are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti an...Let G（V, E） be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V（Cm）. The G - E（Cm） are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui ： i = 1, 2 , m}. Let κ = ec＋1. Forj = 1,2,...,k- 1, let δij = max{dv ： dist（v, ui） = j,v ∈ Ti}, δj = max{δij ： i = 1, 2,..., m}, δ0 = max{dui ： ui ∈ V（Cm）}. Then λ1（G）≤max{max 2≤j≤k-2 （√δj-1-1＋√δj-1）,2＋√δ0-2,√δ0-2＋√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 （G） is the largest eigenvalue of the adjacency matrix of G.展开更多
The author considers the largest eigenvaiues of random matrices from Gaussian unitary ensemble and Laguerre unitary ensemble, and the rightmost charge in certain random growth models. We obtain some precise asymptotic...The author considers the largest eigenvaiues of random matrices from Gaussian unitary ensemble and Laguerre unitary ensemble, and the rightmost charge in certain random growth models. We obtain some precise asymptotics results, which are in a sense similar to the precise asymptotics for sums of independent random variables in the context of the law of large numbers and complete convergence. Our proofs depend heavily upon the upper and lower tail estimates for random matrices and random growth models. The Tracy-Widom distribution plays a central role as well.展开更多
We define weakly positive tensors and study the relations among essentially positive tensors, weakly positive tensors, and primitive tensors. In particular, an explicit linear convergence rate of the Liu-Zhou-Ibrahim...We define weakly positive tensors and study the relations among essentially positive tensors, weakly positive tensors, and primitive tensors. In particular, an explicit linear convergence rate of the Liu-Zhou-Ibrahim（LZI） algorithm for finding the largest eigenvalue of an irreducible nonnegative tensor, is established for weakly positive tensors. Numerical results are given to demonstrate linear convergence of the LZI algorithm for weakly positive tensors.展开更多
基金Supported partly by the National Natural Science Foundation of China (Grant Nos. 11071213, 11101362)Zhejiang Provincial Natural Science Foundation of China (Grant No. R6090034)Research Fund for the Doctoral Program of Higher Education (Grant No. 20100101110001)
文摘The paper focuses on the largest eigenvalues of theβ-Hermite ensemble and theβ-Laguerre ensemble. In particular, we obtain the precise moment convergence rates of their largest eigenvalues. The results are motivated by the complete convergence for partial sums of i.i.d, random variables, and the proofs depend on the small deviations for largest eigenvalues of the β ensembles and tail inequalities of the generalβ Tracy-Widom law.
文摘We use tridiagonal models to study the limiting behavior of β-Laguerre and β-Jacobi ensembles,focusing on the limiting behavior of the extremal eigenvalues and the central limit theorem for the two ensembles.For the central limit theorem of β-Laguerre ensembles,we follow the idea in[1]while giving a modified version for the generalized case.Then we use the total variation distance between the two sorts of ensembles to obtain the limiting behavior of β-Jacobi ensembles.
基金Supported by National Natural Science Foundation of China(Grant No.19971086)
文摘We first apply non-negative matrix theory to the matrix K=D+A,where D and A are the degree-diagonal and adjacency matrices of a graph G,respectively,to establish a relation on the largest Laplacian eigenvalue λ_1(G)of G and the spectral radius ρ(K)of K.And then by using this relation we present two upper bounds for λ_1(G)and determine the extremal graphs which achieve the upper bounds.
基金Foundation item： the National Natural Science Foundation of China （No. 10871204） Graduate Innovation Foundation of China University of Petroleum （No. S2008-26）.
文摘The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results.
文摘We offer a new method for proving that the maxima eigenvalue of the normalized graph Laplacian of a graph with n vertices is at least n+1/n−1 provided the graph is not complete and that equality is attained if and only if the complement graph is a single edge or a complete bipartite graph with both parts of size n−1/2.With the same method,we also prove a new lower bound to the largest eigenvalue in terms of the minimum vertex degree,provided this is at most n−1/2.
基金Foundation item： the National Natural Science Foundation of China （No. 10861009）.
文摘Let G（V, E） be a unicyclic graph, Cm be a cycle of length m and Cm G, and ui ∈ V（Cm）. The G - E（Cm） are m trees, denoted by Ti, i = 1, 2,..., m. For i = 1, 2,..., m, let eui be the excentricity of ui in Ti and ec = max{eui ： i = 1, 2 , m}. Let κ = ec＋1. Forj = 1,2,...,k- 1, let δij = max{dv ： dist（v, ui） = j,v ∈ Ti}, δj = max{δij ： i = 1, 2,..., m}, δ0 = max{dui ： ui ∈ V（Cm）}. Then λ1（G）≤max{max 2≤j≤k-2 （√δj-1-1＋√δj-1）,2＋√δ0-2,√δ0-2＋√δ1-1}. If G ≌ Cn, then the equality holds, where λ1 （G） is the largest eigenvalue of the adjacency matrix of G.
基金NSF of China (No.10371109,10671176)the Royal Society K.C.Wong Education Foundation
文摘The author considers the largest eigenvaiues of random matrices from Gaussian unitary ensemble and Laguerre unitary ensemble, and the rightmost charge in certain random growth models. We obtain some precise asymptotics results, which are in a sense similar to the precise asymptotics for sums of independent random variables in the context of the law of large numbers and complete convergence. Our proofs depend heavily upon the upper and lower tail estimates for random matrices and random growth models. The Tracy-Widom distribution plays a central role as well.
基金Acknowledgments. This first author＇s work was supported by the National Natural Science Foundation of China （Grant No. 10871113）. This second author＇s work was supported by the Hong Kong Research Grant Council.
文摘We define weakly positive tensors and study the relations among essentially positive tensors, weakly positive tensors, and primitive tensors. In particular, an explicit linear convergence rate of the Liu-Zhou-Ibrahim（LZI） algorithm for finding the largest eigenvalue of an irreducible nonnegative tensor, is established for weakly positive tensors. Numerical results are given to demonstrate linear convergence of the LZI algorithm for weakly positive tensors.
