Báo cáo toán học: "uantum Walks on Regular Graphs and Eigenvalues" ppt

... Douglas and Wang in [1] has also been t ested on classes of strongly regular graphs and of regular g raphs, where all non-isomorphic graphs were distinguished. Finding a pair of non-isomorphic strongly ... arbitrary graphs; in fact, he shows that k- boson quantum walks do not distinguish arbitrary graphs. However, the question of whether or not the procedure distinguishes al...

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

... harmonic function on Y afforded by Proposition 1.3 vanishes on all Young diagrams with more than l rows. Thus, one can consider such a function as a harmonic function on the subgraph Y(l)ofY consisting ... this section, we deal with an abstract graph G satisfying certain conditions listed below. In the next sections, concrete examples of G will be considered. Our assumptions and conven...

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

... P. Diaconis, R. L. Graham and J. A. Morrison, Asymptotic analysis of a random walk on a hypercube with many dimensions, Random Structures and Algorithms, 1 (1990), 51–72. [6] P. Diaconis and L. ... =inf f=constant  e∈E f 2 (e)  x f 2 (x)d x log f 2 (x)  y f 2 (y)π(y) (8) where f ranges over all non-constant functions f : V → R and π is the stationary distribution of the nearest...

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

... ad- dress configuration time ( ¯ T conf ), by simply consider- ing the two possible configuration situations: (i) there is on average multi-hop connectivity between the un- configured vehicle and the ... evaluated the config- uration time ¯ T conf under different traffic conditions and for different deployment configuration parame- ters. The traffic conditions are defined by the vehicu- lar density...

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

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

... Decomposition Lemma, E 1 and E 2 partition {1, ,n−1}. Set S 1 =(s i :i∈E 1 ),S 2 =(s i :i∈E 2 )−s ∗ n . By part 3 of the Decomposition Lemma, S 1 and S 2 are major sequences of length l − 1andn−l, ... Recursively obtain the trees T 1 = f(S 1 )andT 2 =f(S 2 )on{ 0, ,l−1} and {0, ,n−l} respectively, with e(T 1 )=a(S 1 )ande(T 2 )=a(S 2 ), and thus by Part 4 of the Decomposition Lemma e...

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

... Perfect matchings in  -regular graphs Noga Alon ∗ School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540 and Department of Mathematics, Raymond and Beverly Sackler Faculty ... 1988 [7] V. R¨odl and A. Ruci´nski, Perfect matchings in  -regular graphs and the Blow-up lemma, submitted. the electronic journal of combinatorics 5 (1998), #R13 2 An  -regular graph...

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

... L ∈ Σ P k .Above, the notation · , · refers to some canonical pairing function. With these definitions, NP = Σ P 1 ,coNP=Π P 1 ,andtheclassesΣ P k and Π P k form a neat hierarchy containing P and lying inside ... the definition of AM. Based on constructions like those of [12, 10, 11], one has AM ⊂ Σ P 2 ∩ Π P 2 ,com- pleting the claim in the introduction. One naturally wonders at the re...

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

... and D. R. Stinson, One-factorizations of regular graphs and Howell designs of small order, Utilitas Math. 29 (1986), 99–124. [29] E. Seah and D. R. Stinson, An enumeration of non-isomorphic one-factorizations and ... one-factorizations and Howell designs for the graph K 10 minus a one-factor, Ars Combin. 21 (1986), 145–161. [30] E. Seah and D. R. Stinson, On the enumeration...

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

... group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Probl. of Inform. Trans., 24 issue 1 (1988),39–46. [9] P. K. Wong, Cages—a ... additive constant (see [3, Theorem 23.6, p. 185], and the survey [9]). On the other hand, the best upper bound on n(d, g) is on the order of n 0 (d, g) 3/2 , and is achieve...

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