Báo cáo toán học: "Mixing time for a random walk on rooted trees" pot

... Mixing time for a random walk on rooted trees Jason Fulman Department of Mathematics University of Southern California, Los Angeles, CA, US A fulman@usc.edu Submitted: Aug 8, 2009; Accepted: ... Fulman, J., Separation cutoffs for random walk on irreducible representations, to appear in Ann. Comb., arXiv: math.PR/0703921 (2007) . [17] Fulman, J., Stein’s method and rand...

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

... is a nonnegative integer-valued random variable, Prob[X ≥ 1] ≥ E(X) max(X) . Since A[ z] cannot induce more than |A[ z]|/2 edges, we obtain a lower bound on the probability p that A[ z] contains an edge ... Subject Classification: 05C05 Abstract Let G be a class of graphs. A d-fold grid over G is a graph obtained from a d-dimensional rectangular grid of vertices by placing a...

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

... Matos, MP, Pereira, DC: On a hyperbolic equation with strong damping. Funkcial Ekvac. 34, 303–311 (1991) 7. Matsuyama, T, Ikerata, R: On global solutions and energy decay for the wave equations ... solutions of a wave equation with a boundary control of memory type. Nonlinear Anal Real World Appl. 11, 2896–2904 (2010). doi:10.1016/j.nonrwa.2009.10.013 18. Cavalcanti, MM, Domingos...

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

... is a bipartite subgraph of the q-ary n-cube. A Gray code for S is equivalent to a Hamilton path of G q (S). For a bipartite graph with bipartition (X, Y )tohavea Hamilton path, X and Y must have ... characterization based directly on A and not p(z). A period of A is an integer p such that a i = a i+p for all 0 ≤ i<m− p. The periods of A are the positions of the...

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

... curves at SNR = −15 dB 20 [6] B Zayen, A Hayar, K Kansanen, Blind spectrum sensing for cognitive radio based on sig- nal space dimension estimation, in IEEE International Conference on Communications, ... previous equations equation. For example any derivative order N can be taken and depending on this order the equation is solved in the operational domain and back to frequency do...

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

... Bollob´as and A. Thomason. Random graphs of small order. Random Graphs ’83. Annals of Discrete Math 28 (1985), 47 - 97. [8] B. Bollob´as and A. Frieze. On matchings and Hamiltonian cycles in random ... such that at least one pair of the configuration will contain a point from each of T 1 u ,T v , and at least one pair will contain a point from each of T 2 u ,T v , with probabilit...

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

... variables with the same univariate distribution, but a combinatorial interpretation is only known for one of the variables. Finding a combinatorial interpretation for the Kostka-Macdonald coefficients ... 11B65 Abstract This article describes conjectured combinatorial interpretations for the higher q,t-Catalan sequences introduced by Garsia and Haiman, which arise in the theory of sym...

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

... traceable if it has a hamiltonian path (a path containing all the vertices of G). A graph G is maximal nonhamiltonian (MNH) if G is not hamiltonian, but G +e is hamiltonian for each e ∈ E( G), ... show that g(n)= 3n−2 2  for n ≥ 54 as well as for n ∈ I ∪{12, 13} and we determine g(n)forn ≤ 9. Keywords: maximal nontraceable, hamiltonian path, traceable, nontraceable, non- hamilton...

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

...

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