The Subtree Size Profile of Plane-oriented Recursive Trees
|
|
- Coleen Hood
- 5 years ago
- Views:
Transcription
1 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) Subtree Size Profile of PORTs January 22nd, / 27
2 Profiles of Trees Rooted tree of size n Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
3 Profiles of Trees Rooted tree of size n Node profile: # of nodes at level k Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
4 Profiles of Trees Rooted tree of size n Node profile: # of nodes at level k Subtree size profile: # of subtrees of size k. 7 8 Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
5 Profiles of Trees Rooted tree of size n Node profile: # of nodes at level k Subtree size profile: # of subtrees of size k. 7 8 Both are a double-indexed sequence X n,k. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
6 Recent Studies of Profile Node Profile: extensively studied for many classes of trees. Drmota and Gittenberger (1997); Chauvin, Drmota, Jabbour-Hattab (2001); Chauvin, Klein, Marckert, Rouault (2005); Drmota and Hwang (2005); Fuchs, Hwang, Neininger (2006); Hwang (2007); Drmota, Janson, Neininger (2008); Park, Hwang, Nicodeme, Szpankowski (2009); Drmota and Szpankowski (2010); etc. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
7 Recent Studies of Profile Node Profile: extensively studied for many classes of trees. Drmota and Gittenberger (1997); Chauvin, Drmota, Jabbour-Hattab (2001); Chauvin, Klein, Marckert, Rouault (2005); Drmota and Hwang (2005); Fuchs, Hwang, Neininger (2006); Hwang (2007); Drmota, Janson, Neininger (2008); Park, Hwang, Nicodeme, Szpankowski (2009); Drmota and Szpankowski (2010); etc. Subtree Size Profile: mainly studied for binary trees and increasing trees. Feng, Miao, Su (2006); Feng, Mahmoud, Su (2007); Feng, Mahmoud, Panholzer (2008); Fuchs (2008); Chang and Fuchs (2010); Dennert and Grübel (2010); etc. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
8 Why studying the Subtree Size Profile? Fine shape characteristic Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
9 Why studying the Subtree Size Profile? Fine shape characteristic, e.g., T n := total path length; W n := Wiener index, then, T n = kx n,k and W n = k)kx n,k. k 0 k 0(n Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
10 Why studying the Subtree Size Profile? Fine shape characteristic, e.g., T n := total path length; W n := Wiener index, then, T n = kx n,k and W n = k)kx n,k. k 0 k 0(n Contains information about occurrences of patterns. Important in many fields such as Computer Science (compressing, etc.), Mathematical Biology (phylogenetics), etc. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
11 Random Binary Trees Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
12 Random Binary Trees 1 Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
13 Random Binary Trees 1 2 Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
14 Random Binary Trees Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
15 Random Binary Trees Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
16 Random Binary Trees Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
17 Random Binary Trees Randomly pick an external node and replace it by a cherry. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
18 Random Binary Trees Randomly pick an external node and replace it by a cherry. 7 Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
19 Random Binary Trees Randomly pick an external node and replace it by a cherry. 7 8 Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
20 Random Binary Trees Randomly pick an external node and replace it by a cherry. 7 8 Equivalent to random binary search tree. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
21 Random Recursive Trees Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
22 Random Recursive Trees 1 Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
23 Random Recursive Trees 1 2 Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
24 Random Recursive Trees Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
25 Random Recursive Trees Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
26 Random Recursive Trees Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
27 Random Recursive Trees Randomly pick an external node and replace it by an internal node. Add external nodes. Same as uniform model for non-plane trees with increasing labels. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
28 Random Plane-oriented Recursive Trees (PORTs) Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
29 Random Plane-oriented Recursive Trees (PORTs) 1 Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
30 Random Plane-oriented Recursive Trees (PORTs) 1 2 Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
31 Random Plane-oriented Recursive Trees (PORTs) Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
32 Random Plane-oriented Recursive Trees (PORTs) Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
33 Random Plane-oriented Recursive Trees (PORTs) Randomly pick an external node and replace it by an internal node. Add external nodes. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
34 Random Plane-oriented Recursive Trees (PORTs) Randomly pick an external node and replace it by an internal node. Add external nodes. Same as uniform model for plane trees with increasing labels. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
35 Importance of the Random Models Random Binary Trees Binary search tree, Quicksort, Yule-Harding Model in Phylogenetics, Coalescent Model, etc. Random Recursive Trees Simple model for spread of epidemics, for pyramid schemes, for stemma construction of philology, etc. Also, used in computational geometry and in Hopf algebras. Random PORTs One of the simplest network models (for instance for WWW). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
36 Limit Laws for Random Binary Trees Theorem (Feng, Mahmoud, Panholzer; F.) (i) (Normal range) Let k = o ( n). Then, X n,k µ n,k σ n,k (ii) (Poisson range) Let k c n. Then, X n,k d N (0, 1). d Poisson(2c 2 ). (iii) (Degenerate range) Let k < n and n = o(k). Then, L X 1 n,k 0. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
37 Limit Laws for Random Binary Trees Theorem (Feng, Mahmoud, Panholzer; F.) (i) (Normal range) Let k = o ( n). Then, X n,k µ n,k σ n,k (ii) (Poisson range) Let k c n. Then, X n,k d N (0, 1). d Poisson(2c 2 ). (iii) (Degenerate range) Let k < n and n = o(k). Then, L X 1 n,k 0. Similar result holds for random recursive trees as well. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
38 Consequences for Occurrences of Pattern Sizes Pattern=Subtree on the fringe of the tree. # of patterns of size k: C k = 1 ( ) 2k 4k k + 1 k πk 3/2. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
39 Consequences for Occurrences of Pattern Sizes Pattern=Subtree on the fringe of the tree. # of patterns of size k: C k = 1 ( ) 2k 4k k + 1 k πk 3/2. Hence, all patterns can just occur up to a size O(log n). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
40 Consequences for Occurrences of Pattern Sizes Pattern=Subtree on the fringe of the tree. # of patterns of size k: C k = 1 ( ) 2k 4k k + 1 k πk 3/2. Hence, all patterns can just occur up to a size O(log n). On the other hand, our result shows: Pattern sizes occur until o( n). Pattern sizes sporadically exist around n. Patterns with sizes beyond n are unlikely. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
41 Why are Pattern Sizes beyond n unlikely? Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
42 Why are Pattern Sizes beyond n unlikely? T n =total path length. It is well-known that T n is of order n log n with high probability. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
43 Why are Pattern Sizes beyond n unlikely? T n =total path length. It is well-known that T n is of order n log n with high probability. Recall that n 1 T n = k=0 kx n,k Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
44 Why are Pattern Sizes beyond n unlikely? T n =total path length. It is well-known that T n is of order n log n with high probability. Recall that n 1 T n = k=0 kx n,k Hence, if all pattern sizes up to k 0 exist, then Θ(k 2 0) = k k 0 k T n = Θ(n log n). Thus, pattern sizes beyond n log n are very unlikely. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
45 Method of Moments Theorem Z n, Z random variables. If E(Z m n ) E(Z m ) for all m 1 and Z is uniquely determined by its moments, then Z n d Z. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
46 Method of Moments Theorem Z n, Z random variables. If E(Z m n ) E(Z m ) for all m 1 and Z is uniquely determined by its moments, then Z n d Z. If Z is standard normal, then { E(Zn m 0, if m is odd; ) = m!/(2 m/2 (m/2)!), if m is even. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
47 Proof of the Limit Laws Feng, Mahmoud, Panholzer: Derived a complicated explicit expression for centered moments. Used the exact expression to obtain first order asymptotics. Many cancellations! Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
48 Proof of the Limit Laws Feng, Mahmoud, Panholzer: Derived a complicated explicit expression for centered moments. Used the exact expression to obtain first order asymptotics. Many cancellations! Our approach: Derived a recurrence for centered moments. Derived first order asymptotics via induction. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
49 Proof of the Limit Laws Feng, Mahmoud, Panholzer: Derived a complicated explicit expression for centered moments. Used the exact expression to obtain first order asymptotics. Many cancellations! Our approach: Derived a recurrence for centered moments. Derived first order asymptotics via induction. Our approach is easier and can be applied to other random trees. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
50 Theorem (F.) (i) (Normal range) Let k = o ( n). Then, where µ = 1/(2k 2 ) and X n,k µn σ n d N (0, 1), σ 2 = 8k2 4k 8 (2k 3)!! 2 (4k 2 1) 2 (k 1)! 2 4 k 1 k(2k + 1). (ii) (Poisson range) Let k c n. Then, X n,k d Poisson(2c 2 ). (iii) (Degenerate range) Let k < n and n = o(k). Then, L X 1 n,k 0. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
51 Proof for Fixed k Set Ā [m] k (z) = τ n E(X n,k µn) zn n! n 1 Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
52 Proof for Fixed k Set Then, where B [m] k Ā [m] k (z) = τ n E(X n,k µn) zn n! n 1 d dz Ā[m] k Ā[m] (z) = k (z) 1 2z [m] + B k (z), (z) is a function of Ā[i] (z) with i < m. k Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
53 Proof for Fixed k Set Then, where B [m] k Ā [m] k (z) = τ n E(X n,k µn) zn n! n 1 d dz Ā[m] k Ā[m] (z) = k (z) 1 2z [m] + B k (z), (z) is a function of Ā[i] (z) with i < m. k Above ODE has solution Ā [m] k (z) = 1 1 2z z 0 B [m] k (t) 1 2tdt. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
54 Proof for Fixed k Set Then, where B [m] k Ā [m] k (z) = τ n E(X n,k µn) zn n! n 1 d dz Ā[m] k Ā[m] (z) = k (z) 1 2z [m] + B k (z), (z) is a function of Ā[i] (z) with i < m. k Above ODE has solution Ā [m] k (z) = 1 1 2z z 0 B [m] k (t) 1 2tdt. Asymptotics of centered moments via induction ( moment-pumping ). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
55 Singularity Analysis Consider = {z : z < r, z 1/2, arg(z 1/2) > ϕ}, where r > 1 and 0 < ϕ < π/2. Theorem (Flajolet and Odlyzko) (i) For α C \ {0, 1, 2, } [z n ](1 2z) α 2n n α 1 Γ(α) (ii) Let f(z) be analytic in. Then, ( ) α(α 1) n f(z) = O ( (1 2z) α) [z n ]f(z) = O ( 2 n n α 1). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
56 Closure Properties Theorem Let f(z) be analytic in with f(z) = J c j (1 2z) α j + O ( (1 2z) A), j=0 where α j, A 1. Then, z 0 f(t)dt is analytic in and (i) if A > 1, then for some explicit c z 0 f(t)dt = 1 2 J j=0 (ii) if A < 1, then as above but without c. c j α j + 1 (1 2z)α j+1 + c + O ( (1 2z) A+1) ; Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
57 Asymptotic Expansions Proposition Ā [m] k (z) is analytic in. Moreover, and Ā [2m] k (z) = Ā [2m 1] k (z) = O ((1 2z) 3/2 m) (2m)!(2m 3)!!σ2m 4 m (1 2z) 1/2 m + O ( (1 2z) 1 m). m! Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
58 Asymptotic Expansions Proposition Ā [m] k (z) is analytic in. Moreover, and Ā [2m] k (z) = Ā [2m 1] k (z) = O ((1 2z) 3/2 m) (2m)!(2m 3)!!σ2m 4 m (1 2z) 1/2 m + O ( (1 2z) 1 m). m! From this, by singularity analysis, { E(X n,k µn) m 0, if m is odd; = m!/(2 m/2 (m/2)!), if m is even. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
59 Proof for Varying k Set Ā[m] n,k = E(X n,k µn) m. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
60 Proof for Varying k Set Ā[m] n,k = E(X n,k µn) m. Then, Ā [m] n,k = 1 j<n π n,j (Ā[m] j,k + Ā[m] [m] n j,k ) + B n,k, where B [m] n,k is a function of Ā[i] n,k with i < m and π n,j = 2(n j)c jc n j nc n. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
61 Proof for Varying k Set Ā[m] n,k = E(X n,k µn) m. Then, Ā [m] n,k = 1 j<n π n,j (Ā[m] j,k + Ā[m] [m] n j,k ) + B n,k, where B [m] n,k is a function of Ā[i] n,k with i < m and π n,j = 2(n j)c jc n j nc n. We have Ā [m] n,k = k+1 j n (n + 1 j)c j C n B[m] j,k. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
62 Asymptotic Expansions Proposition We have, Ā [2m 1] n,k ( ( n ) ) m 1/2 ( = o k 2, Ā [2m] n ) m n,k g m, 2k 2 where g m = (2m)!/(2 m m!). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
63 Asymptotic Expansions Proposition Uniformly in n, k, m { Ā [m] n ( n ) }) m/2 n,k (max = O k 2, k 2. Proposition We have, Ā [2m 1] n,k ( ( n ) ) m 1/2 ( = o k 2, Ā [2m] n ) m n,k g m, 2k 2 where g m = (2m)!/(2 m m!). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
64 Simple Classes of Increasing Trees (i) Consider rooted, plane trees with increasing labels. Let φ r be a weight sequence with φ 0 > 0 and φ r > 0 for some r 2. Denote by φ(ω) the OGF of φ r. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
65 Simple Classes of Increasing Trees (i) Consider rooted, plane trees with increasing labels. Let φ r be a weight sequence with φ 0 > 0 and φ r > 0 for some r 2. Denote by φ(ω) the OGF of φ r. Define the weight of a tree T as ω(t ) = v T φ d(v), where d(v) is the out-degree of v. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
66 Simple Classes of Increasing Trees (i) Consider rooted, plane trees with increasing labels. Let φ r be a weight sequence with φ 0 > 0 and φ r > 0 for some r 2. Denote by φ(ω) the OGF of φ r. Define the weight of a tree T as ω(t ) = v T φ d(v), where d(v) is the out-degree of v. Set τ n = ω(t ) #T =n which is the cumulative weight of all trees of size n. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
67 Simple Classes of Increasing Trees (ii) Define the probability of a tree of size n as P (T ) = ω(t ) τ n. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
68 Simple Classes of Increasing Trees (ii) Define the probability of a tree of size n as Previous Models P (T ) = ω(t ) τ n. Random binary trees: φ 0 = 1, φ 1 = 2, φ 2 = 1 and φ r = 0 for r 3; Random increasing trees: φ r = 1/r!. Random PORTs: φ r = 1. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
69 Simple Classes of Increasing Trees (ii) Define the probability of a tree of size n as Previous Models P (T ) = ω(t ) τ n. Random binary trees: φ 0 = 1, φ 1 = 2, φ 2 = 1 and φ r = 0 for r 3; Random increasing trees: φ r = 1/r!. Random PORTs: φ r = 1. All these models can be obtained from a tree evolution process. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
70 Grown Simple Classes of Increasing Trees Theorem (Panholzer and Prodinger) All simple classes of increasing tree which can be obtained via a tree evolution process are Random d-ary trees: φ(ω) = φ 0 (1 + ct/φ 0 ) d with c > 0, d {2, 3,...}; Random increasing trees: φ(ω) = φ 0 e ct/φ 0 with c > 0; Generalized random PORTs: φ(ω) = φ 0 (1 ct/φ 0 ) r 1 with c > 0, r > 1. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
71 Grown Simple Classes of Increasing Trees Theorem (Panholzer and Prodinger) All simple classes of increasing tree which can be obtained via a tree evolution process are Random d-ary trees: φ(ω) = φ 0 (1 + ct/φ 0 ) d with c > 0, d {2, 3,...}; Random increasing trees: φ(ω) = φ 0 e ct/φ 0 with c > 0; Generalized random PORTs: φ(ω) = φ 0 (1 ct/φ 0 ) r 1 with c > 0, r > 1. For stochastic properties, it is sufficient to consider the cases with φ 0 = c = 1. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
72 Mean for Grown Simple Classes of Increasing Trees Proposition For random d-ary trees, µ n,k := E(X n,k ) = d((d 1)n + 1) ((d 1)k + d)((d 1)k + 1). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
73 Mean for Grown Simple Classes of Increasing Trees Proposition For random d-ary trees, µ n,k := E(X n,k ) = d((d 1)n + 1) ((d 1)k + d)((d 1)k + 1). Proposition For generalized random PORTs, µ n,k := E(X n,k ) = (r 1)(rn 1) (rk + r 1)(rk 1). Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
74 Limit Laws for d-ary Trees Theorem (F.) (i) (Normal range) Let k = o ( n) and k. Then, X n,k µ n,k µn,k (ii) (Poisson range) Let k c n. Then, X n,k d N (0, 1). d Poisson(2c 2 ). (iii) (Degenerate range) Let k < n and n = o(k). Then, L X 1 n,k 0. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
75 Limit Laws for Generalized Random PORTs Theorem (F.) (i) (Normal range) Let k = o ( n) and k. Then, X n,k µ n,k µn,k (ii) (Poisson range) Let k c n. Then, X n,k d N (0, 1). d Poisson(2c 2 ). (iii) (Degenerate range) Let k < n and n = o(k). Then, L X 1 n,k 0. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
76 Summary Inductive approach for deriving limit laws of subtree size profile. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
77 Summary Inductive approach for deriving limit laws of subtree size profile. Approach can be applied to many classes of random trees and shows universality of the phenomena observed by Feng, Mahmoud and Panholzer. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
78 Summary Inductive approach for deriving limit laws of subtree size profile. Approach can be applied to many classes of random trees and shows universality of the phenomena observed by Feng, Mahmoud and Panholzer. Simple classes of trees (without labels) can also be treated. For instance, random Catalan trees were considered in Chang and Fuchs (2010). Limit Laws for Patterns in Phylogenetic Trees, J. Math. Biol., 60, Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
79 Summary Inductive approach for deriving limit laws of subtree size profile. Approach can be applied to many classes of random trees and shows universality of the phenomena observed by Feng, Mahmoud and Panholzer. Simple classes of trees (without labels) can also be treated. For instance, random Catalan trees were considered in Chang and Fuchs (2010). Limit Laws for Patterns in Phylogenetic Trees, J. Math. Biol., 60, Approach can be refined to obtain Berry-Esseen bounds, LLT and Poisson approximation results. Michael Fuchs (NCTU) Subtree Size Profile of PORTs January 22nd, / 27
On the number of subtrees on the fringe of random trees (partly joint with Huilan Chang)
On the number of subtrees on the fringe of random trees (partly joint with Huilan Chang) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan April 16th, 2008 Michael
More informationThe Subtree Size Profile of Plane-oriented Recursive Trees
The Subtree Size Profile of Plane-oriente Recursive Trees Michael FUCHS Department of Applie Mathematics National Chiao Tung University Hsinchu, 3, Taiwan Email: mfuchs@math.nctu.eu.tw Abstract In this
More informationThe Subtree Size Profile of Bucket Recursive Trees
Iranian Journal of Mathematical Sciences and Informatics Vol., No. (206, pp - DOI: 0.7508/ijmsi.206.0.00 The Subtree Size Profile of Bucket Recursive Trees Ramin Kazemi Department of Statistics, Imam Khomeini
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 informationApproximate Counting via the Poisson-Laplace-Mellin Method (joint with Chung-Kuei Lee and Helmut Prodinger)
Approximate Counting via the Poisson-Laplace-Mellin Method (joint with Chung-Kuei Lee and Helmut Prodinger) Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan
More informationAsymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees (joint with Hsien-Kuei Hwang and Vytas Zacharovas)
Asymptotic and Exact Poissonized Variance in the Analysis of Random Digital Trees (joint with Hsien-Kuei Hwang and Vytas Zacharovas) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University
More informationCombinatorial/probabilistic analysis of a class of search-tree functionals
Combinatorial/probabilistic analysis of a class of search-tree functionals Jim Fill jimfill@jhu.edu http://www.mts.jhu.edu/ fill/ Mathematical Sciences The Johns Hopkins University Joint Statistical Meetings;
More informationDependence between Path Lengths and Size in Random Trees (joint with H.-H. Chern, H.-K. Hwang and R. Neininger)
Dependence between Path Lengths and Size in Random Trees (joint with H.-H. Chern, H.-K. Hwang and R. Neininger) Michael Fuchs Institute of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan
More informationForty years of tree enumeration
October 24, 206 Canada John Moon (Alberta) Counting labelled trees Canadian mathematical monographs What is our subject? Asymptotic enumeration or Probabilistic combinatorics? What is our subject? Asymptotic
More informationEverything You Always Wanted to Know about Quicksort, but Were Afraid to Ask. Marianne Durand
Algorithms Seminar 200 2002, F. Chyzak (ed., INRIA, (2003, pp. 57 62. Available online at the URL http://algo.inria.fr/seminars/. Everything You Always Wanted to Know about Quicksort, but Were Afraid to
More informationANALYSIS OF SOME TREE STATISTICS
ANALYSIS OF SOME TREE STATISTICS ALOIS PANHOLZER Abstract. In this survey we present results and the used proof techniques concerning the analysis of several parameters in frequently used tree families.
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 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 informationThe variance for partial match retrievals in k-dimensional bucket digital trees
The variance for partial match retrievals in k-dimensional ucket digital trees Michael FUCHS Department of Applied Mathematics National Chiao Tung University January 12, 21 Astract The variance of partial
More informationScale free random trees
Scale free random trees Tamás F. Móri Department of Probability Theory and Statistics, Eötvös Loránd University, 7 Budapest, Pázmány Péter s. /C moritamas@ludens.elte.hu Research supported by the Hungarian
More informationRandom trees and branching processes
Random trees and branching processes Svante Janson IMS Medallion Lecture 12 th Vilnius Conference and 2018 IMS Annual Meeting Vilnius, 5 July, 2018 Part I. Galton Watson trees Let ξ be a random variable
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 informationCENTRAL LIMIT THEOREMS FOR ADDITIVE TREE PARAMETERS
CENRAL LIMI HEOREMS FOR ADDIIVE REE PARAMEERS SEPHAN WAGNER DEDICAED O HE MEMORY OF PHILIPPE FLAJOLE Abstract. We call a tree parameter additive if it can be determined recursively as the sum of the parameter
More informationNotes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.
Lecture: Hélène Barcelo Analytic Combinatorics ECCO 202, Bogotá Notes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.. Tuesday, June 2, 202 Combinatorics is the study of finite structures that
More informationPartial match queries in random quadtrees
Partial match queries in random quadtrees Nicolas Broutin nicolas.broutin@inria.fr Projet Algorithms INRIA Rocquencourt 78153 Le Chesnay France Ralph Neininger and Henning Sulzbach {neiningr, sulzbach}@math.uni-frankfurt.de
More informationGrowing and Destroying Catalan Stanley Trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 20:1, 2018, #11 Growing and Destroying Catalan Stanley Trees Benjamin Hackl 1 Helmut Prodinger 2 arxiv:1704.03734v3 [math.co] 26 Feb 2018
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 informationarxiv: v1 [math.co] 1 Aug 2018
REDUCING SIMPLY GENERATED TREES BY ITERATIVE LEAF CUTTING BENJAMIN HACKL, CLEMENS HEUBERGER, AND STEPHAN WAGNER arxiv:1808.00363v1 [math.co] 1 Aug 2018 ABSTRACT. We consider a procedure to reduce simply
More informationarxiv: v1 [math.co] 12 Sep 2018
ON THE NUMBER OF INCREASING TREES WITH LABEL REPETITIONS arxiv:809.0434v [math.co] Sep 08 OLIVIER BODINI, ANTOINE GENITRINI, AND BERNHARD GITTENBERGER Abstract. In this paper we study a special subclass
More informationAdditive tree functionals with small toll functions and subtrees of random trees
Additive tree functionals with small toll functions and subtrees of random trees Stephan Wagner To cite this version: Stephan Wagner. Additive tree functionals with small toll functions and subtrees of
More informationDeterministic edge-weights in increasing tree families.
Deterministic edge-weights in increasing tree families. Markus Kuba and Stephan Wagner Institut für Diskrete Mathematik und Geometrie Technische Universität Wien Wiedner Hauptstr. 8-0/04, 040 Wien, Austria
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 informationDESTRUCTION OF VERY SIMPLE TREES
DESTRUCTION OF VERY SIMPLE TREES JAMES ALLEN FILL, NEVIN KAPUR, AND ALOIS PANHOLZER Abstract. We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple
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 informationGENERALIZED STIRLING PERMUTATIONS, FAMILIES OF INCREASING TREES AND URN MODELS
GENERALIZED STIRLING PERMUTATIONS, FAMILIES OF INCREASING TREES AND URN MODELS SVANTE JANSON, MARKUS KUBA, AND ALOIS PANHOLZER ABSTRACT. Bona [6] studied the distribution of ascents, plateaux and descents
More informationLIMIT LAWS FOR SUMS OF FUNCTIONS OF SUBTREES OF RANDOM BINARY SEARCH TREES
LIMIT LAWS FOR SUMS OF FUNCTIONS OF SUBTREES OF RANDOM BINARY SEARCH TREES Luc Devroye luc@cs.mcgill.ca Abstract. We consider sums of functions of subtrees of a random binary search tree, and obtain general
More informationThe Moments of the Profile in Random Binary Digital Trees
Journal of mathematics and computer science 6(2013)176-190 The Moments of the Profile in Random Binary Digital Trees Ramin Kazemi and Saeid Delavar Department of Statistics, Imam Khomeini International
More informationarxiv: v1 [math.co] 12 Apr 2018
COMBINATORIAL ANALYSIS OF GROWTH MODELS FOR SERIES-PARALLEL NETWORKS MARKUS KUBA AND ALOIS PANHOLZER arxiv:804.0550v [math.co] Apr 08 Abstract. We give combinatorial descriptions of two stochastic growth
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 informationLIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES
LIMITING DISTRIBUTIONS FOR THE NUMBER OF INVERSIONS IN LABELLED TREE FAMILIES ALOIS PANHOLZER AND GEORG SEITZ Abstract. We consider so-called simple families of labelled trees, which contain, e.g., ordered,
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 information3. Generating Functions
ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions http://aofa.cs.princeton.edu ANALYTIC COMBINATORICS P A R T O N E 3. Generating Functions OF OGFs Solving recurrences Catalan numbers EGFs Counting
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 informationarxiv:math.pr/ v1 17 May 2004
Probabilistic Analysis for Randomized Game Tree Evaluation Tämur Ali Khan and Ralph Neininger arxiv:math.pr/0405322 v1 17 May 2004 ABSTRACT: We give a probabilistic analysis for the randomized game tree
More informationBRANCHING RANDOM WALKS ON BINARY SEARCH TREES: CONVERGENCE OF THE OCCUPATION MEASURE. Eric Fekete 1
ESAIM: PS October 20, Vol. 14, p. 286 298 OI: 10.1051/ps:2008035 ESAIM: Probability and Statistics www.esaim-ps.org BRANCHING RANOM WALKS ON BINARY SEARCH TREES: CONVERGENCE OF THE OCCUPATION MEASURE Eric
More informationROSENA R.X. DU AND HELMUT PRODINGER. Dedicated to Philippe Flajolet ( )
ON PROTECTED NODES IN DIGITAL SEARCH TREES ROSENA R.X. DU AND HELMUT PRODINGER Dedicated to Philippe Flajolet (98 2) Abstract. Recently, 2-protected nodes were studied in the context of ordered trees and
More informationAsymptotic variance of random symmetric digital search trees
Discrete Mathematics and Theoretical Computer Science DMTCS vol. :,, 3 66 Asymptotic variance of random symmetric digital search trees Hsien-Kuei Hwang, Michael Fuchs and Vytas Zacharovas Institute of
More informationPhase changes in random m-ary search trees and generalized quicksort
Phase changes in random m-ary search trees and generalized quicksort Hua-Huai Chern Department of Mathematics and Science Education Taipei Municipal Teacher College Taipei Taiwan Hsien-Kuei Hwang 2 Institute
More informationRandom Boolean expressions
Random Boolean expressions Danièle Gardy PRiSM, Univ. Versailles-Saint Quentin and CNRS UMR 8144. Daniele.Gardy@prism.uvsq.fr We examine how we can define several probability distributions on the set of
More information5. Analytic Combinatorics
ANALYTIC COMBINATORICS P A R T O N E 5. Analytic Combinatorics http://aofa.cs.princeton.edu Analytic combinatorics is a calculus for the quantitative study of large combinatorial structures. Features:
More informationMaximum Agreement Subtrees
Maximum Agreement Subtrees Seth Sullivant North Carolina State University March 24, 2018 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, 2018 1 / 23 Phylogenetics Problem Given a collection
More informationFrom the Discrete to the Continuous, and Back... Philippe Flajolet INRIA, France
From the Discrete to the Continuous, and Back... Philippe Flajolet INRIA, France 1 Discrete structures in... Combinatorial mathematics Computer science: data structures & algorithms Information and communication
More informationLIMITING DISTRIBUTIONS FOR ADDITIVE FUNCTIONALS ON CATALAN TREES
LIMITING DISTRIBUTIONS FOR ADDITIVE FUNCTIONALS ON CATALAN TREES JAMES ALLEN FILL AND NEVIN KAPUR Abstract. Additive tree functionals represent the cost of many divide-andconquer algorithms. We derive
More informationThe Number of Guillotine Partitions in d Dimensions
The Number of Guillotine Partitions in d Dimensions Eyal Ackerman Gill Barequet Ron Y. Pinter Dan Romik Abstract Guillotine partitions play an important role in many research areas and application domains,
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 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 informationOn the number of heaps and the cost of heap construction
On the number of heaps and the cost of heap construction Hsien-Kuei Hwang Institute of Statistical Science Academia Sinica Taipei 5 Taiwan Jean-Marc Steyaert LIX École Polytechnique 928 Palaiseau France
More informationRandom Boolean expressions
Computational Logic and Applications, CLA 05 DMTCS proc. AF, 2006, 1 36 Random Boolean expressions Danièle Gardy PRiSM, Univ. Versailles-Saint Quentin and CNRS UMR 8144. Daniele.Gardy@prism.uvsq.fr We
More informationGENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS
GENERATING FUNCTIONS AND CENTRAL LIMIT THEOREMS Michael Drmota Institute of Discrete Mathematics and Geometry Vienna University of Technology A 1040 Wien, Austria michael.drmota@tuwien.ac.at http://www.dmg.tuwien.ac.at/drmota/
More informationEnumerating connected labelled graphs
Enumerating connected labelled graphs Keith Briggs Keith.Briggs@bt.com more.btexact.com/people/briggsk2/ 2004 August 17 conn-lab-graphs.tex typeset 2004 August 17 10:40 in pdflatex on a linux system Enumerating
More informationENUMERATION RESULTS FOR ALTERNATING TREE FAMILIES
ENUMERATION RESULTS FOR ALTERNATING TREE FAMILIES MARKUS KUBA AND ALOIS PANHOLZER Abstract. We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels
More informationAlmost all trees have an even number of independent sets
Almost all trees have an even number of independent sets Stephan G. Wagner Department of Mathematical Sciences Stellenbosch University Private Bag X1, Matieland 7602, South Africa swagner@sun.ac.za Submitted:
More informationFluctuations from the Semicircle Law Lecture 1
Fluctuations from the Semicircle Law Lecture 1 Ioana Dumitriu University of Washington Women and Math, IAS 2014 May 20, 2014 Ioana Dumitriu (UW) Fluctuations from the Semicircle Law Lecture 1 May 20, 2014
More informationDISCRETE AND ALGEBRAIC STRUCTURES
DISCRETE AND ALGEBRAIC STRUCTURES Master Study Mathematics MAT40 Winter Semester 015/16 (Due to organisational reasons register for the course at TU and KFU) Edited by Mihyun Kang TU Graz Contents I Lectures
More informationOn Universal Types. Gadiel Seroussi Hewlett-Packard Laboratories Palo Alto, California, USA. University of Minnesota, September 14, 2004
On Universal Types Gadiel Seroussi Hewlett-Packard Laboratories Palo Alto, California, USA University of Minnesota, September 14, 2004 Types for Parametric Probability Distributions A = finite alphabet,
More informationNON-FRINGE SUBTREES IN CONDITIONED GALTON WATSON TREES
NON-FRINGE SUBTREES IN CONDITIONED GALTON WATSON TREES XING SHI CAI AND SVANTE JANSON Abstract. We study ST n, the number of subtrees in a conditioned Galton Watson tree of size n. With two very different
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 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 informationWeek 5: Quicksort, Lower bound, Greedy
Week 5: Quicksort, Lower bound, Greedy Agenda: Quicksort: Average case Lower bound for sorting Greedy method 1 Week 5: Quicksort Recall Quicksort: The ideas: Pick one key Compare to others: partition into
More informationAdvanced Analysis of Algorithms - Midterm (Solutions)
Advanced Analysis of Algorithms - Midterm (Solutions) K. Subramani LCSEE, West Virginia University, Morgantown, WV {ksmani@csee.wvu.edu} 1 Problems 1. Solve the following recurrence using substitution:
More informationOutline. 1 Introduction. 3 Quicksort. 4 Analysis. 5 References. Idea. 1 Choose an element x and reorder the array as follows:
Outline Computer Science 331 Quicksort Mike Jacobson Department of Computer Science University of Calgary Lecture #28 1 Introduction 2 Randomized 3 Quicksort Deterministic Quicksort Randomized Quicksort
More informationarxiv:math/ v1 [math.pr] 21 Sep 2005
arxiv:math/050947v [math.pr] 2 Sep 2005 CONGRUENCE PROPERTIES OF DEPTHS IN SOME RANDOM TREES SVANTE JANSON Abstract. Consider a random recusive tree with n vertices. We show that the number of vertices
More informationA Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials
A Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials Daniel Minahan Ilya Volkovich August 15, 2016 Abstract The polynomial identity testing problem, or PIT, asks how we
More informationSingularity Analysis: A Perspective
MSRI, Berkeley, June 2004 Singularity Analysis: A Perspective Philippe Flajolet (Inria, France) Analysis of Algorithms Average-Case, Probabilistic Properties of Random Structures? Counting and asymptotics
More informationAsymptotic Enumeration of Compacted Binary Trees
Asymptotic Enumeration of Compacted Binary Trees Antoine Genitrini Bernhard Gittenberger Manuel Kauers Michael Wallner March 30, 207 Abstract A compacted tree is a graph created from a binary tree such
More informationThe range of tree-indexed random walk
The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université
More information50 years of Linear Probing Hashing
50 years of Linear Probing Hashing Alfredo Viola Universidad de la República, Uruguay AofA 2013 Dedicated to Philippe Flajolet The problem. The table has m places to hash (park) from 0 to m 1, and n elements
More informationFighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena.
Fighting Fish: enumerative properties Enrica Duchi IRIF, Université Paris Diderot Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena Gilles Schaeffer LIX, CNRS and École Polytechnique Séminaire
More informationRANDOM RECURSIVE TREES AND PREFERENTIAL ATTACHMENT TREES ARE RANDOM SPLIT TREES
RANDOM RECURSIVE TREES AND PREFERENTIAL ATTACHMENT TREES ARE RANDOM SPLIT TREES SVANTE JANSON Abstract. We consider linear preferential attachment trees, and show that they can be regarded as random split
More informationGAUSSIAN LAWS MICHÈLE SORIA. 8 october 2015 IHP Séminaire Flajolet IN ANALYTIC COMBINATORICS
GAUSSIAN LAWS IN ANALYTIC COMBINATORICS MICHÈLE SORIA 8 october 205 IHP Séminaire Flajolet / 43 Michèle Soria Gaussian Laws in Analytic Combinatorics Analytic Combinatorics Estimate properties of large
More informationMetric Diophantine Approximation for Formal Laurent Series over Finite Fields
Metric Diophantine Approximation for Formal Laurent Series over Finite Fields Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan Fq9, July 16th, 2009 Michael
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 informationOn the distribution of random walk hitting times in random trees.
On the distribution of random walk hitting times in random trees. Joubert Oosthuizen and Stephan Wagner Abstract The hitting time H xy between two vertices x and y of a graph is the average time that the
More informationConsidering our result for the sum and product of analytic functions, this means that for (a 0, a 1,..., a N ) C N+1, the polynomial.
Lecture 3 Usual complex functions MATH-GA 245.00 Complex Variables Polynomials. Construction f : z z is analytic on all of C since its real and imaginary parts satisfy the Cauchy-Riemann relations and
More informationSome Node Degree Properties of Series-Parallel Graphs Evolving Under a Stochastic Growth Model
Some Node Degree Properties of Series-Parallel Graphs Evolving Under a Stochastic Growth Model Hosam M. Mahmoud The George Washington University Washington, DC 20052, USA 24th International Meeting on
More informationAlgorithmic Tools for the Asymptotics of Linear Recurrences
Algorithmic Tools for the Asymptotics of Linear Recurrences Bruno Salvy Inria & ENS de Lyon aaacuxicbvhlbtraejw1r2beg+aghxhrsgitvjycahkhcc7cskqsibs2vunxez3jpjyznsli+rf4bq7wbfwknz6f8torzenli5wqutvtxvklhcmo+juirl2/cfpwxu3wzt179x8mnx9+cqa2hkbcsgmpm+zacg1tfcjhsllavcbhidt+3+khn8e6yfq+litifvtouqjo0fpz4epelmacmfmvbkzgpnfwes2hw9ekwhw9cujzslxz9ofeb0li7nxz8dxjda8vaossotelowrthlkuxeibjhih/m96gwwtijzhqcixbjtxevdtmnqoksap2qjmhmqmwkxn2cpds0eeymlhrh8a6yr9d6rhyrmlynynyli6da0j/6fnaixep43qvy2geb+oqcvfq7tt0vxy4cixhjbuhbdcecks4+gpgiywnjxyoxtt+yveftkurjby1kzq19wcksgxfx1/m/3sef2o/q5rucybdln2pk1pxjyvctd9lapqmhbugrxfjtf7cdp0g52v0ccyr+d1fuxftt5m4j2f5dvs1wz5qp6r5yqm22shfcc7zeo4+uk+ke/kr/a2yiiyoopbg8h5zcnyqql3bxdu3c8=
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 informationAverage Case Analysis of the Boyer-Moore Algorithm
Average Case Analysis of the Boyer-Moore Algorithm TSUNG-HSI TSAI Institute of Statistical Science Academia Sinica Taipei 115 Taiwan e-mail: chonghi@stat.sinica.edu.tw URL: http://www.stat.sinica.edu.tw/chonghi/stat.htm
More informationOn the number of unary-binary tree-like structures with restrictions on the unary height
On the number of unary-binary tree-like structures with restrictions on the unary height Olivier Bodini, Danièle Gardy, Bernhard Gittenberger, Zbigniew Gołębiewski, October 5, 205 Abstract We consider
More informationExtremal Statistics on Non-Crossing Configurations
Extremal Statistics on Non-Crossing Configurations Michael Drmota Anna de Mier Marc Noy Abstract We analye extremal statistics in non-crossing configurations on the n vertices of a convex polygon. We prove
More information25 Minimum bandwidth: Approximation via volume respecting embeddings
25 Minimum bandwidth: Approximation via volume respecting embeddings We continue the study of Volume respecting embeddings. In the last lecture, we motivated the use of volume respecting embeddings by
More informationBT Research at Martlesham, Suffolk
Connectivity of random graphs Keith Briggs Keith.Briggs@bt.com research.btexact.com/teralab/keithbriggs.html Alan Turing Institute 2004 November 19 1330 typeset 2004 November 17 10:55 in pdflatex on a
More informationOn finding a minimum spanning tree in a network with random weights
On finding a minimum spanning tree in a network with random weights Colin McDiarmid Department of Statistics University of Oxford Harold S. Stone IBM T.J. Watson Center 30 August 1996 Theodore Johnson
More informationAVERAGE-CASE ANALYSIS OF COUSINS IN m-ary TRIES
J. Appl. Prob. 45, 888 9 (28) Printed in England Applied Probability Trust 28 AVERAGE-CASE ANALYSIS OF COUSINS IN m-ary TRIES HOSAM M. MAHMOUD, The George Washington University MARK DANIEL WARD, Purdue
More informationLECTURE 7. 2 Simple trees and Lagrange Inversion Restricting the out-degree Lagrange Inversion... 4
Contents 1 Recursive specifications 1 1.1 Binary Trees B............................................ 1 1.1.1 A recursive structure.................................... 1.1. Decomposition........................................
More informationDISCRETE AND ALGEBRAIC STRUCTURES
DISCRETE AND ALGEBRAIC STRUCTURES Master Study Mathematics MAT.40 Winter Semester 015/016 & 016/17 (Due to organisational reasons register for the course at TU and KFU) Parts I & II Contents I Combinatorics
More informationarxiv: v1 [math.pr] 12 Jan 2017
Central limit theorem for the Horton-Strahler bifurcation ratio of general branch order Ken Yamamoto Department of Physics and arth Sciences, Faculty of Science, University of the Ryukyus, 1 Sembaru, Nishihara,
More informationA REFINED ENUMERATION OF p-ary LABELED TREES
Korean J. Math. 21 (2013), No. 4, pp. 495 502 http://dx.doi.org/10.11568/kjm.2013.21.4.495 A REFINED ENUMERATION OF p-ary LABELED TREES Seunghyun Seo and Heesung Shin Abstract. Let T n (p) be the set of
More informationCS161: Algorithm Design and Analysis Recitation Section 3 Stanford University Week of 29 January, Problem 3-1.
CS161: Algorithm Design and Analysis Recitation Section 3 Stanford University Week of 29 January, 2018 Problem 3-1. (Quicksort Median-of-3 Partition) One way to improve the randomized quicksort procedure
More informationA Note on the Approximation of Perpetuities
Discrete Mathematics and Theoretical Computer Science (subm.), by the authors, rev A Note on the Approximation of Perpetuities Margarete Knape and Ralph Neininger Department for Mathematics and Computer
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
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 informationIndependence and chromatic number (and random k-sat): Sparse Case. Dimitris Achlioptas Microsoft
Independence and chromatic number (and random k-sat): Sparse Case Dimitris Achlioptas Microsoft Random graphs W.h.p.: with probability that tends to 1 as n. Hamiltonian cycle Let τ 2 be the moment all
More informationFrom trees to seeds: on the inference of the seed from large trees in the uniform attachment model
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model Sébastien Bubeck Ronen Eldan Elchanan Mossel Miklós Z. Rácz October 20, 2014 Abstract We study the influence
More informationUNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.
UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next
More information