理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-10 共查到数学 Largest相关记录10条 . 查询时间(0.015 秒)
Let x1 denote the square of the largest singular value of an n × p matrix X, all of whose entries are independent standard Gaussian varates. Equivalently, x1 is the largest principal component vari...
Abstract: For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions...
We consider the limiting location and limiting distribution of the largest eigenvalue in real symmetric (β = 1), Hermitian (β = 2), and Hermitian self-dual (β = 4) random matrix models with rank 1 e...
This paper focuses on the asymptotic behaviors of the length of the largest $1$-cluster in a finite iid Bernoulli sequence. We first reveal a critical phenomenon on the length and then study its limit...
Let $ \{X, X_{k,i}; i \geq 1, k \geq 1 \}$ be a double array of nondegenerate i.i.d. random variables and let $\{p_{n}; n \geq 1 \}$ be a sequence of positive integers such that $n/p_{n}$ is bounded a...
A strategy to evaluate the distribution of the largest Schmidt eigenvalue for entangled random pure states of bipartite systems is proposed. We point out that the multiple integral defining the sought...
In this paper, we show that if p is a prime and G is a p-solvable group, then |G: Op(G)|p  (b(G)p/p)1/(p−1) where b(G) is the largest character degree of G. If p is an odd prime that is not a M...
All bipartite graphs whose third largest Laplacian eigenvalue is less than 3 have been characterized by Zhang. In this paper, all connected non-bipartite graphs with third largest Laplacian eigenvalue...
In this paper, we consider the semi-online preemptive scheduling problem with known largest job sizes on two uniform machines. Our goal is to maximize the continuous period of time (starting from time...
In this paper,we give the upper bound and lower bound of k-th largest eigenvalue λ_κ of the Laplacian matrix of a graph G in terms of the edge number of G and the number of spanning trees of G.

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...