Báo cáo toán học: "A note on random minimum length spanning trees" pps

... edge connected then the expected length of a minimum spanning tree is ∼ n r ζ(3). If we omit the edge connectivity condition, then it is at most ∼ n r (ζ(3) + 1). 1 Introduction Given a connected ... first give a rather precise description of mst(G). Lemma 1 [1] For any connected graph G, mst(G)=  1 p=0 E(κ(G p ))dp − 1. (3) A note on random minimum length spanning trees Ala...

Ngày tải lên: 07/08/2014, 06:20

... strings σ, τ, their concatenation is denoted by στ. The length of string σ is denoted by |σ|; for example, |σ| = n if σ ∈ {0, 1} n . The empty string ǫ is the unique string of length zero. Given ... since each bit of one string is the complement bit of the corresponding bit of the other string. In this note, we further study the property of complement strings for three-person games. We p...

Ngày tải lên: 08/08/2014, 01:20

... appeared upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. A note on the almost sure limit theorem for self-normalized partial sums of random variables ... E ¯ S n  nl(η n ) d −→ N, as n → ∞, where N denotes the standard normal random variable. This implies that for any g(x) which is a non-negative, bounded Lipschitz function 6 A note...

Ngày tải lên: 20/06/2014, 21:20

... for a constant κ<2/3, then it outputs a cover graph whp. Note that the output graph will have whp girth equal to 4. On a related note we point to [8] which surveys constructions of non cover ... electronic journal of combinatorics 7 (2000), #R19 9 [8] O. Pretzel, Orientations and Edge Functions on Graphs, in: A.D.Keedwell (ed.), Surveys in Combinatorics, London Math. Soc. Lecture N...

Ngày tải lên: 07/08/2014, 06:20

... information on Maple) implementation of the downhill simplex function optimization method (see [13] for a good description of the method and a C implementation) to the maximize the expression. This ... (3) When conditioning on the event C P 0 , the random graphs of the resulting probability space may contain edges only from within the edges that connect vertices of different partitions o...

Ngày tải lên: 07/08/2014, 06:20

... Hofstad. Random Graphs and Complex Networks. Lecture notes, in prepa- ration, 2008. http://www.win.tue.nl/~rhofstad [7] D. Stark. The vertex degree distribution of random intersection graphs. Random ... single large component of linear order emerges, and the size of the second largest component is at most of logarithmic order. 1 Introduction The random intersection graph, denoted G (n...

Ngày tải lên: 07/08/2014, 15:23

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:21

... question for all k ≥ 4 and to the second question for all k ≥ 5. We would like to note that there is an interesting discussion about the Burkard–Hammer condition in [9]. Concerning the hamiltonian ... a maximal nonhamiltonian split gr aph. Since H 4,6 is nonhamiltonian, by Theorem 4 the graph H 4,6 [X, v ∗ 1 ]isnon- hamiltonian. Therefore, if T has a Hamilton cycle C then C must contain the...

Ngày tải lên: 06/08/2014, 05:20