共查询到20条相似文献,搜索用时 15 毫秒
1.
本文将计算随机映射图的给定顶点集的任意分类的连接概率及其极限性质,导出随机映射图的连通分支个数的分布与渐进分布. 相似文献
2.
Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class G
p
(N) of random graphs, the corresponding flooding time is investigated. The flooding time T
N
(p) is the minimum time needed to reach all other nodes from one node. We show that, after scaling, the flooding time T
N
(p) converges in distribution to the two-fold convolution (2*) of the Gumbel distribution function (z)=exp (–e
–z
), when the link density p
N
satisfies Np
N
/(log N)3 if N . 相似文献
3.
We present two heuristics for finding a small power dominating set of cubic graphs. We analyze the performance of these heuristics on random cubic graphs using differential equations. In this way, we prove that the proportion of vertices in a minimum power dominating set of a random cubic graph is asymptotically almost surely at most 0.067801. We also provide a corresponding lower bound of using known results on bisection width. 相似文献
4.
We prove part of a conjecture by Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28.) regarding threshold functions for the existence of an H‐factor in a random graph . We prove that the conjectured threshold function is correct for any graph H which is not covered by its densest subgraphs. We also demonstrate that the main result of Johansson, Kahn, and Vu (Factors in random graphs, Random Struct. Algorithms 33 (2008), 1, 1–28) generalizes to multigraphs, digraphs, and a multipartite model. 相似文献
5.
James F. Lynch 《Random Structures and Algorithms》1992,3(1):33-53
We consider random graphs with edge probability βn?α, where n is the number of vertices of the graph, β > 0 is fixed, and α = 1 or α = (l + 1) /l for some fixed positive integer l. We prove that for every first-order sentence, the probability that the sentence is true for the random graph has an asymptotic limit. 相似文献
6.
We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, that is, can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let denote the number of cops needed to capture the robber in a graph G in this variant, and let denote the treewidth of G. We show that if G is planar then , and there is a polynomial‐time constant‐factor approximation algorithm for computing . We also determine, up to constant factors, the value of of the Erd?s–Rényi random graph for all admissible values of p, and show that when the average degree is ω(1), is typically asymptotic to the domination number. 相似文献
7.
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. 相似文献
8.
Martin Hildebrand 《Random Structures and Algorithms》1996,8(4):301-318
This paper looks at random regular simple graphs and considers nearest neighbor random walks on such graphs. This paper considers walks where the degree d of each vertex is around (log n)a where a is a constant which is at least 2 and where n is the number of vertices. By extending techniques of Dou, this paper shows that for most such graphs, the position of the random walk becomes close to uniformly distributed after slightly more than log n/log d steps. This paper also gets similar results for the random graph G(n, p), where p = d/(n − 1). © 1996 John Wiley & Sons, Inc. 相似文献
9.
A graph with a trivial automorphism group is said to be rigid. Wright proved (Acta Math 126(1) (1971), 1–9) that for a random graph is rigid whp (with high probability). It is not hard to see that this lower bound is sharp and for with positive probability is nontrivial. We show that in the sparser case , it holds whp that G's 2‐core is rigid. We conclude that for all p, a graph in is reconstructible whp. In addition this yields for a canonical labeling algorithm that almost surely runs in polynomial time with o(1) error rate. This extends the range for which such an algorithm is currently known (T. Czajka and G. Pandurangan, J Discrete Algorithms 6(1) (2008), 85–92). 相似文献
10.
Simon Griffiths 《Journal of Graph Theory》2013,74(2):198-209
We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar to those given by Chung, Graham, and Wilson [5] in the case of unoriented graphs, and by Chung and Graham [3] in the case of tournaments. Indeed, our main theorem extends to the case of a general underlying graph G, the main result of [3] which corresponds to the case that G is complete. One interesting aspect of these results is that exactly two of the four orientations of a four cycle can be used for a quasi‐randomness condition, i.e., if the number of appearances they make in D is close to the expected number in a random orientation of the same underlying graph, then the same is true for every small oriented graph H. 相似文献
11.
In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic numbers, their expansion properties as well as their connectivity and Hamiltonicity. The results obtained are compared with other models of random graphs and several similarities and differences are pointed out. For many properties our results for the general case are as strong as the known results for random Cayley graphs and sometimes improve the previously best results for the Cayley case. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011 相似文献
12.
广义随机交集图是一类重要的随机图模型,它是E-R随机图的变种,被广泛用于复杂社会网络的研究中.本文研究了在顶点度的期望趋于无穷的情况下,广义随机交集图的度分布.我们对二项模型给出了中心极限定理,并且对一致模型给出了极限定理. 相似文献
13.
14.
15.
16.
几何随机图大连通分支覆盖面积及其在传感器网络中的应用 总被引:1,自引:0,他引:1
随机网络中的大连通分支能体现一个网络的连通情况,是几何随机图研究的-个热点,具有重要的理论意义和应用价值.本文利用渗流理论,研究了几何随机图大连通分支覆盖面积所具有的性质,并将理论结果应用到大型无线传感器网络中,研究了无线传感器网络覆盖的性质.研究结果表明,对于节点服从泊松分布的大型无线传感器网络,其大连通分支覆盖区域大小与总区域大小的比值趋于-个常数,且并估计出了2维空间中没有被大连通分支所覆盖的连通区域(本文称为空洞)的大小.这些结果为衡量无线传感器网络性能提供了理论基础,对实际布网和网络优化等具有一定的指导意义. 相似文献
17.
Tamás Makai 《Journal of Graph Theory》2015,79(2):125-144
Consider the random graph process that starts from the complete graph on n vertices. In every step, the process selects an edge uniformly at random from the set of edges that are in a copy of a fixed graph H and removes it from the graph. The process stops when no more copies of H exist. When H is a strictly 2‐balanced graph we give the exact asymptotics on the number of edges remaining in the graph when the process terminates and investigate some basic properties namely the size of the maximal independent set and the presence of subgraphs. 相似文献
18.
Flavia Bonomo Guillermo Durán Min Chih Lin Jayme L Szwarcfiter 《Mathematical Programming》2006,105(2-3):233-250
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs,
and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced graphs by forbidden subgraphs
and by clique subgraphs are proved in this work. Using properties of domination we define four subclasses of balanced graphs.
Two of them are characterized by 0–1 matrices and can be recognized in polynomial time. Furthermore, we propose polynomial
time combinatorial algorithms for the problems of stable set, clique-independent set and clique-transversal for one of these
subclasses of balanced graphs. Finally, we analyse the behavior of balanced graphs and these four subclasses under the clique
graph operator.
Received: April, 2004 相似文献
19.
In this paper we study the maximal size of a distance-2-matching in a random graph
G
n;M
, i.e., the probability
space consisting of subgraphs of the complete graph over n vertices,
K
n
, having exactly
M edges and uniform probability measure. A distance-2-matching in a graph
Y, M
2, is a set of Y-edges
with the property that for any two elements every pair of their 4 incident
vertices has Y-distance 2. Let M2(Y)
be the maximal size of a distance-2-matching in Y. Our
main results are the derivation of a lower bound for M2(Y)
and a sharp concentration result for the random variable
AMS Subject Classification: 05C80, 05C70. 相似文献
20.
Let W
n be an n × n random symmetric sparse matrix with independent identically distributed entries such that the values 1 and 0 are taken with probabilities p/n and 1-p/n, respectively; here
is independent of n. We show that the limit of the expected spectral distribution functions of W
n has a discrete part. Moreover, the set of positive probability points is dense in (- +). In particular, the points
, and 0 belong to this set. 相似文献