supported by the National Natural Science Foundation of China(Grant Nos.12101335 and 12271271);the Natural Science Foundation of Tianjin(Grant No.21JCQNJC00020);the Fundamental Research Funds for the Central Universities,Nankai University(Grant Nos.63211088 and 63221050);supported by National Natural Science Foundation of China(Grant No.12101332);supported by Shenzhen Wukong Investment Company,the Fundamental Research Funds for the Central Universities under(Grant No.ZB22000105);the China National Key R&D Program(Grant Nos.2019YFC1908502,2022YFA1003703,2022YFA1003802,2022YFA1003803);the National Natural Science Foundation of China(Grants Nos.12271271,11925106,12231011,11931001 and 11971247)。
This paper establishes the asymptotic independence between the quadratic form z^(T)Az and maximum max1≤i≤p|zi|of a sequence of independent sub-Gaussian random variables z=(z1m…zp)^(T).Based on this theoretical resu...
Supported by National Natural Science Foundation of China (Grant No. 12271229);Gansu Provincial Department of Education:Youth Doctoral fund project (Grant No. 2021QB-090)。
Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.A...
Supported by the National Nature Science Foundation of China(Grant Nos.11871329,11971298)。
For 0≤α<1,theα-spectral radius of an r-uniform hypergraph G is the spectral radius of A_(α)(G)=αD(G)+(1-α)A(G),where D(G)and A(G)are the diagonal tensor of degrees and adjacency tensor of G,respectively.In this ...
Supported by the National Natural Science Foundation of China(Grant No.11901006);the Natural Science Foundation of Anhui Province(Grant No.1908085QA06);the Talent Foundation of Anhui Normal University(Grant No.751811)。
In the high-dimensional setting,this article considers a canonical testing problem in multivariate analysis,namely testing coefficients in linear regression models.Several tests for highdimensional regression coeffici...
Supported by National Natural Science Foundation of China(Grant No.11771443);the Foundation of Innovative Science and Technology for Youth in Universities of Shandong Province,China(Grant No.2019KJI001)。
A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex.A proper total-k-coloring of G is called neighbor sum distinguishin...
Supported by National Natural Science Foundation of China(Grant Nos.11371355,11471193,11271006,11631014);the Foundation for Distinguished Young Scholars of Shandong Province(Grant No.JQ201501);the Fundamental Research Funds of Shandong University and Independent Innovation Foundation of Shandong University(Grant No.IFYT14012)
A proper edge-k-coloring of a graph G is a mapping from E(G) to {1, 2,..., k} such that no two adjacent edges receive the same color. A proper edge-k-coloring of G is called neighbor sum distinguishing if for each e...
partially supported by National Natural Science Foundation of China(Grant No.11371034)
We determine the maximum order Eg of finite groups G acting on the closed surface E9 of genus g which extends over (S3, ∑g) for all possible embeddings ∑g → S3, where g 〉 1.
We give expansions about the Gumbel distribution in inverse powers of n and logn for Mn, the maximum of a sample size n or n + 1 when the j-th observation is μ(j/n) + ej, μ is any smooth trend flmction and the r...
Supported by National Science Foundation of China(Grant No.11326175);Research Start-up Foundation of Jiaxing University(Grant No.70512021)
Let {X(t), t ≥ 0} be a standard(zero-mean, unit-variance) stationary Gaussian process with correlation function r(·) and continuous sample paths. In this paper, we consider the maxima M(T) = max{X(t), t∈ ...
Supported in part by China 973 Project(Grant No.2011CB80800);National Natural Science Foundation of China(Grant Nos.10531070,10721101,11222109 and 71101006);CAS Program for Cross & Cooperative Team of Science & Technology Innovation
We study asymmetric atomic selfish routing in ring networks, which has diverse practical applications in network design and analysis. We are concerned with minimizing the maximum latency of source-destination node-pai...