云南高校图书馆联盟文献共享服务平台- DISTANCE

DISTANCE: 作品数：1024被引量：1416H指数：14; 导出分析报告; 相关领域：自动化与计算机技术更多>>; 相关作者：李忠秋郝煦赵博文潘美朱顺荣更多>>; 相关机构：华中科技大学中国科学院南京航空航天大学清华大学更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金国家重点基础研究发展计划中国博士后科学基金国家教育部博士点基金更多>>

Limit Laws for the Maximum Interpoint Distance under a 1-Dependent Assumption: 《Journal of Mathematical Research with Applications》2025年第1期105-124,共20页Haibin ZHANG Yong ZHANG Xue DING; Supported by the National Natural Science Foundation of China(Grant Nos.11771178;12171198);the Science and Technology Development Program of Jilin Province(Grant No.20210101467JC);the Technology Program of Jilin Educational Department During the“14th Five-Year”Plan Period(Grant No.JJKH20241239KJ);the Fundamental Research Funds for the Central Universities.; Let M_(n,p)=(X_(i,k))_(n×p)be an n×p random matrix whose p columns X^((1)),...,X^((p))are an n-dimensional i.i.d.random sample of size p from 1-dependent Gaussian populations.Instead of investigating the special cas...; 关键词：maximum interpoint distance extreme-value distribution Chen-Stein Poisson approximation moderation deviation 1-dependent

