Báo cáo toán học: "Convergence in distribution for subset counts between random sets" pptx

... not converge. For a comprehensive account of Stein’s method see [1]. In applying Stein’s method to subset counts in P(m, n, p) we were able to use the “coupling” version of Stein’s method and ... n, p)consideredbyR´enyi. 2 A coupling for subset counts between random sets In this section we prove Theorem 1. It is convenient initially to work with the random variable W ....

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

... using ESPAR at the receiving terminal are examined both in opportunistic beamforming and in MIMO broadcast channel MU systems, optimizing correspondingly the SNR or the SINR of the forward link. 1 ... channel increases, the effect of the increased training overhead is evident in the system performance. 3.3 Receiver beamforming in Rician channels In order to evaluate the potential gai...

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

...  Setting f is a contraction on C in Theorem 2.1, we have the following results immediately. is continuous, strictly increasing and η(t) is strictly increasing and onto, where η(t):=t −ψ(t),t∈ ... others. In order to prove our main results, we need the following lemmas. Definition 1.5. [24] A Banach space is said to admit a weakly sequentially continuous normalized duality mapping J from E...

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

... notice below). For information about publishing your research in Fixed Point Theory and Applications go to http://www.fixedpointtheoryandapplications.com/authors/instructions/ For information about ... Princi- ple appeared in explicit form in Banach’s thesis in 1922 [1]. Since its simplicity and usefulness, it has become a very popular tool in solving existence problems in man...

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

... versions of fixed point theorems in K-metric spaces and scalar versions of fixed point theorems in metric spaces. He showed that many of the fixed point theorems for mappings satisfying contractive ... n → ∞. Similarly, following lines of the proof of Lemma 1 in [3], one can prove (i), (iii) and (iv).  3 Fixed point theorems for w-cone distance contraction mappings in K-metric space...

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

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

... staying completely in those j dimension and a single other one going on step in positive direction in dimension j +1. In our implementation we exploit this kind of symmetry by “normaliz- ing” ... step closing a loop of length 4 – both transfering to state ω. (3.2) A step in the same direction as the previous step, transfering us back to state 1 again. (3.3) A step in any other of...

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

... Chunhui Lai, On the size of graphs with all cycle having distinct length, Discrete Math. 122(1993) 363-364. [6] Chunhui Lai, The edges in a graph in which no two cycles have the same length, J. Zhangzhou ... edges. In this paper, we construct a graph G having no two cycles with the same length which leads to the following result. Theorem. Let t = 27720r + 169 (r ≥ 1), then f(n) ≥ n +32t...

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

... h λ − h µ for some appropriate partitions λ, µ depending on π, σ, respectively. We claim that λ is incomparable to or greater than µ in the dominance order. Since M(π) [k],[+1,n] contains k − ... of the form (2) and again is TNN. (⇐) Suppose that π is not less than or equal to σ in the Bruhat order. By Theorem 1 we may choose indices 1 ≤ k,  ≤ n − 1 such that M(σ) [k],[] contains q +...

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

... between tableaux in T (m,d) satisfying condition (II) and walks of length m starting at the origin, moving only in positive directions, staying in the region x 1 ≥ x 2 ≥ ···≥ x d and satisfying ... 12 give a bijection between S(r,n,d) and pairs of walks of length m starting at the origin, terminating at the same lattice point, moving only in positive directions, staying in the r...

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