Maximum Agreement Subtrees
|
|
- Posy Scott
- 5 years ago
- Views:
Transcription
1 Maximum Agreement Subtrees Seth Sullivant North Carolina State University March 24, 2018 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
2 Phylogenetics Problem Given a collection of species, find the tree that explains their history. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
3 Phylogenetics Problem Given a collection of species, find the tree that explains their history. Yeates, Meier, Wiegman, 2015 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
4 Rooted Binary X -Trees Definition A rooted tree T has a distinguished vertex ρ, the root. A rooted binary phylogenetic X tree T is a binary tree that has a distinguished root vertex and where the leaves are labeled by X In phylogenetics, only have access to data on extant (not extinct) species. We don t know data or information about species corresponding to internal nodes in the tree. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
5 Induced subtrees Let X be a label set, with n = X. Let T be a binary rooted phylogenetic X -tree. Given S X, T S is the binary restriction tree Definition Given T 1, T 2 binary rooted phylogenetic X -trees, MAST(T 1, T 2 ) = max{#s : S X and T 1 S = T 2 S } This is the size of a maximum agreement subtree. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
6 Example MAST(T 1, T 2 ) = 3 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
7 Example MAST(T 1, T 2 ) = Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
8 Example MAST(T 1, T 2 ) = Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
9 Example MAST(T 1, T 2 ) = Theorem (Steel-Warnow 1993) There is an O(n 2 ) algorithm to compute MAST(T 1, T 2 ) of binary rooted phylogenetic X -trees. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
10 What is the distribution of MAST(T 1, T 2 )? Problem Determine the distribution of MAST(T 1, T 2 ) for reasonable nice probability distributions on rooted binary trees. Remark Uniform distribution Yule-Harding distribution Simulations [Bryant-Mackenzie-Steel 2003] suggest that under both the uniform distribution and the Yule-Harding distribution E[MAST(T 1, T 2 )] c n where n = X, for some constant c depending on the distribution. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
11 Motivation: Comparing New Phylogenetic Methods Suppose we come up with a new phylogenetic method. This method takes a data set D and constructs the tree M(D). If we know the correct tree T we can evaluate the method by computing MAST(T, M(D)). If MAST(T, M(D)) is consistently small (for lots of different D), then we conclude that the new method does not work well. How small is small? Is it smaller than what you would expect to see by random chance? Need to know the distribution of MAST(T, T ). Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
12 Motivation: Cospeciation Let T H be a phylogenetic tree of host species, and T P a phylogenetic tree of parasite species. Host and parasites are paired, so T H and T P have same label set. If MAST(T H, T P ) is large, reject hypothesis that T H and T P evolved independently. i.e. large MAST(T H, T P ) = cospeciation. Need distribution of MAST(T 1, T 2 ) for random trees under null hypothesis of independence to perform hypothesis test. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
13 Motivation: Cospeciation Let T H be a phylogenetic tree of host species, and T P a phylogenetic tree of parasite species. Host and parasites are paired, so T H and T P have same label set. If MAST(T H, T P ) is large, reject hypothesis that T H and T P evolved independently. i.e. large MAST(T H, T P ) = cospeciation. Need distribution of MAST(T 1, T 2 ) for random trees under null hypothesis of independence to perform hypothesis test. Hafner, M.S., Nadler, S.A. (1988) Nature 332: Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
14 Motivation: Cool Math Suppose that both T 1 and T 2 are comb trees w w w w w w w w8 w9 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
15 Motivation: Cool Math Suppose that both T 1 and T 2 are comb trees w w w w w w w w8 w9 A maximum agreement subtree corresponds to a longest increasing subsequence of the permutation w = w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9, denoted L(w). Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
16 Motivation: Cool Math Suppose that both T 1 and T 2 are comb trees w w w w w w w w8 w9 A maximum agreement subtree corresponds to a longest increasing subsequence of the permutation w = w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9, denoted L(w). MAST(T 1, T 2 ) for uniformly random comb trees is equivalent to L(w) for uniformly random permutations w S n. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
17 Motivation: Cool Math Suppose that both T 1 and T 2 are comb trees w w w w w w w w8 w9 A maximum agreement subtree corresponds to a longest increasing subsequence of the permutation w = w 1 w 2 w 3 w 4 w 5 w 6 w 7 w 8 w 9, denoted L(w). MAST(T 1, T 2 ) for uniformly random comb trees is equivalent to L(w) for uniformly random permutations w S n. Theorem (Baik-Deift-Johansson 1999) E[L(w)] = 2 n cn 1/6 + o(n 1/6 ) c L(w) 2 n n 1/6 Tracy-Widom Random Variable Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
18 Random Trees Biologists are interested in models for random trees as models for speciation processes. Uniform distribution: Select a uniform tree from all (2n 3)!! rooted binary phylogenetic trees Yule-Harding distribution: Grow a random tree by successively splitting leaves selected uniformly at random, then apply leaf labels at random. β-splitting model, α-splitting model, etc. Question How well do the different random tree models match the shape and structure of phylogenetic trees occurring in nature? Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
19 Properties of Random Trees Proposition Both Yule-Harding and uniform random trees satisfy exchangeability and sampling consistency. P( )= P( ) Exchangeability: Sampling Consistency: If T is a random tree, and S X then T S is a random tree from the same distribution on leaf label set S. Theorem (Aldous) The expected depth of a uniformly random tree is Θ( n). The expected depth of Yule-Harding random tree is Θ(log n). Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
20 Conjecture About The Maximum Agreement Subtree Conjecture For any exchangeable sampling consistent distribution on rooted binary phylogenetic X -trees, E[MAST(T 1, T 2 )] = Θ( n) where n = X. Recall that f (n) = Θ( n) means that there are positive constants c and C such that c n f (n) C n. Note that the constants c and C might depend on the probability distribution. We hope further that we can show that, asymptotically E[MAST(T 1, T 2 )] d n for some d (depending on the distribution) as n. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
21 Upper bounds Theorem (BHLSSS) For any exchangeable sampling consistent distribution on rooted binary phylogenetic trees, E[MAST(T 1, T 2 )] = O( n). Proof sketch for uniform distribution. For S X let X S = 1 if T 1 S = T 2 S, X S = 0 otherwise. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
22 Upper bounds Theorem (BHLSSS) For any exchangeable sampling consistent distribution on rooted binary phylogenetic trees, E[MAST(T 1, T 2 )] = O( n). Proof sketch for uniform distribution. For S X let X S = 1 if T 1 S = T 2 S, X S = 0 otherwise. Let Y n,k = S X,#S=k X S = number of agreement sets of size k Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
23 Upper bounds Theorem (BHLSSS) For any exchangeable sampling consistent distribution on rooted binary phylogenetic trees, E[MAST(T 1, T 2 )] = O( n). Proof sketch for uniform distribution. For S X let X S = 1 if T 1 S = T 2 S, X S = 0 otherwise. Let Y n,k = E[Y n,k ] = S X,#S=k ( ) n P(X k S = 1) = X S = number of agreement sets of size k ( ) n k 1 (2k 3)!! 0 if k > c n Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
24 Upper bounds Theorem (BHLSSS) For any exchangeable sampling consistent distribution on rooted binary phylogenetic trees, E[MAST(T 1, T 2 )] = O( n). Proof sketch for uniform distribution. For S X let X S = 1 if T 1 S = T 2 S, X S = 0 otherwise. Let Y n,k = E[Y n,k ] = S X,#S=k ( ) n P(X k S = 1) = X S = number of agreement sets of size k ( ) n k 1 (2k 3)!! 0 if k > c n Since E[Y n,k ] 0, with n large = P(MAST(T 1, T 2 ) > c n) goes to 0. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
25 Lower Bounds: Uniform Distribution Theorem (BHLSSS) Under the uniform distribution on trees E[MAST(T 1, T 2 )] = Ω(n 1/8 ). Proof Sketch. The expected depth of a uniform random tree is Θ(n 1/2 ). So with high probability there is a subset S X so T 1 S is a comb tree of size cn 1/2. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
26 Lower Bounds: Uniform Distribution Theorem (BHLSSS) Under the uniform distribution on trees E[MAST(T 1, T 2 )] = Ω(n 1/8 ). Proof Sketch. The expected depth of a uniform random tree is Θ(n 1/2 ). So with high probability there is a subset S X so T 1 S is a comb tree of size cn 1/2. Similarly, with high probability there is a subset S S with #S = Θ(n 1/4 ) so that T 1 S and T 2 S are both comb trees. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
27 Lower Bounds: Uniform Distribution Theorem (BHLSSS) Under the uniform distribution on trees E[MAST(T 1, T 2 )] = Ω(n 1/8 ). Proof Sketch. The expected depth of a uniform random tree is Θ(n 1/2 ). So with high probability there is a subset S X so T 1 S is a comb tree of size cn 1/2. Similarly, with high probability there is a subset S S with #S = Θ(n 1/4 ) so that T 1 S and T 2 S are both comb trees. By sampling consistency, T 1 S and T 2 S are uniformly random comb trees with Θ(n 1/4 ) leaves. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
28 Lower Bounds: Uniform Distribution Theorem (BHLSSS) Under the uniform distribution on trees E[MAST(T 1, T 2 )] = Ω(n 1/8 ). Proof Sketch. The expected depth of a uniform random tree is Θ(n 1/2 ). So with high probability there is a subset S X so T 1 S is a comb tree of size cn 1/2. Similarly, with high probability there is a subset S S with #S = Θ(n 1/4 ) so that T 1 S and T 2 S are both comb trees. By sampling consistency, T 1 S and T 2 S are uniformly random comb trees with Θ(n 1/4 ) leaves. By Baik-Deift-Johansson, T 1 S and T 2 S have an agreement subtree of expected size Θ(n 1/8 ). Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
29 Lower Bounds: Yule-Harding Distribution Theorem (BHLSSS) Under the Yule-Harding distribution on trees E[MAST(T 1, T 2 )] = Ω(n α ) where α is the positive root of 2 2 α = (α + 1)(α + 2) (α.344). From the Steel-Warnow algorithm, we see that for trees T 1 and T 2 of the following shapes A B C D MAST(T 1, T 2 ) max (MAST(A, C) + MAST(B, D), MAST(A, D) + MAST(B, C)) Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
30 Lower Bounds: Fixed Tree Shape Theorem (Misra-S.) Let T 1 and T 2 be uniformly random trees with the same tree shape with n leaves. Then E[MAST(T 1, T 2 )] = Θ( n). Idea comes from random comb trees and connections to longest increasing subsequences w w w w w w w w8 w9 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
31 The Simplest Proof of Ω( n) Lower Bound Let w 1 w 2 w n be a uniformly random permutation. Break this into blocks of length k. B 1 B 2 B n/k = (w 1 w k ) (w k+1 w 2n ) (w n k+1 w n ) Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
32 The Simplest Proof of Ω( n) Lower Bound Let w 1 w 2 w n be a uniformly random permutation. Break this into blocks of length k. B 1 B 2 B n/k = (w 1 w k ) (w k+1 w 2n ) (w n k+1 w n ) Let s call block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
33 The Simplest Proof of Ω( n) Lower Bound Let w 1 w 2 w n be a uniformly random permutation. Break this into blocks of length k. B 1 B 2 B n/k = (w 1 w k ) (w k+1 w 2n ) (w n k+1 w n ) Let s call block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. Note that the awesome blocks gives AN increasing subsequence (but probably not the longest) Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
34 The Simplest Proof of Ω( n) Lower Bound Let w 1 w 2 w n be a uniformly random permutation. Break this into blocks of length k. B 1 B 2 B n/k = (w 1 w k ) (w k+1 w 2n ) (w n k+1 w n ) Let s call block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. Note that the awesome blocks gives AN increasing subsequence (but probably not the longest) So if we can get a lower bound on the expected number of awesome blocks, that will give a lower bound on the length of the longest increasing subsequence. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
35 A block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. The probability that B i is awesome is approximately ( 1 1 k ) k n Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
36 A block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. The probability that B i is awesome is approximately ( 1 1 k ) k n The expected number of awesome blocks is then ( ( 1 1 k ) ) k n n k Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
37 A block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. The probability that B i is awesome is approximately ( 1 1 k ) k n The expected number of awesome blocks is then ( ( 1 1 k ) ) k n n k Taking k = n we get the expected number of awesome blocks is ( ( ) ) n n (1 e 1 ) n n Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
38 A block B i awesome if one of the numbers (i 1)k + 1,..., ik appears in that block. The probability that B i is awesome is approximately ( 1 1 k ) k n The expected number of awesome blocks is then ( ( 1 1 k ) ) k n n k Taking k = n we get the expected number of awesome blocks is ( ( ) ) n n (1 e 1 ) n n Proposition The expected length of the longest increasing subsequence of a uniformly random permutation is bounded below by (1 e 1 ) n. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
39 Extending These Ideas for Trees of Same Shape Proposition The leaf set of any tree on n leaves can be grouped into at least n 4k blobs of size between k and 2k 2. The blobs yield a scaffold tree which can force a structure for certain agreement subtrees between two trees of the same shape. n = 17, k = 3 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
40 Extending These Ideas for Trees of Same Shape Proposition The leaf set of any tree on n leaves can be grouped into at least n 4k blobs of size between k and 2k 2. The blobs yield a scaffold tree which can force a structure for certain agreement subtrees between two trees of the same shape. n = 17, k = Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
41 Extending These Ideas for Trees of Same Shape Proposition The leaf set of any tree on n leaves can be grouped into at least n 4k blobs of size between k and 2k 2. The blobs yield a scaffold tree which can force a structure for certain agreement subtrees between two trees of the same shape. n = 17, k = Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
42 Extending These Ideas for Trees of Same Shape Proposition The leaf set of any tree on n leaves can be grouped into at least n 4k blobs of size between k and 2k 2. The blobs yield a scaffold tree which can force a structure for certain agreement subtrees between two trees of the same shape. n = 17, k = Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
43 Let T 1, T 2 be two random trees with the same shape. Have corresponding blobs B 1 (T i ),..., B n/4k (T i ) i = 1, 2. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
44 Let T 1, T 2 be two random trees with the same shape. Have corresponding blobs B 1 (T i ),..., B n/4k (T i ) i = 1, 2. Call a blob B j awesome if B j (T 1 ) B j (T 2 ). The expected number of awesome blobs is at least ( ( n 1 1 k ) ) k. 4k n Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
45 Let T 1, T 2 be two random trees with the same shape. Have corresponding blobs B 1 (T i ),..., B n/4k (T i ) i = 1, 2. Call a blob B j awesome if B j (T 1 ) B j (T 2 ). The expected number of awesome blobs is at least ( ( n 1 1 k ) ) k. 4k n Awesome blobs give AN agreement subtree between T 1 and T 2, subtree of the scaffold. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
46 Let T 1, T 2 be two random trees with the same shape. Have corresponding blobs B 1 (T i ),..., B n/4k (T i ) i = 1, 2. Call a blob B j awesome if B j (T 1 ) B j (T 2 ). The expected number of awesome blobs is at least ( ( n 1 1 k ) ) k. 4k n Awesome blobs give AN agreement subtree between T 1 and T 2, subtree of the scaffold. Taking k = n gives: Proposition If T 1 and T 2 are uniformly random tree with n leaves and the same shape then E[MAST(T 1, T 2 )] 1 e 1 n. 4 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
47 Trees with Same Shape Theorem (Misra-S.) Let T 1 and T 2 be uniformly random trees with the same tree shape with n leaves. Then E[MAST(T 1, T 2 )] = Θ( n). Conjecture (Martin Thatte 2013) If T 1 and T 2 are arbitrary completely balanced trees with n leaves, then MAST(T 1, T 2 ) n. Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
48 Summary: Now We Know How Little We Know Computing the distribution of MAST(T 1, T 2 ) is a generalization of hard problems in combinatorial probability. Simulations suggest that E[MAST(T 1, T 2 )] cn 1/2 for the uniform and Yule-Harding distributions. We have upper bounds of the form Cn 1/2 for all exchangeable, sampling consistent distributions. We have lower bounds of the form cn α for uniform, Yule-Harding distributions, fixed shape, and some β-splitting examples. Question Is E[MAST(T 1, T 2 )] cn 1/2 universal for all exchangeable, sampling consistent distributions? What else can be said about the distribution of MAST(T 1, T 2 )? Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
49 References Aldous, David. Probability distributions on cladograms. Random discrete structures (Minneapolis, MN, 1993), 1 18, IMA Vol. Math. Appl., 76, Springer, New York, Baik, Jinho; Deift, Percy; Johansson, Kurt On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12 (1999), no. 4, Bernstein, Daniel Irving; Ho, Lam Si Tung; Long, Colby; Steel, Mike; St. John, Katherine; Sullivant, Seth. Bounds on the expected size of the maximum agreement subtree. SIAM J. Discrete Math. 29 (2015), no. 4, Bryant, David; McKenzie, Andy; Steel, Mike. The size of a maximum agreement subtree for random binary trees. Bioconsensus (Piscataway, NJ, 2000/2001), 55?65, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 61, Amer. Math. Soc., Providence, RI, Martin, Daniel M. and Thatte, Bhalchandra D. The maximum agreement subtree problem. Discrete Appl. Math. 161 (2013), no , Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, / 23
The maximum agreement subtree problem
The maximum agreement subtree problem arxiv:1201.5168v5 [math.co] 20 Feb 2013 Daniel M. Martin Centro de Matemática, Computação e Cognição Universidade Federal do ABC, Santo André, SP 09210-170 Brasil.
More informationProbabilities of Evolutionary Trees under a Rate-Varying Model of Speciation
Probabilities of Evolutionary Trees under a Rate-Varying Model of Speciation Mike Steel Biomathematics Research Centre University of Canterbury, Private Bag 4800 Christchurch, New Zealand No. 67 December,
More informationarxiv: v1 [q-bio.pe] 1 Jun 2014
THE MOST PARSIMONIOUS TREE FOR RANDOM DATA MAREIKE FISCHER, MICHELLE GALLA, LINA HERBST AND MIKE STEEL arxiv:46.27v [q-bio.pe] Jun 24 Abstract. Applying a method to reconstruct a phylogenetic tree from
More informationPhylogenetic Algebraic Geometry
Phylogenetic Algebraic Geometry Seth Sullivant North Carolina State University January 4, 2012 Seth Sullivant (NCSU) Phylogenetic Algebraic Geometry January 4, 2012 1 / 28 Phylogenetics Problem Given a
More informationThe Moran Process as a Markov Chain on Leaf-labeled Trees
The Moran Process as a Markov Chain on Leaf-labeled Trees David J. Aldous University of California Department of Statistics 367 Evans Hall # 3860 Berkeley CA 94720-3860 aldous@stat.berkeley.edu http://www.stat.berkeley.edu/users/aldous
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationCATERPILLAR TOLERANCE REPRESENTATIONS OF CYCLES
CATERPILLAR TOLERANCE REPRESENTATIONS OF CYCLES NANCY EATON AND GLENN FAUBERT Abstract. A caterpillar, H, is a tree containing a path, P, such that every vertex of H is either in P or adjacent to P. Given
More informationOn the Longest Common Pattern Contained in Two or More Random Permutations
On the Longest Common Pattern Contained in Two or More andom Permutations arxiv:1402.0137v1 [math.co] 1 Feb 2014 Michael Earnest, University of Southern California Anant Godbole, East Tennessee State University
More informationData selection. Lower complexity bound for sorting
Data selection. Lower complexity bound for sorting Lecturer: Georgy Gimel farb COMPSCI 220 Algorithms and Data Structures 1 / 12 1 Data selection: Quickselect 2 Lower complexity bound for sorting 3 The
More informationDISTRIBUTIONS OF CHERRIES FOR TWO MODELS OF TREES
DISTRIBUTIONS OF CHERRIES FOR TWO MODELS OF TREES ANDY McKENZIE and MIKE STEEL Biomathematics Research Centre University of Canterbury Private Bag 4800 Christchurch, New Zealand No. 177 May, 1999 Distributions
More informationL n = l n (π n ) = length of a longest increasing subsequence of π n.
Longest increasing subsequences π n : permutation of 1,2,...,n. L n = l n (π n ) = length of a longest increasing subsequence of π n. Example: π n = (π n (1),..., π n (n)) = (7, 2, 8, 1, 3, 4, 10, 6, 9,
More informationMath 262A Lecture Notes - Nechiporuk s Theorem
Math 6A Lecture Notes - Nechiporuk s Theore Lecturer: Sa Buss Scribe: Stefan Schneider October, 013 Nechiporuk [1] gives a ethod to derive lower bounds on forula size over the full binary basis B The lower
More informationThe expected value of the squared euclidean cophenetic metric under the Yule and the uniform models
The expected value of the squared euclidean cophenetic metric under the Yule and the uniform models Gabriel Cardona, Arnau Mir, Francesc Rosselló Department of Mathematics and Computer Science, University
More informationExpected Number of Distinct Subsequences in Randomly Gener
Expected Number of Distinct Subsequences in Randomly Generated Strings Yonah Biers-Ariel Anant Godbole Elizabeth Kelley ETSU Rutgers University University of Minnesota Cumberland Conference, Vanderbilt
More informationAlgebraic Statistics Tutorial I
Algebraic Statistics Tutorial I Seth Sullivant North Carolina State University June 9, 2012 Seth Sullivant (NCSU) Algebraic Statistics June 9, 2012 1 / 34 Introduction to Algebraic Geometry Let R[p] =
More informationPattern Popularity in 132-Avoiding Permutations
Pattern Popularity in 132-Avoiding Permutations The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Rudolph,
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationJim Pitman. Department of Statistics. University of California. June 16, Abstract
The asymptotic behavior of the Hurwitz binomial distribution Jim Pitman Technical Report No. 5 Department of Statistics University of California 367 Evans Hall # 386 Berkeley, CA 9472-386 June 16, 1998
More informationMAXIMAL CLADES IN RANDOM BINARY SEARCH TREES
MAXIMAL CLADES IN RANDOM BINARY SEARCH TREES SVANTE JANSON Abstract. We study maximal clades in random phylogenetic trees with the Yule Harding model or, equivalently, in binary search trees. We use probabilistic
More informationOn the complexity of approximate multivariate integration
On the complexity of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 USA ioannis.koutis@cs.cmu.edu January 11, 2005 Abstract
More informationAsymptotic distribution of two-protected nodes in ternary search trees
Asymptotic distribution of two-protected nodes in ternary search trees Cecilia Holmgren Svante Janson March 2, 204; revised October 5, 204 Abstract We study protected nodes in m-ary search trees, by putting
More informationRANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS
RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS David García-García May 13, 2016 Faculdade de Ciências da Universidade de Lisboa OVERVIEW Random Matrix Theory Introduction Matrix ensembles A sample computation:
More informationExploring Treespace. Katherine St. John. Lehman College & the Graduate Center. City University of New York. 20 June 2011
Exploring Treespace Katherine St. John Lehman College & the Graduate Center City University of New York 20 June 2011 (Joint work with the Treespace Working Group, CUNY: Ann Marie Alcocer, Kadian Brown,
More informationHigh-dimensional permutations
Nogafest, Tel Aviv, January 16 What are high dimensional permutations? What are high dimensional permutations? A permutation can be encoded by means of a permutation matrix. What are high dimensional permutations?
More informationOn the Sensitivity of Cyclically-Invariant Boolean Functions
On the Sensitivity of Cyclically-Invariant Boolean Functions arxiv:cs/0501026v1 [cs.cc] 13 Jan 2005 Sourav Chakraborty University of Chicago sourav@cs.uchicago.edu 05-10-2004 Abstract In this paper we
More informationToric Fiber Products
Toric Fiber Products Seth Sullivant North Carolina State University June 8, 2011 Seth Sullivant (NCSU) Toric Fiber Products June 8, 2011 1 / 26 Families of Ideals Parametrized by Graphs Let G be a finite
More informationOn the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh)
On the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh) Louis H. Y. Chen National University of Singapore International Colloquium on Stein s Method, Concentration
More informationarxiv: v1 [math.pr] 21 Mar 2014
Asymptotic distribution of two-protected nodes in ternary search trees Cecilia Holmgren Svante Janson March 2, 24 arxiv:4.557v [math.pr] 2 Mar 24 Abstract We study protected nodes in m-ary search trees,
More informationSolving the Maximum Agreement Subtree and Maximum Comp. Tree problems on bounded degree trees. Sylvain Guillemot, François Nicolas.
Solving the Maximum Agreement Subtree and Maximum Compatible Tree problems on bounded degree trees LIRMM, Montpellier France 4th July 2006 Introduction The Mast and Mct problems: given a set of evolutionary
More informationOn Symmetries of Non-Plane Trees in a Non-Uniform Model
On Symmetries of Non-Plane Trees in a Non-Uniform Model Jacek Cichoń Abram Magner Wojciech Spankowski Krystof Turowski October 3, 26 Abstract Binary trees come in two varieties: plane trees, often simply
More informationComputer Vision Group Prof. Daniel Cremers. 10a. Markov Chain Monte Carlo
Group Prof. Daniel Cremers 10a. Markov Chain Monte Carlo Markov Chain Monte Carlo In high-dimensional spaces, rejection sampling and importance sampling are very inefficient An alternative is Markov Chain
More informationON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS
ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationarxiv: v2 [cs.ds] 3 Oct 2017
Orthogonal Vectors Indexing Isaac Goldstein 1, Moshe Lewenstein 1, and Ely Porat 1 1 Bar-Ilan University, Ramat Gan, Israel {goldshi,moshe,porately}@cs.biu.ac.il arxiv:1710.00586v2 [cs.ds] 3 Oct 2017 Abstract
More informationBranching within branching: a general model for host-parasite co-evolution
Branching within branching: a general model for host-parasite co-evolution Gerold Alsmeyer (joint work with Sören Gröttrup) May 15, 2017 Gerold Alsmeyer Host-parasite co-evolution 1 of 26 1 Model 2 The
More informationThe Subtree Size Profile of Plane-oriented Recursive Trees
The Subtree Size Profile of Plane-oriented Recursive Trees Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan ANALCO11, January 22nd, 2011 Michael Fuchs (NCTU)
More informationMSTD Subsets and Properties of Divots in the Distribution of Missing Sums
MSTD Subsets and Properties of Divots in the Distribution of Missing Sums Steven J Miller, Williams College sjm1@williams.edu Victor Xu, Carnegie Mellon University vzx@andrew.cmu.edu Xiaorong Zhang, Carnegie
More informationErdős-Renyi random graphs basics
Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between
More informationLecture 3: Decision Trees
Lecture 3: Decision Trees Cognitive Systems II - Machine Learning SS 2005 Part I: Basic Approaches of Concept Learning ID3, Information Gain, Overfitting, Pruning Lecture 3: Decision Trees p. Decision
More informationGap Embedding for Well-Quasi-Orderings 1
WoLLIC 2003 Preliminary Version Gap Embedding for Well-Quasi-Orderings 1 Nachum Dershowitz 2 and Iddo Tzameret 3 School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel Abstract Given a
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationAsymptotic Analysis. Slides by Carl Kingsford. Jan. 27, AD Chapter 2
Asymptotic Analysis Slides by Carl Kingsford Jan. 27, 2014 AD Chapter 2 Independent Set Definition (Independent Set). Given a graph G = (V, E) an independent set is a set S V if no two nodes in S are joined
More informationNOTE ON THE HYBRIDIZATION NUMBER AND SUBTREE DISTANCE IN PHYLOGENETICS
NOTE ON THE HYBRIDIZATION NUMBER AND SUBTREE DISTANCE IN PHYLOGENETICS PETER J. HUMPHRIES AND CHARLES SEMPLE Abstract. For two rooted phylogenetic trees T and T, the rooted subtree prune and regraft distance
More informationOn the Average Path Length of Complete m-ary Trees
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 2014, Article 14.6.3 On the Average Path Length of Complete m-ary Trees M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More informationProbabilities on cladograms: introduction to the alpha model
arxiv:math/0511246v1 [math.pr] 9 Nov 2005 Probabilities on cladograms: introduction to the alpha model Daniel J. Ford Abstract This report introduces the alpha model. The alpha model is a one parameter
More informationOn the Sensitivity of Cyclically-Invariant Boolean Functions
On the Sensitivity of Cyclically-Invariant Boolean Functions Sourav Charaborty University of Chicago sourav@csuchicagoedu Abstract In this paper we construct a cyclically invariant Boolean function whose
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 2. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 2 Dr. Hyunyoung Lee 1 Strategy for Exam Preparation - Start studying now (unless have already started) - Study class notes (lecture slides and
More informationPROTECTED NODES AND FRINGE SUBTREES IN SOME RANDOM TREES
PROTECTED NODES AND FRINGE SUBTREES IN SOME RANDOM TREES LUC DEVROYE AND SVANTE JANSON Abstract. We study protected nodes in various classes of random rooted trees by putting them in the general context
More informationLecture 7: Dynamic Programming I: Optimal BSTs
5-750: Graduate Algorithms February, 06 Lecture 7: Dynamic Programming I: Optimal BSTs Lecturer: David Witmer Scribes: Ellango Jothimurugesan, Ziqiang Feng Overview The basic idea of dynamic programming
More informationThe discrepancy of permutation families
The discrepancy of permutation families J. H. Spencer A. Srinivasan P. Tetali Abstract In this note, we show that the discrepancy of any family of l permutations of [n] = {1, 2,..., n} is O( l log n),
More informationOn the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces
On the Distortion of Embedding Perfect Binary Trees into Low-dimensional Euclidean Spaces Dona-Maria Ivanova under the direction of Mr. Zhenkun Li Department of Mathematics Massachusetts Institute of Technology
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Spring 207 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 8 March 28, 207 Chandra Chekuri (UIUC) CS374 Spring 207 / 56 Part I Shortest Paths
More informationCS Data Structures and Algorithm Analysis
CS 483 - Data Structures and Algorithm Analysis Lecture VII: Chapter 6, part 2 R. Paul Wiegand George Mason University, Department of Computer Science March 22, 2006 Outline 1 Balanced Trees 2 Heaps &
More informationNotes on Logarithmic Lower Bounds in the Cell Probe Model
Notes on Logarithmic Lower Bounds in the Cell Probe Model Kevin Zatloukal November 10, 2010 1 Overview Paper is by Mihai Pâtraşcu and Erik Demaine. Both were at MIT at the time. (Mihai is now at AT&T Labs.)
More informationTHE THREE-STATE PERFECT PHYLOGENY PROBLEM REDUCES TO 2-SAT
COMMUNICATIONS IN INFORMATION AND SYSTEMS c 2009 International Press Vol. 9, No. 4, pp. 295-302, 2009 001 THE THREE-STATE PERFECT PHYLOGENY PROBLEM REDUCES TO 2-SAT DAN GUSFIELD AND YUFENG WU Abstract.
More informationIn-Class Soln 1. CS 361, Lecture 4. Today s Outline. In-Class Soln 2
In-Class Soln 1 Let f(n) be an always positive function and let g(n) = f(n) log n. Show that f(n) = o(g(n)) CS 361, Lecture 4 Jared Saia University of New Mexico For any positive constant c, we want to
More informationApplications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee)
Applications of Analytic Combinatorics in Mathematical Biology (joint with H. Chang, M. Drmota, E. Y. Jin, and Y.-W. Lee) Michael Fuchs Department of Applied Mathematics National Chiao Tung University
More informationFundamental Algorithms
Chapter 2: Sorting, Winter 2018/19 1 Fundamental Algorithms Chapter 2: Sorting Jan Křetínský Winter 2018/19 Chapter 2: Sorting, Winter 2018/19 2 Part I Simple Sorts Chapter 2: Sorting, Winter 2018/19 3
More informationRandom Geometric Graphs.
Random Geometric Graphs. Josep Díaz Random Geometric Graphs Random Euclidean Graphs, Random Proximity Graphs, Random Geometric Graphs. Random Euclidean Graphs Choose a sequence V = {x i } n i=1 of independent
More informationThe Minesweeper game: Percolation and Complexity
The Minesweeper game: Percolation and Complexity Elchanan Mossel Hebrew University of Jerusalem and Microsoft Research March 15, 2002 Abstract We study a model motivated by the minesweeper game In this
More informationFundamental Algorithms
Fundamental Algorithms Chapter 2: Sorting Harald Räcke Winter 2015/16 Chapter 2: Sorting, Winter 2015/16 1 Part I Simple Sorts Chapter 2: Sorting, Winter 2015/16 2 The Sorting Problem Definition Sorting
More informationSome of these slides have been borrowed from Dr. Paul Lewis, Dr. Joe Felsenstein. Thanks!
Some of these slides have been borrowed from Dr. Paul Lewis, Dr. Joe Felsenstein. Thanks! Paul has many great tools for teaching phylogenetics at his web site: http://hydrodictyon.eeb.uconn.edu/people/plewis
More informationA Generalization of Wigner s Law
A Generalization of Wigner s Law Inna Zakharevich June 2, 2005 Abstract We present a generalization of Wigner s semicircle law: we consider a sequence of probability distributions (p, p 2,... ), with mean
More informationTutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011
Tutorial 1.3: Combinatorial Set Theory Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011 I. Generalizing Ramsey s Theorem Our proof of Ramsey s Theorem for pairs was
More informationSilver trees and Cohen reals
Silver trees and Cohen reals Otmar Spinas Abstract We prove that the meager ideal M is Tukey reducible to the Mycielski ideal J(Si) which is the ideal associated with Silver forcing Si. This implies add
More informationWalks in Phylogenetic Treespace
Walks in Phylogenetic Treespace lan Joseph aceres Samantha aley John ejesus Michael Hintze iquan Moore Katherine St. John bstract We prove that the spaces of unrooted phylogenetic trees are Hamiltonian
More informationDRAFT. Algebraic computation models. Chapter 14
Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms root-finding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the
More informationAlmost sure asymptotics for the random binary search tree
AofA 10 DMTCS proc. AM, 2010, 565 576 Almost sure asymptotics for the rom binary search tree Matthew I. Roberts Laboratoire de Probabilités et Modèles Aléatoires, Université Paris VI Case courrier 188,
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationPhylogenetic Networks, Trees, and Clusters
Phylogenetic Networks, Trees, and Clusters Luay Nakhleh 1 and Li-San Wang 2 1 Department of Computer Science Rice University Houston, TX 77005, USA nakhleh@cs.rice.edu 2 Department of Biology University
More informationarxiv: v1 [q-bio.pe] 13 Aug 2015
Noname manuscript No. (will be inserted by the editor) On joint subtree distributions under two evolutionary models Taoyang Wu Kwok Pui Choi arxiv:1508.03139v1 [q-bio.pe] 13 Aug 2015 August 14, 2015 Abstract
More informationProtected nodes and fringe subtrees in some random trees
Electron. Commun. Probab. 19 (214), no. 6, 1 1. DOI: 1.1214/ECP.v19-348 ISSN: 183-589X ELECTRONIC COMMUNICATIONS in PROBABILITY Protected nodes and fringe subtrees in some random trees Luc Devroye Svante
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationSELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN
SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean
More informationCS 581 Paper Presentation
CS 581 Paper Presentation Muhammad Samir Khan Recovering the Treelike Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis by Sebastien Roch and Sagi Snir Overview Introduction
More informationOn joint subtree distributions under two evolutionary models
Noname manuscript No. (will be inserted by the editor) On joint subtree distributions under two evolutionary models Taoyang Wu Kwok Pui Choi November 5, 2015 Abstract In population and evolutionary biology,
More informationGrade 11/12 Math Circles Fall Nov. 5 Recurrences, Part 2
1 Faculty of Mathematics Waterloo, Ontario Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Fall 2014 - Nov. 5 Recurrences, Part 2 Running time of algorithms In computer science,
More informationLecture 15 - NP Completeness 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 29, 2018 Lecture 15 - NP Completeness 1 In the last lecture we discussed how to provide
More informationOn the number of matchings of a tree.
On the number of matchings of a tree. Stephan G. Wagner Department of Mathematics, Graz University of Technology, Steyrergasse 30, A-800 Graz, Austria Abstract In a paper of Klazar, several counting examples
More informationComputational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 4 Fall 2010
Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 4 Fall 010 Peter Bro Miltersen January 16, 011 Version 1. 4 Finite Perfect Information Games Definition
More informationAlgorithm efficiency analysis
Algorithm efficiency analysis Mădălina Răschip, Cristian Gaţu Faculty of Computer Science Alexandru Ioan Cuza University of Iaşi, Romania DS 2017/2018 Content Algorithm efficiency analysis Recursive function
More informationRemarks on a Ramsey theory for trees
Remarks on a Ramsey theory for trees János Pach EPFL, Lausanne and Rényi Institute, Budapest József Solymosi University of British Columbia, Vancouver Gábor Tardos Simon Fraser University and Rényi Institute,
More informationCPSC 320 (Intermediate Algorithm Design and Analysis). Summer Instructor: Dr. Lior Malka Final Examination, July 24th, 2009
CPSC 320 (Intermediate Algorithm Design and Analysis). Summer 2009. Instructor: Dr. Lior Malka Final Examination, July 24th, 2009 Student ID: INSTRUCTIONS: There are 6 questions printed on pages 1 7. Exam
More informationDynamic Programming: Shortest Paths and DFA to Reg Exps
CS 374: Algorithms & Models of Computation, Fall 205 Dynamic Programming: Shortest Paths and DFA to Reg Exps Lecture 7 October 22, 205 Chandra & Manoj (UIUC) CS374 Fall 205 / 54 Part I Shortest Paths with
More informationThe symmetry in the martingale inequality
Statistics & Probability Letters 56 2002 83 9 The symmetry in the martingale inequality Sungchul Lee a; ;, Zhonggen Su a;b;2 a Department of Mathematics, Yonsei University, Seoul 20-749, South Korea b
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationA basis for the non-crossing partition lattice top homology
J Algebr Comb (2006) 23: 231 242 DOI 10.1007/s10801-006-7395-5 A basis for the non-crossing partition lattice top homology Eliana Zoque Received: July 31, 2003 / Revised: September 14, 2005 / Accepted:
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationLecture 21: Algebraic Computation Models
princeton university cos 522: computational complexity Lecture 21: Algebraic Computation Models Lecturer: Sanjeev Arora Scribe:Loukas Georgiadis We think of numerical algorithms root-finding, gaussian
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationFast algorithms for even/odd minimum cuts and generalizations
Fast algorithms for even/odd minimum cuts and generalizations András A. Benczúr 1 and Ottilia Fülöp 2 {benczur,otti}@cs.elte.hu 1 Computer and Automation Institute, Hungarian Academy of Sciences, and Department
More informationThe space requirement of m-ary search trees: distributional asymptotics for m 27
1 The space requirement of m-ary search trees: distributional asymptotics for m 7 James Allen Fill 1 and Nevin Kapur 1 Applied Mathematics and Statistics, The Johns Hopkins University, 3400 N. Charles
More informationREVERSIBLE MARKOV STRUCTURES ON DIVISIBLE SET PAR- TITIONS
Applied Probability Trust (29 September 2014) REVERSIBLE MARKOV STRUCTURES ON DIVISIBLE SET PAR- TITIONS HARRY CRANE, Rutgers University PETER MCCULLAGH, University of Chicago Abstract We study k-divisible
More informationHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
How many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected? Michael Anastos and Alan Frieze February 1, 2018 Abstract In this paper we study the randomly
More informationQuivers of Period 2. Mariya Sardarli Max Wimberley Heyi Zhu. November 26, 2014
Quivers of Period 2 Mariya Sardarli Max Wimberley Heyi Zhu ovember 26, 2014 Abstract A quiver with vertices labeled from 1,..., n is said to have period 2 if the quiver obtained by mutating at 1 and then
More informationDistribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers
Discrete Mathematics and Theoretical Computer Science DMTCS vol. subm., by the authors, 1 1 Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers Christopher Eagle 1 and
More informationLecture 4. 1 Circuit Complexity. Notes on Complexity Theory: Fall 2005 Last updated: September, Jonathan Katz
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 4 1 Circuit Complexity Circuits are directed, acyclic graphs where nodes are called gates and edges are called
More information