共查询到20条相似文献,搜索用时 49 毫秒
1.
图的广义连通度的概念是由Chartrand等人引入的.令S表示图G的一个非空顶点集,κ(S)表示图G中连结S的内部不交树的最大数目.那么,对任意一个满足2≤r≤n的整数r,定义G的广义r-连通度为所有κ(S)中的最小值,其中S取遍G的顶点集合的r-元子集.显然,κ_2(G)=κ(G),即为图G的顶点连通度.所以广义连通度是经典连通度的一个自然推广.本文研究了随机图的广义3-连通度,证明了对任一给定的整数k,k≥1,p=(log n+(k+1)log long n-log lon logn)/n是关于性质κ_3(G(n,p))≥k的紧阈值函数.我们得到的结果可以看作是Bollobas和Thomason给出的关于经典连通度结果的推广. 相似文献
2.
给出了可数状态空间中时间随机环境下可逗留随机游动的一个统一模型,对于一维紧邻时间随机环境下的随机游动,在一定的条件下,讨论它的极限性质和中心极限定理,该结论类似于空间随机环境下的随机游动的有关结论. 相似文献
3.
一类无标度随机图的度序列 总被引:1,自引:0,他引:1
本文从-个新的角度对-类随机图的度序列进行了分析.证明了此模型度分布的存在性,得到了网络规模比较大的情况下度为七的节点所占比例数的表达式.此外,我们还将模型扩展到每个时间步增加边数为随机变量的情形,得到了类似的结论. 相似文献
4.
5.
6.
In this paper, we prove that almost all circulant digraphs are strongly connected. Furthermore, for any given positive integer m, we show that almost every circulant digraph C has connectivity at least m/1 m(d(C) 1), where d(C) is the vertex degree of C. 相似文献
7.
8.
A continuous-time random graph process with state space consisting of the simple and directed graphs on N vertices is introduced.We obtain the stationary distribution of the process under different couditions and prove that the stationary distribution is unique. 相似文献
9.
强混合平稳序列的随机容量,随机秩顺序统计量的极限分布 总被引:2,自引:0,他引:2
§1.引言 设{X_n,n≥1}为严平稳随机序列,一维边际分布函数为F(x),W_1(n)≤W_2~(n)≤…≤W_n~(n)为X_1,X_2,…,X_n的顺序统计量.若K_n≤n为正整数列,则称W_K_n~(n)为非随机秩顺序统计量,秩为K_n;若M_n,N_n,n≥1为两正整值随机序列,N_n≤M_n,a.e., 相似文献
10.
11.
In this article, local limit theorems for sequences of simple random walks on graphs are established. The results formulated
are motivated by a variety of random graph models, and explanations are provided as to how they apply to supercritical percolation
clusters, graph trees converging to the continuum random tree and the homogenisation problem for nested fractals. A subsequential
local limit theorem for the simple random walks on generalised Sierpinski carpet graphs is also presented.
相似文献
12.
Generalized random graphs are considered where the presence or absence of an edge depends on the weights of its nodes. Our main interest is to investigate large deviations for the number of edges per node in such a generalized random graph, where the node weights are deterministic under some regularity conditions, as well as chosen i.i.d. from a finite set with positive components. When the node weights are random variables, obstacles arise because the independence among edges no longer exists, our main tools are some results of large deviations for mixtures. After calculating, our results show that the corresponding rate functions for the deterministic case and the random case are very different. 相似文献
13.
14.
C. Boldrighini R. A. Minlos A. Pellegrinotti 《Probability Theory and Related Fields》1997,109(2):245-273
Summary We consider a model of random walk on ℤν, ν≥2, in a dynamical random environment described by a field ξ={ξ
t
(x): (t,x)∈ℤν+1}. The random walk transition probabilities are taken as P(X
t
+1= y|X
t
= x,ξ
t
=η) =P
0( y−x)+ c(y−x;η(x)). We assume that the variables {ξ
t
(x):(t,x) ∈ℤν+1} are i.i.d., that both P
0(u) and c(u;s) are finite range in u, and that the random term c(u;·) is small and with zero average. We prove that the C.L.T. holds almost-surely, with the same parameters as for P
0, for all ν≥2. For ν≥3 there is a finite random (i.e., dependent on ξ) correction to the average of X
t
, and there is a corresponding random correction of order to the C.L.T.. For ν≥5 there is a finite random correction to the covariance matrix of X
t
and a corresponding correction of order to the C.L.T.. Proofs are based on some new L
p
estimates for a class of functionals of the field.
Received: 4 January 1996/In revised form: 26 May 1997 相似文献
15.
Pierre Latouche Stéphane Robin Sarah Ouadah 《Journal of computational and graphical statistics》2018,27(1):98-109
Logistic regression is a natural and simple tool to understand how covariates contribute to explain the topology of a binary network. Once the model is fitted, the practitioner is interested in the goodness of fit of the regression to check if the covariates are sufficient to explain the whole topology of the network and, if they are not, to analyze the residual structure. To address this problem, we introduce a generic model that combines logistic regression with a network-oriented residual term. This residual term takes the form of the graphon function of a W-graph. Using a variational Bayes framework, we infer the residual graphon by averaging over a series of blockwise constant functions. This approach allows us to define a generic goodness-of-fit criterion, which corresponds to the posterior probability for the residual graphon to be constant. Experiments on toy data are carried out to assess the accuracy of the procedure. Several networks from social sciences and ecology are studied to illustrate the proposed methodology. Supplementary material for this article is available online. 相似文献
16.
17.
本文引入任意随机变量序列随机极限对数似然比概念,作为任意相依随机序列联合分布与其边缘乘积分布“不相似”性的一种度量,利用构造新的密度函数方法来建立几乎处处收敛的上鞅,在适当的条件下,给出了任意受控随机序列的一类随机偏差定理. 相似文献
18.
Van Vu 《Advances in Mathematics》2006,207(1):221-243
Let K be a smooth convex set with volume one in Rd. Choose n random points in K independently according to the uniform distribution. The convex hull of these points, denoted by Kn, is called a random polytope. We prove that several key functionals of Kn satisfy the central limit theorem as n tends to infinity. 相似文献
19.
20.
In this note more short proofs are given for Faudree-Schelp theorem and Ore theorem. 相似文献