The connectivity of a graph on uniform points on [0,1]

A random graph G_n(x) is constructed on independent random points U₁,…,U_n distributed uniformly on [0,1]^d, d1, in which two distinct such points are joined by an edge if the l_∞-distance between them is at most some prescribed value 0<x<1. The connectivity distance c_n, the smallest x for which G_n(x) is connected, is shown to satisfy

(1)

For d2, the random graph G_n(x) behaves like a d-dimensional version of the random graphs of Erdös and Rényi, despite the fact that its edges are not independent: c_n/d_n→1, a.s., as n→∞, where d_n is the largest nearest-neighbor link, the smallest x for which G_n(x) has no isolated vertices.     

Graphs with only caterpillars as spanning trees

A connected graph G is caterpillar-pure if each spanning tree of G is a caterpillar. The caterpillar-pure graphs are fully characterized. Loosely speaking they are strings or necklaces of so-called pearls, except for a number of small exceptional cases. An upper bound for the number of edges in terms of the order is given for caterpillar-pure graphs, and those which attain the upper bound are characterized.     

有向树的部分逆M矩阵完备及其算法设计

1 引言 M矩阵是具有非正非对角元且其逆是非负矩阵的一类矩阵．逆M矩阵是逆为M矩阵的一类非负矩阵．部分矩阵是指一个矩阵中一些元已定,其余未定元还可以自由选择的矩阵．如果在一个部分矩阵中,其每个已定的主子矩阵均为逆M矩阵并且所有已定元均是非负的,称这个部分矩阵是一个部分逆M矩阵．一个部分逆M矩阵的完备式是对     

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs

A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v∈V(G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.     

大型交通规划模型及其性质

本文提出了一个大型交通规则的模型，并研究了该模型中约束矩阵中基的性质．     

在有向网络中寻找最小支撑入树的计算方法

本文研究了有向网络中支撑入树的性质 ,提出了在有向网络图中寻找以某一指定点为根的最小支撑入树的一种较简便的算法 ,并给出了应用该算法的一个实际算例     

黄鳝DEAD-box家族PL10基因的克隆与序列分析

通过PCR克隆的方法，从黄鳝(Monopterus albus)中得到两个PL10基因的cDNA片段Mo PL10A和Mo PL10B，长度均为1．127kb，推测其编码375个氨基酸的蛋白片段．结合其他PL10类同源物序列，对这两条cDNA进行了分析和初步的功能推测．根据此片段的氨基酸序列构建的系统发育树与形态分类结果一致．在不同组织中的RT—PCR结果表明Mo PL10A和Mo PL10B的mRNA在各组织中的分布有差异．     

Some New Results for McKean’s Graphs with Applications to Kac’s Equation

The main goal of the present paper is to sharpen some results about the error made when the Wild sums, used to represent the solution of the Kac analog of Boltzmann’s equation, are truncated at the n-th stage. More precisely, in Carlen, Carvalho and Gabetta (J. Funct. Anal. 220: 362–387 (2005)), one finds a bound for the above-mentioned error which depends on (an ^Λ+ε). On the one hand, it is shown that Λ, the least negative eigenvalue of the linearized collision operator, is the best possible exponent. On the other hand, ε is an extra strictly positive number and a a positive coefficient which depends on ε too. Thus, it is interesting to check whether ε can be removed from the above bound. According to the aforesaid reference, this problem is studied here by means of the probability distribution of the depth of a leaf in a McKean random tree. In fact, an accurate study of the probability generating function of such a depth leads to conclude that the above bound can be replaced with (a′ n ^Λ).     

On the height of random m-ary search trees

A random m-ary seach tree is constructed from a random permutation of 1,…, n. A law of large numbers is obtained for the height H_n of these trees by applying the theory of branching random walks. in particular, it is shown that H_n/log n→γ in probability as n→∞ where γ = γ(m) is a constant depending upon m only. Interestingly, as m→∞, γ(m) is asymptotic to 1/log m, the coefficient of log n in the asymptotic expression for the height of the complete m-ary search tree. This proves that for large m, random m-ary search trees behave virtually like complete m-ary trees.