Extensions of the Graham-Hoffman-Hosoya Type Theorems for the Exponential Distance Matrices and q-Distance Matrices: 《Journal of Mathematical Research with Applications》2024年第6期723-734,共12页Jie WANG; Let G be a strongly connected directed weighted graph with vertex set{v_(1),v_(2),...,v_(n)},in which each edge e is assigned with an arbitrary nonzero weight w(e).For any two vertices v_i,v_(j )of G,the distance d_(i...; 关键词：distance matrices exponential distance matrices q-distance matrices determinants COFACTORS cofactor sums

Wasserstein-1 Distance and Nonuniform Berry-Esseen Bound for a Supercritical Branching Process in a Random Environment: 《Journal of Mathematical Research with Applications》2023年第6期737-753,共17页Hao WU Xiequan FAN Zhiqiang GAO Yinna YE; Supported by the National Natural Science Foundation of China(Grant No.11971063);CY Initiative of Excellence(Grant No.“Investissements d’Avenir”ANR-16-IDEX-0008);Project“EcoDep”(Grant No.PSI-AAP2020-0000000013)。; Let(Z_(n))_(n)≥0be a supercritical branching process in an independent and identically distributed random environment.We establish an optimal convergence rate in the Wasserstein-1 distance for the process(Z_(n))_(n)...; 关键词：Branching processes Random environment Wasserstein-1 distance Nonuniform Berry-Esseen bounds MR(2020)Subject Classification 60J80 60K37 60F05 62E20

Some Results on the Resistance-Distance Spectrum: 《Journal of Mathematical Research with Applications》2023年第5期522-534,共13页Leyou XU Bo ZHOU; Supported by the National Natural Science Foundation of China (Grant No. 12071158)。; For vertices u and v in graph G, the resistance distance r G(u, v) between u and v is the effective resistance between them in an electrical network corresponding to G when the resistance between any adjacent vertices...; 关键词：resistance distance resistance-distance eigenvalues cut edges

On the Distance Signless Laplacian Spectral Radius of Bicyclic Graphs: 《Journal of Mathematical Research with Applications》2023年第3期289-302,共14页Nannan XU Aimei YU; Supported by the National Natural Science Foundation of China (Grant No.11971054)。; The distance signless Laplacian matrix of a connected graph G is defined as Q(G)=Tr(G)+D(G), where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G. The largest eigenv...; 关键词：distance signless Laplacian matrix spectral radius bicyclic graph

Extremal First Leap Zagreb Index of k-Generalized Quasi-Trees: 《Journal of Mathematical Research with Applications》2022年第3期221-229,共9页Pei SUN Kai LIU; Supported by the Foundation of Henan Department of Science and Technology(Grant No.182102310830);the Foundation of Henan University of Engineering(Grant No.D2016018);the Foundation of Henan Educational Committee(Grant Nos.20A110016;2020GGJS239)。; For a graph G,the first leap Zagreb index is defined as LM_(1)(G)=∑_(ν∈V(G))d_(2)(v/G)^(2),where d_(2)(v/G) is the 2-distance degree of a vertex v in G.Let QT^(k)(n) be the set of kgeneralized quasi-trees with n ve...; 关键词：k-generalized quasi-trees the first leap Zagreb index 2-distance degree

Best Proximity Point Theorems for p-Proximalα-η-β-Quasi Contractions in Metric Spaces with w_(0)-Distance: 《Journal of Mathematical Research with Applications》2022年第1期95-110,共16页Mengdi LIU Zhaoqi WU Chuanxi ZHU Chenggui YUAN; Supported by the National Natural Science Foundation of China(Grant Nos.12161056,11701259,11771198);the Natural Science Foundation of Jiangxi Province(Grant No.20202BAB201001)。; In this paper,we propose a new class of non-self mappings called p-proximalα-η-β-quasi contraction,and introduce the concepts ofα-proximal admissible mapping with respect toηand(α,d)regular mapping with respect...; 关键词：best proximity point p-proximalα-η-βquasi contraction w_(0)-distance α-proximal admissible mapping with respect toη (α d)regular mapping with respect toη

On the Distance Spectra of Several Double Neighbourhood Corona Graphs被引量：1: 《Journal of Mathematical Research with Applications》2019年第3期233-248,共16页Xiaojing XU Zhiping WANG Jiaxue XU; Supported by the Dalian Science and Technology Project(Grant No.2015A11GX016); Let G be a connected graph of order n and D(G) be its distance matrix. The distance eigenvalues of G are the eigenvalues of its distance matrix. Its distance eigenvalues and their multiplicities constitute the distanc...; 关键词：CORONA DISTANCE spectrum DOUBLE neighbourhood CORONA graph BLOCK matrix

A Note on the Signless Laplacian and Distance Signless Laplacian Eigenvalues of Graphs被引量：1: 《Journal of Mathematical Research with Applications》2014年第6期647-654,共8页Fenglei TIAN Xiaoming LI Jianling ROU; Supported by the National Natural Science Foundation of China(Grant No.11171343); Let G be a simple graph. We first show that δ≥di-√[i/2][i/2], where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph...; 关键词：signless Laplacian distance signless Laplacian spectral radius eigenvalues

A Lower Bound for the Distance Signless Laplacian Spectral Radius of Graphs in Terms of Chromatic Number被引量：3: 《Journal of Mathematical Research with Applications》2014年第3期289-294,共6页Xiaoxin LI Yizheng FAN Shuping ZHA; Supported by National Natural Science Foundation of China(Grant Nos.11071002;11371028);Program for New Century Excellent Talents in University(Grant No.NCET-10-0001);Key Project of Chinese Ministry of Education(Grant No.210091);Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20103401110002);Natural Science Research Foundation of Department of Education of Anhui Province(Grant No.KJ2013A196);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(Grant No.KJJQ1001); Let G be a connected graph on n vertices with chromatic number k, and let ρ（G） be the distance signless Laplacian spectral radius of G. We show that ρ（G） ≥ 2n ＋ 2[n/k] - 4, with equality if and only if G is a...; 关键词：distance matrix distance signless Laplacian spectral radius chromatic number.

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

DISTANCE

检索结果分析

下载全文

高级检索检索式检索

时间限定

期刊范围

学科限定全选

高级检索 检索式检索

时间限定

期刊范围

学科限定全选

DISTANCE

检索结果分析

下载全文

用户登录

高级检索检索式检索