Báo cáo toán hoc:" Almost all trees have an even number of independent sets " ppt

... e proof of the surprising fact that almost all trees have an even number of independent vertex subsets (in the sense that the proportion of those trees with an odd number of independent sets ... to an asymptotic formula for the number of rooted trees on n vertices whose number of independent sets is odd by means of singularity analysis (see...

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

... the Glauber dynamics with an extra slide-type move). They prove O(n log n) mixing time of their dynamics for the same range of λ for all graphs. Dyer and Greenhill [3] and Randall and Tetali [6] show ... sets. Moreover, starting from an arbitrary set we eventually reach an independent set. Thus the mixing time of this chain bounds the mixing time of the chain with identical...

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

... expected number of k-colorings go to 0 as n →∞yields much better lower bounds for the chromatic number than letting the number of (suitably large) independent sets go to 0 as n →∞. Our proof can be ... property A and any value of m, the probability of A holding in G(n, m)isnosmallerthanitisinG r (n, m)since “additional occurrences of an edge do not help”. Formally, this...

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

... both ID and LP trees is the configuration of labeled trees under valency (and other) constraints. Consider a finite set L of edge labels, a finite set V of nodes, and E ⊆ V × V × L a finite set of directed ... complex of German verb final sentences, and demonstrated that these traditionally challenging phenomena emerge naturally from our simple and elegant account. Although we provid...

Ngày tải lên: 20/02/2014, 18:20

... capacity of N∗Nakagami-m channels. Specifically, we have studied the influence of the severity of fading and the number of hops on the PDF, CDF, LCR, and ADF of the channel capacity. We have derived an ... mean channel capacity decreases. The influence of the severity of fading and the number of hops N in N∗Nakagami-m channels on the mean channel capacity is specifically...

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

... where X is a finite set of vertices, while C and D are two families of subsets of X. The elements of C and D are called C-edges and D-edges respectively. If C = ∅ then H is called a D-hypergraph, ... t-design called a Steiner quadruple system. Briefly, by a t-design S λ (t, k, v)wemeanapair(X,B)whereX is a v-set of vertices and B is a collection of k-element subsets of X, usually...

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

... vertices and m(G; k) the number of its k -matchings. It is convenient to denote m(G; 0) = 1 and m(G; k) = 0 for k > [n/2]. The Hosoya index of G, denoted by z(G), is defined as the sum of all the numbers ... 5, 12]). An important direction ∗ Financially supported by self-determined research funds of CCNU from the colleges’ basic research and operation of MOE (CCNU09Y01005, C...

Ngày tải lên: 08/08/2014, 12:22

... (2007), 3 53–363. [3] J. Harant, A. Pruchnewski, and M. Voigt, On dominating sets and independent sets of graphs. Combin. Probab. Comput. 8 (1999), 547–553. [4] J. Harant and D. Rautenbach, Domination ... of G, we mean adding a (disjoint) copy of the graph G 8 of Figure 8 and identifying any one of its vertices that is in a triangle with v. Figure 8: A cubic graph G 8 with dom...

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

... h 4" alt =""

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

... t)u(t)dt. The notion of Beurling spectrum of a function u ∈ BUC(R, X) coincides with the one of Carleman spectrum, which consists of all ξ ∈ R such that the Carleman– Fourier transform of u, defined by ˆu(λ):=   ∞ 0 e −λt u(t)dt ... paper, R, C, X stand for the sets of real, complex numbers and a complex Banach space, respectively; L(X), C(J, X), BUC(R, X), AP (X) denote the...

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