Báo cáo toán học: "Generating a random sink-free orientation in quadratic time" ppsx

... choose a random candidate, and if it has any flaws, locally rerandomize until it is flawless. Does partial rejection sampling apply to other natural combinatorial problems? Can one develop a general ... to obtain an exact sample rather than an approximate one [PW1]. In this note we consider the generation of a random sink-free orientation (SFO) of a finite undirected graph. Si...

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

... generating function arising from any single (j, 1) entry has matrix entries in L. So we may assume that j → a j is a polynomial function. Since any polynomial function is an F -linear combination ... a i ∈ Ω and ord a i → ∞ as |i| → ∞. Ω ′ has an obvious multiplication and is an overring of F [x, x −1 ][[z]]. l 0 , l 1 and l −1 are the Ω-linear maps Ω ′ → Ω taking  a i x i to a...

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

... for random variables X and Y, iii. d(X, Y ) ≤ d(X, Z)+d(Z, Y ) for random variables X, Y and Z in Ψ. Definition 2.2. A metric d is called simple if its values are determined by a pair of marginal ... several results of applied mathematics and informatics have been established by using the probability metric approach. Results of this nature may be found in Gibbs and Edward [9], Hutc...

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

... starting at the root is increasing. There are various important families of increasing tr ees, such as binary increasing trees, recursive trees or plane-oriented recursive trees. A general f ramework ... evolution process, as pointed out by Panholzer and Prodinger in [11]. A remarkable result by Dobrow and Smythe [7] states that the depth of the kth node (i.e., the distance from the roo...

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

... length a + b; in the latter case, one requires that the surface spanning the hexagon should have (minimal) area ab + bc + ac. In this paper I will describe an algorithm for generating a random (a, ... generating random d-factors of bipartite planar graphs, the problem of generating random independent sets in a general bipartite graph, and many other problems as well. 3. The...

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

... J.L.Snell, Finite Markov Chains, Springer Verlag, 1976. [6] J.Jaworski, A Random Bipartite Mapping, Annals of Discrete Math., 28 137– 158 (1985). [7] V.F.Kolchin, Random Mappings, Optimization Software, ... o(1)) as n →∞. We should mention that there is a standard approach to our problem using the transition matrix P and linear algebra. Let Q be the matrix that is obtained from P by s...

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

... ‘Birthday Paradox’. Now using Lemma 3 in combination with Lemma 5 below, we can show that a random function from an a- element set into an a- element set is an injection with probability at least ... ( 1 e −o(1)) a , giving a combinatorial proof to a weakened Stirling formula! (Apart from Lemma 4, this is the only result in the paper not using Theorem 1.) We say that the event...

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

... Cooperman posted a manuscript “Towards a practical, theoretically sound algorithm for random generation in finite groups” on arXiv:math [4]. He proposed a new algorithm for generating (almost) random ... computed from a statistical sample of size 2000, there is always some part of this variation which is due simply to this sampling. We therefore also calculated as a bench mark...

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

... x 2 (x−1) n−ℓ(µ)−3 in (5.8) arising from T, which we interpret a s taking such a filling and labeling cells 1 and 3 with x, labeling cell 2 with 1, and labeling each remaining cell which is not at the end of a ... σ (i) (b 1 ) and σ (i) decreases in the remaining bricks, and 3. the labels on cells 1 and 3 are x, the label on cell 2 is 1, and the remaining labels are as befor e. We ca...

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

... resolution by chaining analysis of hashing with chaining open addressing linear probing quadratic probing double hashing Flat Generative: linked list worst case time wasted space worst case running time to ... Linguistics Generating a Table-of-Contents S.R.K. Branavan, Pawan Deshpande and Regina Barzilay Massachusetts Institute of Technology {branavan, pawand, regina}@csail.mit.edu Abstra...

Ngày tải lên: 17/03/2014, 04:20