Báo cáo toán học: "A note on the component structure in random intersection graphs with tunable clustering" pptx

... note on the almost sure limit theorem for self-normalized partial sums of random variables in the domain of attraction of the normal law Qunying Wu 1,2 1 College of Science, Guilin University of ... sequence of independent and identically distributed random variables in the domain of attraction of a normal distribution. A...

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

... class="bi x0 y1 w2 h 2" alt =""

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

... the reflection representation of a finite Coxeter group. This is essentially what we are looking at. (The defining representation of S n consists of the direct sum of the reflection representation ... have: Proposition 1.2. dim F n = D(n). Proof. Consider the table of the characters χ N ; we are interested in the dimension of the row-span of this table. Since t...

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

... sharp estimates obtained by Kamath et al. of the probability that no bin is empty after the random placement of the balls and exploiting the relationship between the placement of balls and the rigid ... A note on the non-colorability threshold of a random graph Alexis C. Kaporis, Lefteris M. Kirousis, and Yannis C. Stamatiou University of Patras Departm...

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

... is (k, )-sum-free for k,  ∈ N, k>,ifthere are no solutions to the equation x 1 + ···+ x k = y 1 + ···+ y  in A. Denote by SF n k, the number of (k, )-sum-free subsets of [1,n]. Since the ... ρ). The main result of this note says that if (k − )/ is small in terms of ρ, then the number of (k, )-sum-free subsets of [1,n]isequalto(ϕ(ρ)+ϕ r...

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

... with b fixed, for < /b> various ranges of < /b> k. For < /b> purposes of < /b> comparison, we repeat these results below. Theorem 1 The < /b> distribution of < /b> the < /b> height of < /b> b- tries < /b> has the < /b> following asymptotic < /b> expan- sions for < /b> ... u − 1=O (b −1/2 ). We thus set u =1+x/ √ b and obtain I = e b b b+ 1 b!  B − √ b exp  b  lo...

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

... Noga Alon and Joel H. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 1992. [3] L´aszl´o Babai and Shlomo Moran. Arthur-merlin games: a randomized proof system, and a hierarchy of ... introduction. One naturally wonders at the relationship of Dist to more familiar classes such as NP and coNP. In this direction, applying the machinery of [6], we can argu...

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

... A note on the ranks of set-inclusion matrices D. de Caen Department of Mathematics and Statistics Queen’s University Kingston, Ontario, Canada K7L 3N6 decaen@mast.queensu.ca Submitted: ... relation is derived for the rank (over most fields) of the set-inclusion matrices on a finite ground set. Given a finite set X of say v elements, let W = W t,k (v) be the (0,1)-matr...

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

... Background Consider a Markov chain (P, Ω,π)whereP denotes the transition matrix, Ω denotes the state space, and π denotes the unique stationary distribution. Recall that the variation distance between ... modified dynamics imply bounds on the mixing time of the original Glauber dynamics. (See the remark at the end of Section 3 for a discussion regarding the case...

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

... E}. Since no directed C 4 contains v ∗ as a vertex, we must have that every w ∈ A appears in at least one of A − or A + (it may appear in both; in particular, v ∗ appears in both A − and A + as there ... A note on the number of edges guaranteeing a C 4 in Eulerian bipartite digraphs Jian Shen Department of Mathematics Southwest Texas State Unive...

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

... and the girth of the resulting graph is at least g. 2 Edge-Connectivity of (k; g)-Cages Since the (k; 3)-cage, K k+1 and the (k; 4)-cage, the complete bipartite graph K k,k ,are k-edge-connected, ... that all (4; g)-cages are 4-connected [9]. We shall often use the following theorem of Fu, Huang and Rodger. Monotonicity Theorem. [4] If k ≥ 3and3≤ g 1 <g 2 ,thenf(k; g 1...

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

... repeat the above argument with the portion of R  beginning at u m−1 and the vertex u m . Theorem 1. Let h p (n) be the minimum number of distinct hamiltonian paths in a strong tournament of order ... are both transitive. the electronic journal of combinatorics 13 (2006), #N3 2 A Note on the Number of Hamiltonian Paths in Strong Tournaments Arthu...

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

... Transformation Formulas, Discrete Math., 265 (2003), 119–139. [9] L. J. Rogers, On the expansion of some infinite products, Proc. London Math.Soc., 24 (1893), 337–352. [10] L. J. Rogers, On two theorems ... a −1 . 2 The proof of the theorem and its application Before our proof, let’s first make some preparations. The q-differential operator D q and q-shifted operator η (see [3, 4, 8,...

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

... of combinatorics 15 (2008), #N10 8 A note on the component structure in random intersection graphs with tunable clustering Andreas N. Lager˚as ∗ Mathematical Sciences and Centre for Theoretical ... in random intersection graphs. The Electronic Journal of Combinatorics, 14, #R17, 2007. [3] M. Deijfen and W. Kets. Random intersection graphs with tunable...

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

... u l−s to u i along the outer cycle is a shortest path between u 0 and u i , as desired.  In what follows, we give the proof of the main theorem. Proof of Theorem 2: By Proposition 4, there exists ... 1, the generalized Petersen graph GP (n, k) is not strongly distance-balanced (strongly distance-balanced graph was introduced by K utnar et al. in [2]). In this note, we pr...

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