Báo cáo toán học: "n Random Greedy Triangle Packing" pdf

... pick an ordering of all triangles uniformly at random. It is easy to see that a random ordering of all triangles, when restricted to the triangles of a single cluster, is a uniform random ordering and ... removes random triangles until the graph is triangle- free. In the other alternate expression, all of the randomness takes place in the initial stage of execution: the list of all tr...

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

... the randomization sites randomly. In this way one re- duces the amount of information that the algorithm needs to save. Second, if one is using pseudo -random bits given by some trusted pseudo -random ... randomiza- tion sites in accordance with some fixed distribution on P one chooses randomization sites according to some other scheme, provided that two conditions are satisfied: the choice o...

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

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

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

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

... holds with triangle- free” replaced by “bipartite” and with f T replaced by f B . Proof: We let W = {w 0 , . . ., w m−1 }, and write r = m − 1 and q = t − 1 to simplify expressions. As G is triangle- free ... G u ; the resulting graph will be called T(G) (see Fig. 1). Clearly this graph is triangle- free/bipartite if G was triangle- free/bipartite. Moreover, |V (T (G))| = |V (T )| · |V (G)...

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

... relatively few conjugacy classes), but for the groups listed it appears that random samples of size 2000 from cubes of length 25 and random samples from the uniform distribution are essentially indistinguishable ... graphs and random generation in groups, in Proc. 23rd ACN Symp. Theory of Comp.(1991) (pp. 164–174). [3] F. Cellar, C.R. Leedham-Green, S. Murray, A.C. Niemeyer and A. O’Bri...

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

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

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

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