The Mean and Variance of the Numbers of r-pronged Nodes and r-caterpillars in Yule-Generated Genealogical
|
|
- Walter Gordon
- 5 years ago
- Views:
Transcription
1 Annals of Combinatoics 10 ( /06/ DOI /s c Bikhäuse Velag, Basel, 2006 Annals of Combinatoics The Mean and Vaiance of the Numbes of -Ponged Nodes and -Catepillas in Yule-Geneated Genealogical Tees Noah A. Rosenbeg Depatment of Human Genetics and Bioinfomatics Pogam, Univesity of Michigan, 2017 Palme Commons, 100 Washtenaw Ave, Ann Abo, MI , USA noah@umich.edu Received August 23, 2004 AMS Subject Classification: 05C05, 92D15 Abstact. The Yule model is a fequently-used evolutionay model that can be utilized to geneate andom genealogical tees. Unde this model, using a backwads counting method diffeing fom the appoach peviously employed by Head (Evolution 46: , fo a genealogical tee of n lineages, the mean numbe of nodes with exactly descendants is computed (2 n 1. The vaiance of the numbe of -ponged nodes is also obtained, as ae the mean and vaiance of the numbe of -catepillas. These esults genealize computations of McKenzie and Steel fo the case of 2 (Math. Biosci. 164: 81-92, Fo a given n, the two means ae lagest at 2, equaling 2n/3 fo n 5. Howeve, fo n 9, the vaiances ae lagest at 3, equaling 23n/420 fo n 7. As n, the faction of intenal nodes that ae -catepillas fo some appoaches (e 2 5/ Keywods: binay seach tee, cheies, coalescent, genealogy, labeled topology, pectinate 1. Intoduction In many contexts in evolutionay biology, it is of inteest to investigate the pobability distibutions of vaious attibutes of genealogical tees. Fist, pedictions about these distibutions can be made using models of the evolutionay pocess that poduces the tees. These pedictions can then be helpful in undestanding which scenaios ae possible o likely outcomes of evolution [2,5,16,22,26,29]. By compaison with estimates made fom biological data, they can also povide insight into the natue of the pocesses that geneate the data [9, 19, 20, 23, 34]. Pehaps the simplest evolutionay model fom which pedictions about genealogical tees can be made is the Yule o Yule-Hading model [4, 12, 31, 35, 36, 39]. Unde this model, beginning with an ancestal lineage, the genealogical tee fo n lineages is fomed by successive binay banching events, so that at any point in time, all lineages have equal pobability of being the next to banch into two. Equivalently, looking 129
2 130 N.A. Rosenbeg backwads fom n lineages in the pesent, at any time point, all pais of lineages have equal pobability of being the next to coalesce into one. This etospective viewpoint is typically adopted in population genetics, whee the Yule model is used with each lineage coesponding to a distinct copy of a paticula genetic site (taken fom a set of such copies in a population of individuals. In this context, when combined with a specific model fo the times at which coalescences occu, the Yule model is temed the coalescent model [14, 15, 24, 38]. Hee, using a backwads counting appoach, we extend known popeties of genealogical tees unde the Yule model to obtain the mean and vaiance of the numbe of nodes with exactly descendants among the n lineages (2 n 1. These quantities then enable computation of the mean and vaiance of the numbe of -catepillas in genealogical tees. 2. Definitions The definitions used hee ae lagely based on those of Semple and Steel [32]; Figue 1 illustates many of the key concepts. A genealogical tee o genealogy G (G, X, ψ, t fo n leaves is a ooted binay tee G fo which (1 ψ is a bijection that associates each leaf of G with a label in a label set X, and (2 t is a map that associates each point p of G (that is, each vetex and each point lying on an edge with a nonnegative eal numbe t(p, such that (i fo any two distinct points p 1, p 2, if the path fom p 1 to the oot of G includes p 2, then t(p 1 < t(p 2 ; (ii fo any two distinct inteio vetices v 1, v 2, t(v 1 t(v 2 ; (iii fo a point p, t(p 0 if and only if p is a leaf of G. If the path fom a point p 1 to the oot includes p 2, then p 1 is descended fom p 2, which, in tun, is ancestal to p 1. Tivially, a point is both ancestal to and descended fom itself (howeve, the point itself is not included when counting its numbe of descendants. Fo convenience the label set X is taken to be {x 1, x 2,..., x n }. Inteio vetices ae altenately temed intenal nodes (it is assumed in a genealogy that each intenal node has exactly two descendants. The value of t(p fo a point p is the time of p. Thus, the leaves of genealogies ae viewed as existing in the pesent, with time inceasing into the past. The lineage of a point p at time u t(p is the unique point that is both ancestal to p and has time u; this time is usually 0 in uses of the tem. The most ecent common ancesto (MRCA of a subtee G of G (o a subset X X is the node with the smallest time among the collection of nodes that ae ancestal to all elements of G (o to the collection of leaves with label set X. Let t(g be the set of values taken by t ove all intenal nodes of G. Let h be the unique bijection fom t(g into {1, 2,..., n 1} with the popety that fo any two vetices v 1, v 2, if t(v 1 < t(v 2, then h(v 1 < h(v 2. The coalescence sequence o labeled histoy of G is the sequence of patitions π 0, π 1,..., π n 1 of X such that π 0 (G {{x 1 }, {x 2 },..., {x n }} and fo i 1, 2,..., n 1, π i (G is fomed fom π i 1 (G by combining the two blocks in π i 1 (G containing leaves descended fom the vetex h 1 (i into the same block in π i (G. The labeled histoy of G epesents the sequence of events that educe the n leaves to thei MRCA; h 1 (i coesponds to the ith coalescence o coalescent event. The k-tuncated coalescence sequence o k-tuncated labeled histoy of G (1 k n is the sequence π 0, π 1,..., π n k.
3 -Ponged Nodes and -Catepillas in Genealogical Tees 131 i ii iii iv v vi Time Figue 1: Example genealogies with the label set {1, 2, 3, 4, 5, 6}. Genealogies (i (v all have the same unlabeled topology. In compaison with (i, (ii has the same unlabeled histoy and labeled topology, but a diffeent labeled histoy; (iii has the same labeled topology, but diffeent labeled and unlabeled histoies; (iv has the same unlabeled histoy, but a diffeent labeled histoy and labeled topology; (v has diffeent labeled and unlabeled histoies and a diffeent labeled topology. Genealogy (vi has diffeent labeled and unlabeled histoies and topologies fom the emaining genealogies. It is a 6-catepilla and is the only one of the genealogies to contain a pitchfok. Genealogies (i (v all contain a symmetic 4-ponged node; the 4-ponged node in (vi is not symmetic. Thee ae thee cheies in each of (i (v and one chey in (vi. The unlabeled histoy of G is a paticula sequence of patitions π 0, π 1,..., π n 1 of X obtained in the following manne. We begin with a set of available labels, A {1, 2,..., n}, and we equate B A and π 0 π 0. Sequentially, fo i 1, if one of the blocks in π i (G containing leaves descended fom h 1 (i includes only one leaf, we then eassign the label of that leaf as the label b with the smallest value among those in B, and eplace B with B \ {b} (if both blocks each include only one leaf, eassign the labels of both leaves the ode in which the two eassignments ae made is unimpotant. We epeat this pocedue until each leaf v has been assigned a label γ(v fom A. The unlabeled histoy of G is then the labeled histoy of G (G, A, γ, t. The labeled topology of G is the tee G with label set X and labeling γ, ignoing the time function t. The unlabeled topology of G is the tee G, ignoing the label set X, the labeling γ and the time t. The subgenealogy G v of G induced by an intenal node v is the genealogy (G v, X v, ψ G v, t G v, whee G v is the subtee of G containing all leaves that descend fom v, X v is the label set fo G v, and ψ G v and t G v denote the estictions of ψ and t to G v, espectively. An intenal node v of G o its induced subgenealogy is -ponged (2 n if the subgenealogy contains exactly descendants among the leaves of G; the node (o subgenealogy is an -catepilla if G v contains exactly descendants among the leaves of G, and if the intenal node with the smallest value of t among all intenal nodes in G v is descended fom all othe intenal nodes in G v. A genealogy whose oot is an -catepilla is temed pectinate. As special cases, 2-ponged and 3-ponged intenal nodes (o thei induced subgenealogies ae temed cheies and pitchfoks, espectively. Both cheies and pitchfoks ae necessaily catepillas. Fo a genealogy G, d (G is the numbe of -ponged nodes in G. An intenal node with moe than two descendants in X is symmetic if the two subgenealogies induced by its two immediate descendants have the same unlabeled topology. Fo a genealogy G, s(g is its numbe of symmetic intenal nodes. The functions d and s can be applied also to labeled o unlabeled histoies o topologies.
4 132 N.A. Rosenbeg 3. The Yule Model This section eviews popeties of genealogical tees geneated by the Yule model (Yulegeneated genealogies. A Yule-geneated genealogy has the popety that at any time, each pai of lineages is equally likely to be the next to coalesce (o equivalently, evesing the diection of time, each lineage is equally likely to be the next to divide. It follows diectly fom this popety that the pobability distibution of the labeled histoy of such a genealogy is unifom. In this section and in those that follow, G (G, X, ψ, t is teated as a andom n- leaved Yule-geneated genealogy, and genealogy implicitly efes to the Yulegeneated genealogy G. Hencefoth, a 1, a 2, a 3, i, k, n, n 1, n 2, n 3, and ae assumed to be positive integes with n 3, 2, and except whee othewise specified, i n 1 and k n. It is assumed in each of (3.1 (3.5 that T is chosen fom the appopiate set of objects to which the esult applies (fo example, in Theoem 3.3, the collection of possible labeled topologies fo the label set X. Except fo (3.3 and (3.4, which ae included fo completeness, the esults in this section ae used in poving the new esults in the following sections; othe than (3.8 and (3.9, they utilize the unifom distibution of labeled histoies fo Yule-geneated genealogies. Theoem 3.1. [4, 30] The pobability I(T that a genealogy fo n lineages has k- tuncated labeled histoy T is I(T 1 2n k k!(k 1!. I n,k n!(n 1! Coollay 3.2. [8,21] The pobability H(T that a genealogy fo n lineages has labeled histoy T is H(T 1 H n 2n 1 n!(n 1!. Theoem 3.3. [1, 4, 35] The pobability L(T that a genealogy fo n lineages has labeled topology T is 2 n 1 L(T n! n 3 ( 1d (T. Theoem 3.4. [25, 38] The pobability U(T that a genealogy fo n lineages has unlabeled histoy T is U(T 2n 1 d 2(T (n 1!. Theoem 3.5. [4, 36] The pobability Q(T that a genealogy fo n lineages has unlabeled topology T is Q(T 2n 1 d 2(T s(t n 3 ( 1d (T.
5 -Ponged Nodes and -Catepillas in Genealogical Tees 133 Coollay 3.6. [33, 37] The pobability Q(T that a genealogy fo n lineages has unlabeled topology T, whee T is pectinate, is Q(T 2n 2 (n 1!. Theoem 3.7. [34, 38] In a genealogy fo n lineages, the pobability C n that the two nodes immediately descended fom the oot have i and n i descendants is C 1n 1/(n 1, if i n/2 and n is even, C 2n 2/(n 1, if i n/2 and i {1, 2,..., n 1}. Theoem 3.8. [4, 30] The numbe W a1,a 2 of (n a 1 a 2 -tuncated coalescence sequences possible fo a fixed collection of n n 1 +n 2 labels (with n 1 a 1, n 2 a 2, such that each coalescence sequence contains two specified subsequences, one of length a 1 that coalesces n 1 lineages to n 1 a 1 and anothe of length a 2 that coalesces the emaining n 2 lineages to n 2 a 2, is the binomial coefficient ( a1 + a 2 W a1,a 2. Theoem 3.9. [30] The numbe W a1,a 2,a 3 of (n a 1 a 2 a 3 -tuncated coalescence sequences possible fo a fixed collection of n n 1 + n 2 + n 3 labels (with n 1 a 1, n 2 a 2, n 3 a 3, such that each coalescence sequence contains thee specified subsequences, one of length a 1 that coalesces n 1 lineages to n 1 a 1, one of length a 2 that coalesces n 2 lineages to n 2 a 2, and the thid of length a 3 that coalesces the emaining n 3 lineages to n 3 a 3, is the tinomial coefficient ( a1 + a 2 + a 3 W a1,a 2,a 3. a 1, a 2, a 3 Remak A coespondence exists between Yule-geneated genealogies with n leaves and the entities geneated duing constuction of andom binay seach tees with n 1 vetices (leaves plus intenal nodes. A andom binay seach tee is obtained via sequential addition of descendant vetices to a ooted binay tee so that each vetex with one descendant has anothe slot in which a descendant can be added, and each vetex with no descendants has two slots in which descendants can be added (inteio vetices in binay seach tees ae allowed to have eithe 1 o 2 descendants. At any time (evesing the diection of time, all potential slots fo insetion of vetices ae equally likely to be the next to have a vetex added [17, pp ]. The coesponding binay seach tee fo a given Yule-geneated genealogy G (G, X, ψ, t is the pai (G b, t G b, whee G b is the subtee of G containing only the intenal nodes of G and the edges that connect them, and t G b is the estiction of t to G b. 4. The Numbe of -Ponged Nodes Afte poving thee combinatoial identities as Lemmas 4.1, 4.2, and 4.3, the mean and vaiance of the numbe of -ponged nodes in a Yule-geneated genealogy ae obtained a 1
6 134 N.A. Rosenbeg in Theoem 4.4, and the popeties of the vaiance function ae then examined in Theoem 4.8. The mean had peviously been obtained in [13] using a Polya un method, and the mean and vaiance wee both calculated fo the case of 2 in [18]. Related poblems have also been consideed in [10]. Because of the coespondence between Yule-geneated genealogies and andom binay seach tees, many esults deived in the context of binay seach tees [6, 7, 17] can be intepeted as statements about Yule-geneated genealogies. Fo example, using the fact that a node with descendant nodes in a binay seach tee has +2 descendants among the leaves of the coesponding Yule-geneated genealogy, Theoem 4.4 (i and the < n/2 case of Theoem 4.4 (ii ae demonstated (via diffeent poofs fom the ones hee in [6, Theoem 5], which futhe obtains a limiting distibution in n fo the numbe of -ponged nodes (see also [3]. Lemma 4.1. Fo positive integes n and with n 3, 2, n, ( ( ( k + 1 n k 2 n n k1 Poof. The identity follows fom [11, Identity 3.3], a statement staightfowad to pove using induction on m, m s lq ( l q ( m l s ( m + 1, q + s + 1 substituting k + 1 fo l, 2 fo q, 2 fo s, and n 1 fo m. Lemma 4.2. Fo positive integes n,, and i, with n 2 1, i, 2, n 2 j1 ( ( ( ( j + 1 i + j + 1 n 2 i j n i j 2 j 2 i (i + 2[(i + 3n (i + 12 (i 1] 2(n 2 1 ( ( 2 i 2 n. ( Poof. Set w n 2 and denote the atio of the summand in Equation 4.1 to the ight-hand side by F(w, j: F(w, j ( j+1 ( i+ j+1 ( 2+w 2 i j ( +w i j 2 j 2 i ( 2 i 2 ( 2+w Togethe with the poof cetificate R(w, j 2(2 + w + 1 (i + 2[4 + (i + 3w (i 1]. ( j 1(2 + w 1 i j(4 + 2w 2i + 2 j + 4 j + 3 jw + i jw, ( j + 1(w + 1 j(2 + w + 1(4 + 3w iw F(w, j satisfies the hypotheses of the Wilf-Zeilbege automatic summation theoem [27, Theoem 7.1.1], fom which it follows that w j1 F(w, j is not dependent on w. Because F(w, j 1 when w 1, the esult follows. w j1
7 -Ponged Nodes and -Catepillas in Genealogical Tees 135 Lemma 4.3. Fo positive integes n and with n 3, 2, n, ( (i + 2[(i + 3n (i + 12 (i 1] 2 i 2 2(n i n + 8n 2 4( + 1(2 1(2 + 1 ( n ( ( n. ( Poof. Adding tems fo i 0 and i 1 to both sides of Equation 4.2 and setting u i, the statement we wish to pove is equivalent to ( ( ( u + c u + c u + c α 1 u 2 + α 2 u + α ( + 5n + 7n , u0 u u u whee c 2, α 1 n 2 1, α n 2n +1, and α 3 ( +2( n + n + 1. But this identity follows by setting c 2 in the following thee identities concening nonnegative integes and c: u0 u u0 ( u + c u ( u + c u ( u + c u 2 u0 u ( + c + 1 (c + 1 c + 2 ( + c + 1 (c + 1(2 + c + 1 (c + 2(c + 3 ( + c + 1 Each of equations is staightfowad to pove by induction on. Theoem 4.4. In a genealogy fo n 3 lineages, if 2 n 1, (i [13] the mean numbe of -ponged nodes, M(n,, is 2n ( + 1, (ii the vaiance of the numbe of -ponged nodes, V(n,, is (4.3 (4.4. (4.5 V 1 (n, 2(42 3 4( 1n ( + 1 2, if < n/2, (4.6 (2 1(2 + 1 V 2 (n, (5 7( 1n ( + 1 2, if n/2, (4.7 (2 1 V 3 (n, 2(2 + 2nn 2 ( + 1 2, if > n/2. (4.8 Poof. Enumeate the ( n subsets of the label set that contain elements, denoting the bth such subset by S b. Let Z b be the indicato vaiable fo whethe thee is some intenal
8 136 N.A. Rosenbeg node of the genealogy fo which S b is the label set of its induced subgenealogy. The numbe of -ponged nodes in the genealogy is Z ( n b1 Z b. (i The mean numbe of -ponged nodes in the genealogy is M(n, E[Z] ( n b1 E[Z b ] ( n E[Z 1 ] ( n P[Z 1 1]. P[Z 1 1] can be detemined by counting the faction of coalescence sequences fo which S 1 has MRCA at an -ponged node (Figue 2. In such a sequence, at the time just less than that of the -ponged node, the lineages with labels in S 1 have coalesced to 2 lineages and the n lineages with labels in X \ S 1 have coalesced to k lineages (1 k n. The next coalescence event is the -ponged node. The emaining k +1 lineages coalesce to the MRCA fo X. Thus, applying Theoem 3.1, Coollay 3.2, and Theoem 3.8, the numbe of coalescence sequences in which S 1 has MRCA at an -ponged node is k1 n I,2I n,k W 2,n k H k+1. Consequently, using Lemma 4.1, M(n, ( n 1 n H n k1 2(n 1!( 1! (n 1! I,2 I n,k W 2,n k H k+1 n k1 ( ( k + 1 n k n ( + 1. (4.9 (ii The vaiance of the numbe of -ponged nodes is [( ( n V(n, E [ ( n E 2 ] Z b E b1 [ ( n ] Z b E b1 [ ( n ] 2 Z b b1 ] 2 Z b + E b1 [ ( n Z b Z b b,b b b [ ( n ] M(n, M(n, 2 + E Z b Z b. (4.10 b,b b b Case 1. < n/2. If S b S b φ, then E[Z b Z b ] 0. Fo all disjoint S b and S b, E[Z b Z b ] P[Z b Z b 1] has the same value. The numbe of odeed pais (S b, S b fo which S b, S b X and S b S b φ is 2 ( ( n n. Theefoe, supposing that (S1, S 2 is such a pai, [ ( n ] ( ( n n E Z b Z b 2 P[Z 1 Z 2 1]. (4.11 b,b b b ]
9 -Ponged Nodes and -Catepillas in Genealogical Tees k Time n- S X \ S 1 1 Figue 2: Counting the faction of coalescence sequences fo which S 1 has MRCA at an -ponged node. Using Theoem 3.1, the numbe of ways that lineages can coalesce to 2 lineages is I,2, and fo 1 k n, the numbe of ways that n lineages can coalesce to k lineages is I n,k. By Theoem 3.8, the numbe of ways of inteweaving these sequences of 2 and n k coalescences is W 2,n k. By Coollay 3.2, the numbe of ways that k + 1 lineages can coalesce to 1 lineage is H k+1. Consequently, the total numbe of coalescence sequences fo which S 1 has MRCA at an -ponged node is k1 n I,2I n,k W 2,n k H k+1. By Coollay 3.2, the total numbe of coalescence sequences fo n lineages is H n. Thus, the desied quantity is (1/H n k1 n I,2I n,k W 2,n k H k+1. 2 l i 2 j Time n-2 S S X \ {S U S } Figue 3: Counting the faction of coalescence sequences fo which both S 1 and S 2 ae label sets fo subgenealogies, with the time of the MRCA of S 1 smalle than that of S 2. Using Theoem 3.1, the numbe of ways that lineages can coalesce to 2 lineages is I,2 ; fo 2 i, the numbe of ways that lineages can coalesce to i lineages is I,i ; fo 1 j n 2, the numbe of ways that n 2 lineages can coalesce to j lineages is I n 2, j. By Theoem 3.9, the numbe of ways of inteweaving these sequences of 2, i and n 2 j coalescences is W 2, i,n 2 j. Counting the numbe of ways that the emaining lineages can coalesce so that S 2 is the label set fo an induced subgenealogy follows the same agument as in Figue 2.
10 138 N.A. Rosenbeg In ode to have Z 1 Z 2 1, both S 1 and S 2 must be label sets fo subgenealogies. Without loss of geneality, suppose that the time of the MRCA of S 1 is less than that of S 2. P[Z 1 Z 2 1] can be detemined by counting the faction of coalescence sequences fo which S 1 and S 2 ae the label sets fo induced subgenealogies (Figue 3. At the time just less than that of the MRCA of S 1, the lineages with labels in S 2 have coalesced to i lineages (2 i, and the n 2 lineages with labels in X \ {S 1 S 2 } have coalesced to j lineages (1 j n 2. The next coalescence poduces the -ponged node fo which S 1 is the label set of the induced subgenealogy. At the time just less than that of the MRCA of S 2, the emaining i lineages ancestal to S 2 have coalesced to 2 lineages, and the emaining j + 1 lineages ancestal to X \ S 2 have coalesced to l lineages (1 l j. The next coalescence poduces the -ponged node fo which S 2 is the induced subgenealogy. Finally, the emaining l + 1 lineages ancestal to X coalesce to 1 lineage. The total numbe of possible coalescence sequences fo all n lineages with labels in X is H n. Using Theoem 3.1, Coollay 3.2 and Theoems 3.8 and 3.9, P[Z 1 Z 2 1] i2 n 2 j1 Simplifying this expession and using Equation 4.11, [ ( n ] E Z b Z b b,b b b 8( 1! 2 (n 2 1! i2 j+1 I,2 I,i I n 2, j W 2, i,n 2 j I i,2 I j+1,l W i 2, j+1 l H l+1 l1. H n n 2 j1 j+1 l1 ( j+1 2 (n 1! ( l+1 2 ( i+ j l 1 i 2 ( n 2 i j 2 ( n i j i Sequentially applying Lemmas 4.1, 4.2, and 4.3 to sum ove indices l, j and i, [ ( n ] E Z b Z b 2( n + 8n 2 n b,b 2 ( (2 1(2 + 1, b b and the esult follows fom Equation Case 2. n/2. In this case, a genealogy can have eithe zeo o two -ponged nodes, so that Z b 1 fo eithe zeo o two values of b. Consequently, the sum in Equation 4.10 can have eithe no tems equal to 1, o exactly two tems equal to 1: [ ( n ] [ ( n ] E Z b Z b 2P Z b Z b 2. b,b b b,b b b b A genealogy can have two distinct sets each with n/2 labels and each with MRCA at an -ponged node if and only if the two sets ae disjoint and both -ponged nodes.
11 -Ponged Nodes and -Catepillas in Genealogical Tees 139 Vaiance of the numbe of -ponged nodes n Numbe of descendants ( Figue 4: The vaiance V(n, of the numbe of -ponged nodes fo n 50. ae immediately descended fom the oot. By Theoem 3.7, the pobability of having two such nodes is 1/(n 1. Theefoe, using Equation 4.10, V(n, and the esult follows using n 2. 2n ( + 1 ( + 1 2n + 2 ( + 1 n 1, Case 3. > n/2. In this case, at most one set of labels can be the label set of an induced subgenealogy, so that fo any distinct b, b, Z b Z b 0. The esult then follows fom Equation Coollay 4.5. [18] In a genealogy fo n 5 lineages, the mean numbe of cheies is n/3 and the vaiance of the numbe of cheies is 2n/45. Coollay 4.6. In a genealogy fo n 7 lineages, the mean numbe of pitchfoks is n/6 and the vaiance of the numbe of pitchfoks is 23n/420. Remak 4.7. Fo a given n, the mean numbe of -ponged nodes is lagest fo 2, and declines monotonically as inceases. The vaiance, howeve, exhibits a moe complicated patten. Figue 4 displays a typical example, namely n 50. The global maximum of V(50, occus at 3 athe than at 2, and the decline afte 3 is inteupted by a small peak at 50/2 25. The following theoem summaizes the geneal shape of V (n, as a function of.
12 140 N.A. Rosenbeg Theoem 4.8. Fo a fixed n 15 as well as fo n 11, 13, as anges ove integes fom 2 to n 1, (i the fou highest values of V (n, ae, fom geatest to smallest, at 3, 4, 2, and 5; (ii fo 3 n 2, V(n, > V(n, + 1, unless n is even and + 1 n/2, in which case V(n, < V(n, + 1. Poof. We will need the following six inequalities, each of which is staightfowad to pove fom Equations using elementay methods. (a Fo integes n, with n 3 and 2 n 1, V 2 (n, > V 1 (n, > V 3 (n,. (b Fo integes n, with n 3 and 3 n 1, V 1 (n, > V 1 (n, + 1. (c Fo positive n, V 1 (n, 3 > V 1 (n, 4 > V 1 (n, 2 > V 1 (n, 5. (d Fo even integes n 12, V 1 (n, 5 > V 2 (n, n/2. (e Fo integes n, with n 10 and n/2 < n 1, V 3 (n, > V 3 (n, + 1. (f Fo even integes n 16, V 2 (n, n/2 > V 1 (n, n/2 1. Using (b and (c, V 1 has its fou highest values at 3, 4, 2, and 5, espectively. Fo n 11, V(n, 5 V 1 (n, 5. By (a and (b, V 1 (n, 5 > V 3 (n, fo all integes n, with n 11, n/2 < < n. Applying (d, it follows that fo n 11, (i holds. Using (a and (b, V 1 (n, n/2 1 >V 3 (n, n/2+1. Fo n 3, V(n, V 1 (n, fo 2 n/2 1 and V(n, V 3 (n, fo n/2 + 1 n 1. Applying (a, (b, and (e, (ii holds fo odd n > 10. Fo even n it must also be veified that V(n, < V(n, + 1 fo + 1 n/2; this follows fom (f, but only fo n 16. Remak 4.9. The theoem shows that fo lage enough n, the vaiance follows a paticula patten as a function of. Fo vey lage, the vaiance appoaches 2n/ 2, povided n emains lage than 2 (2.5n/ 2 if n 2. Fo lage n, stating with 2, V(n, /n follows the sequence 2/45, 23/420, 8/175, 2/55, 610/21021, 171/ At small n (n 14, howeve, the behavio of the vaiance function can diffe fom that specified by the theoem (Figue The Numbe of -Catepillas The mean and vaiance of the numbe of -ponged nodes can be used to obtain the mean and vaiance of the numbe of subgenealogies with any given unlabeled topology. Theoem 5.1 gives the geneal fomulas fo an abitay unlabeled topology T ; the case of a pectinate T is consideed in Coollay 5.2, and the popeties of the vaiance function ae then exploed in Theoem 5.4. Theoem 4.4, Theoem 5.1, and Coollay 5.2 can all be consideed genealizations of the fomulas of [18] fo the mean and vaiance of the numbe of cheies. Theoem 5.1. In a genealogy with n 3 lineages, if 2 n 1 and T is an unlabeled topology with leaves, (i the mean numbe of nodes that have induced subgenealogy T, M T (n,, is Q(T M(n,, and (ii the vaiance of the numbe of nodes that have induced subgenealogy T, V T (n,, is V T (n, Q(T [1 Q(T ]M(n, + Q(T 2 V(n,.
13 -Ponged Nodes and -Catepillas in Genealogical Tees 141 Vaiance of the numbe of -ponged nodes n16 n15 n14 n13 n12 n11 n10 n9 n8 n7 n6 n5 n Numbe of descendants ( Figue 5: The vaiance V(n, of the numbe of -ponged nodes fo n 4 though 16. Fo n 3, V(3, 2 0. Poof. Let Y b be the indicato vaiable fo whethe thee is some intenal node of the genealogy fo which both (a S b is the label set of its induced subgenealogy, and (b this induced subgenealogy has unlabeled topology T. The numbe of nodes whose induced subgenealogies have unlabeled topology T is ( n Y Y b. b1 Note that if Z b 0, then Y b 0. Applying Theoem 3.5, if Z b 1, then Y b 1 with pobability Q(T. (i The mean numbe of nodes that have induced subgenealogy T is M T (n, E[Y ] ( n b1 ( n b1 P[Z b 0]E[Y b Z b 0] + P[Z b 1]E[Y b Z b 1] Q(T P[Z b 1] Q(T M(n,. (ii Using the conditional vaiance fomula [28, p. 138] with the fact that a Benoulli
14 142 N.A. Rosenbeg 3 Vaiance of the numbe of -catepillas 2.7 n Numbe of descendants ( Figue 6: The vaiance V cat (n, of the numbe of -catepillas fo n 50. andom vaiable with paamete Q(T has vaiance Q(T [1 Q(T ], V T (n, Va[Y] E[Va[Y Z]] +Va[E[Y Z]] E[Q(T [1 Q(T ]Z] +Va[Q(T Z] Q(T [1 Q(T ]M(n, + Q(T 2 V(n,. Coollay 5.2. In a genealogy with n 3 lineages, if 2 n 1, then (i the mean numbe of -catepillas, M cat (n,, is 2 1 n ( + 1!, and (ii the vaiance of the numbe of -catepillas, V cat (n,, is V 1cat (n, 2 1 n[(2 1(2 + 1( + 1! ( ] ( + 1! 2, if < n/2, (2 1(2 + 1 V 2cat (n, 2 1 n[(2 1( + 1! ( ] ( + 1! 2, if n/2, (2 1 V 3cat (n, 2 1 n[( + 1! 2 1 n] ( + 1! 2, if > n/2.
15 -Ponged Nodes and -Catepillas in Genealogical Tees Vaiance of the numbe of -catepillas n16 n15 n14 n13 n12 n11 n10 n9 n8 n7 n6 n5 n Numbe of descendants ( Figue 7: The vaiance V cat (n, of the numbe of -catepillas fo n 4 though 16. Fo n 3, V(3, 2 0. Poof. Applying Coollay 3.6, Q(T 2 2 /( 1! if T is pectinate. Inseting this quantity along with the values of M(n, and V(n, fom Theoem 4.4 into Theoem 5.1, the esult follows. Remak 5.3. Similaly to the case of -ponged nodes, the mean numbe of -catepillas is lagest fo 2, and the vaiance is lagest at 3. Figue 6 displays V cat (50, as a function of. In the case of catepillas, unlike the -ponged node case, the monotonic decline in vaiance afte 3 is not inteupted at n/2, as is demonstated in the following theoem. Theoem 5.4. Fo a fixed n 11 as well as fo n 6, 7, 9, 10, as anges ove integes fom 2 to n 1, (i the fou highest values of V cat (n, ae fom geatest to smallest, at 3, 2, 4, and 5; (ii fo 3 n 2, V cat (n, > V cat (n, + 1. Poof. The cases of n 6, 7, 9, 10 can be veified fom Coollay 5.2 (ii by diect computation. Fo n 11 the poof follows fom the following six inequalities: (a, (b, and (e ae easily poven fom the coesponding statements in the poof of Theoem 5.4, and (c, (d and (f ae staightfowad using elementay methods. (a Fo integes n, with n 3 and 2 n 1, V 2cat (n, > V 1cat (n, > V 3cat (n,, (b Fo integes n, with n 3 and 3 n 1, V 1cat (n, > V 1cat (n, + 1, (c Fo positive n, V 1cat (n, 3 > V 1cat (n, 2 > V 1cat (n, 4 > V 1cat (n, 5, (d Fo even integes n 12, V 1cat (n, 5 > V 2cat (n, n/2,
16 144 N.A. Rosenbeg (e Fo integes n, with n 10 and n/2 < n 1, V 3cat (n, > V 3cat (n, + 1, (f Fo even integes n 8, V 2cat (n, n/2 < V 1cat (n, n/2 1. The poof of (i uses (a, (b, (c, and (d, and follows that of Theoem 4.8 (i, except that the positions of V 1cat (2, and V 1cat (4, ae evesed. The poof of (ii uses (a, (b, (e and (f and follows that of Theoem 4.8 (ii, except that the diection of (f guaantees V cat (n, > V cat (n, + 1 at + 1 n/2 fo even n. Remak 5.5. Fo lage elative to n, a genealogy is likely to contain at most one - catepilla, and V cat appoaches M cat. Fo lage n, with 2, V cat (n, /n follows the sequence 2/45, 23/420, 67/1575, 364/19305, 28466/ , 823/ At small n (n 8, howeve, as in the case of -ponged nodes, the behavio of the vaiance can diffe fom that specified by the theoem (Figue 7. It is inteesting to compae the mean and vaiance of the numbe of -ponged nodes with those of the numbe of -catepillas. Fo 2 and 3, an -ponged node is necessaily a catepilla, and the numbes of -ponged nodes and -catepillas in a genealogy ae equal. Fo 4, an -ponged node need not be an -catepilla, and consequently, the mean numbe of -catepillas is stictly less than the mean numbe of -ponged nodes. Fo 4, as can be veified by elementay compaison of the fomulas in Theoem 4.4 and Coollay 5.2, the vaiance of the numbe of -catepillas is stictly less than the vaiance of the numbe of -ponged nodes, with two exceptions: fo (n, (6, 4, both vaiances equal 6/25, and fo (n, (7, 4, the vaiance of the numbe of catepillas equals 56/225, while the vaiance of the numbe of -ponged nodes equals only 21/100. Summing ove all, each intenal node is -ponged fo one value of, and the mean total numbe of -ponged nodes (not counting the oot is 2 n 1 2n/[( + 1] n 2, as it should. The mean numbe of catepillas intenal nodes (not counting the oot that ae -catepillas fo some is 2 n n/( + 1!. As a faction of n, this sum has a lage-n limit of (e 2 5/ ; thus, fo lage Yule-geneated genealogies, on aveage 60% of subgenealogies ae pectinate. Acknowledgments. I thank the efeees fo caeful eadings of the manuscipt. This wok was suppoted by a National Science Foundation Postdoctoal Fellowship in Biological Infomatics and by a Buoughs Wellcome Fund Caee Awad in the Biomedical Sciences. Refeences 1. D. Aldous, Pobability distibutions on cladogams, In: Discete Random Stuctues, D. Aldous and R. Pemantle, Eds., Spinge-Velag, New Yok, (1996 pp D.J. Aldous, Stochastic models and desciptive statistics fo phylogenetic tees, fom Yule to today, Statist. Sci. 16 ( M.G.B. Blum and O. Fançois, On statistical tests of phylogenetic tee imbalance: the Sackin and othe indices evisited, Math. Biosci. 195 ( J.K.M. Bown, Pobabilities of evolutionay tees, Syst. Biol. 43 ( J.H. Degnan and L.A. Salte, Gene tee distibutions unde the coalescent pocess, Evolution 59 (
17 -Ponged Nodes and -Catepillas in Genealogical Tees L. Devoye, Limit laws fo local countes in andom binay seach tees, Random Stuctues Algoithms 2 ( L. Devoye, Limit laws fo sums of functions of subtees of andom binay seach tees, SIAM J. Comput. 32 ( A.W.F. Edwads, Estimation of the banch points of a banching diffusion pocess, J. Roy. Statist. Soc. Se. B 32 ( J. Felsenstein. Infeing Phylogenies, Sinaue, Sundeland, MA, Y.X. Fu, Statistical popeties of segegating sites, Theo. Pop. Biol. 48 ( H.W. Gould, Combinatoial Identities, Gould Publications, Mogantown, WV, E.F. Hading, The pobabilities of ooted tee-shapes geneated by andom bifucation, Adv. Appl. Pobab. 3 ( S.B. Head, Pattens in tee balance among cladistic, phenetic, and andomly geneated phylogenetic tees, Evolution 46 ( R.R. Hudson, Gene genealogies and the coalescent pocess, Oxf. Suv. Evol. Biol. 7 ( J.F.C. Kingman, On the genealogy of lage populations, J. Appl. Pobab. 19A ( W.P. Maddison and M. Slatkin, Null models fo the numbe of evolutionay steps in a chaacte on a phylogenetic tee, Evolution 45 ( H.M. Mahmoud, Evolution of Random Seach Tees, Wiley, New Yok, A. McKenzie and M. Steel, Distibutions of cheies fo two models of tees, Math. Biosci. 164 ( A.O. Mooes and S.B. Head, Evolutionay pocess fom phylogenetic tee shape, Quat. Rev. Biol. 72 ( A.O. Mooes and S.B. Head, Using tee shape, Syst. Biol. 51 ( F. Mutagh, Counting dendogams: a suvey, Discete Appl. Math. 7 ( J.E. Neigel and J.C. Avise, Phylogenetic elationships of mitochondial DNA unde vaious demogaphic models of speciation, In: Evolutionay Pocesses and Theoy, S. Kalin and E. Nevo, Eds., Academic Pess, New Yok, (1986 pp M. Nodbog, On the pobability of Neandethal ancesty, Ame. J. Hum. Genetics 63 ( M. Nodbog, Coalescent theoy, In: Handbook of Statistical Genetics, Chapte 7, D.J. Balding, M. Bishop, and C. Cannings, Eds., Wiley, Chicheste, UK, (2001 pp R.D.M. Page, Random dendogams and null hypotheses in cladistic biogeogaphy, Syst. Zool. 40 ( P. Pamilo and M. Nei, Relationships between gene tees and species tees, Mol. Biol. Evol. 5 ( M. Petkovšek, H.S. Wilf, and D. Zeilbege, A B, Petes, Wellesley, MA, J.A. Rice, Mathematical Statistics and Data Analysis, 2nd edition, Duxbuy Pess, Belmont, CA, N.A. Rosenbeg, The pobability of topological concodance of gene tees and species tees, Theoet. Popul. Biol. 61 ( N.A. Rosenbeg, The shapes of neutal gene genealogies in two species: pobabilities of monophyly, paaphyly, and polyphyly in a coalescent model, Evolution 57 ( N.A. Rosenbeg, Gene genealogies, In: Evolutionay Genetics: Concepts and Case Studies, C.W. Fox and J.B. Wolf, Eds., Oxfod Univesity Pess, Oxfod, 2006.
18 146 N.A. Rosenbeg 32. C. Semple and M. Steel, Phylogenetics, Oxfod Univesity Pess, Oxfod, J.B. Slowinski, Pobabilities of n-tees unde two models: a demonstation that asymmetical inteio nodes ae not impobable, Syst. Zool. 39 ( J.B. Slowinski and C. Guye, Testing the stochasticity of pattens of oganismal divesity: an impoved null model, Ame. Natualist 134 ( M. Steel and A. McKenzie, Popeties of phylogenetic tees geneated by Yule-type speciation models, Math. Biosci. 170 ( J. Stone and J. Repka, Using a nonecusive fomula to detemine cladogam pobabilities, Syst. Biol. 47 ( J.R. Stone, Pobabilities fo completely pectinate and symmetic cladogams, Cladistics 19 ( F. Tajima, Evolutionay elationship of DNA sequences in finite populations, Genetics 105 ( G.U. Yule, A mathematical theoy of evolution based on the conclusions of D. J.C. Willis, F.R.S., Philos. Tans. Roy. Soc. Lond. Se. B 213 (
where and are polynomials with real coefficients and of degrees m and n, respectively. Assume that and have no zero on axis.
function whee is an unknown constant epesents fo the un-modeled dynamics The pape investigates the position contol of electical moto dives that can be configued as stuctue of Fig 1 This poblem is fomulated
More informationParameterized Complexity of Connected Even/Odd Subgraph Problems
Paameteized Complexity of Connected Even/Odd Subgaph Poblems Fedo V. Fomin 1 and Pet A. Golovach 2 1 Depatment of Infomatics, Univesity of Begen PB 7803, 5020 Begen, Noway fedo.fomin@ii.uib.no 2 School
More information10! !. 3. Find the probability that a five-card poker hand (i.e. 5 cards out of a 52-card deck) will be:
MATH 0(001 Fall 2018 Homewok 2 Solutions Please infom you instucto if you find any eos in the solutions 1 Suppose that thee ae duck huntes, each with a pefect shot A flock of ducks fly ove, and each hunte
More informationN2-1. The Voltage Source. V = ε ri. The Current Source
DC Cicuit nalysis The simplest cicuits to undestand and analyze ae those that cay diect cuent (DC). n this note we continue ou study of DC cicuits with the topics of DC voltage and cuent souces, the idea
More informationAnalysis of Occurrence of Digit 0 in Natural Numbers Less Than 10 n
meican Intenational Jounal of Reseach in Fomal, pplied & Natual Sciences vailable online at http://www.iasi.net ISSN (Pint): 2328-3777, ISSN (Online): 2328-3785, ISSN (CD-ROM): 2328-3793 IJRFNS is a efeeed,
More informationSteve Alpern, Thomas Lidbetter, Alec Morton, and Katerina Papadaki Patrolling a pipeline
Steve Alpen, Thomas Lidbette, Alec Moton, and Kateina Papadaki Patolling a pipeline Book section Oiginal citation: Oiginally published in Alpen, Steven, Lidbette, Thomas, Moton, Alec and Papadaki, Kateina
More informationNear-field Computation and. Uncertainty Estimation using Basic. Cylindrical-Spherical Formulae
Nea-field Computation and Uncetainty Estimation using Basic Cylindical-Spheical Fomulae Poject... IEC 63 Subject... Basic Nea-Field Computation Document numbe... N/A Revision... 3 Autho... F.D. du Plessis
More informationVariance? which variance? R squared effect size measures in simple mediation models
Vaiance? which vaiance? squaed effect size measues in simple mediation models M This is it? med di X de Heus, P. (01). squaed effect size measues and ovelap between diect and indiect effect in mediation
More informationThe mathematical structure known as a graph has the valuable feature of
Copyight, Pinceton Univesity Pess No pat of this book may be means without pio witten pemission of the publishe 1 Intoducing Gaphs The mathematical stuctue known as a gaph has the valuable featue of helping
More informationThe Periodic Ambiguity Function Its Validity and Value
The Peiodic Ambiguity Function Its Validity and Value Nadav Levanon Dept. of Electical Engineeing Systems Tel Aviv Univesity Tel Aviv, Isael nadav@eng.tau.ac.il Abstact The peiodic ambiguity function (PAF)
More information4 Trigonometric and Inverse Trigonometric Functions
MATH983/954 Mathematics 0C/C. Geneal infomation fo the academic yea 0-03: Lectue: D Theodoe Voonov, Room.09, School of Mathematics, Alan Tuing Building, email: theodoe.voonov@mancheste.ac.uk. Lectues:
More informationDiscrepancies Between Euclidean and Spherical Trigonometry. David Eigen
Discepancies Between Euclidean and Spheical Tigonomety David Eigen 1 Non-Euclidean geomety is geomety that is not based on the postulates of Euclidean geomety. The five postulates of Euclidean geomety
More informationMultiagent Reinforcement Learning Dynamic Spectrum Access in Cognitive Radios
Sensos & Tansduces 204 by IFSA Publishing, S L http://wwwsensospotalcom Multiagent Reinfocement Leaning Dynamic Spectum Access in Cognitive Radios Wu Chun, 2 Yin Mingyong, 2 Ma Shaoliang, Jiang Hong School
More informationFigure Geometry for Computing the Antenna Parameters.
Spheical Coodinate Systems Definitions Figue 1.2.1 Geomety fo Computing the Antenna Paametes. Antenna Radiation Patten: The distibution of adiated enegy fom an antenna ove a suface of constant adius centeed
More informationSpectrum Sharing between Public Safety and Commercial Users in 4G-LTE
1 Spectum Shaing between Public Safety and Commecial Uses in 4G-LTE Haya Shajaiah, Ahmed Abdel-Hadi and Chales Clancy Badley Depatment of Electical and Compute Engineeing Viginia Tech, Alington, VA, 22203,
More informationSmall Loop Antenna and Duality Theorem
Small Loop Antenna and Duality Theoem Page 1 Small Loop Antenna and Duality Theoem Having studied the ideal electic dipole we now tun ou attention to an inteesting antenna closely elated to the electic
More informationDesign of FIR Filter using Filter Response Masking Technique
Design of FIR Filte using Filte Response Masking Technique Sandeep Shivastava, Alok Jain, Ram Kuma Soni Abstact- In this pape autho is tying to implement Fequency esponse masking (FRM) technique. In this
More informationIAS 2.4. Year 12 Mathematics. Contents. Trigonometric Relationships. ulake Ltd. Robert Lakeland & Carl Nugent
Yea 12 Mathematics IS 2.4 Tigonometic Relationships Robet Lakeland & al Nugent ontents chievement Standad.................................................. 2 icula Measue.......................................................
More informationParameters of spinning AM reticles
Paametes of spinning AM eticles onald G. Digges, Cal E. Halfod, and Glenn D. Boeman A new method of obtaining amplitude modulation (AM) fo detemining taget location with spinning eticles is pesented. The
More information1 Performance and Cost
Pefomance and Cost Analysis and Reseach of Ai-Cooled Using Small Diamete Coppe Tubes Wu Yang, Li Changsheng and Deng Bin Abstact Replacing coppe tubes with aluminum tubes and using coppe tubes with smalle
More informationDesign of A Circularly Polarized E-shaped Patch Antenna with Enhanced Bandwidth for 2.4 GHz WLAN Applications
VNU Jounal of Science: Comp. Science & Com. Eng., Vol. 31, No. 2 (2015) 1-7 Design of A Ciculaly Polaized E-shaped Patch Antenna with Enhanced Bandwidth fo 2.4 GHz WLAN Applications Hong Van Tam 1, Luong
More informationEfficient Power Control for Broadcast in Wireless Communication Systems
Efficient Powe Contol fo Boadcast in Wieless Communication Systems A. T. Chonopoulos Compute Science Depatment Univesity of Texas at San Antonio San Antonio, TX Email:atc@cs.utsa.edu P. Cotae Depatment
More informationDistributed Spectrum Allocation via Local Bargaining
Distibuted Spectum Allocation via Local Bagaining Lili Cao Shanghai Jiaotong Univesity, Shanghai, P.R. China Email: cao li li@yahoo.com Haitao Zheng Micosoft Reseach Asia, Beijing, P.R. China Email: htzheng@ieee.og
More informationAn Efficient Control Approach for DC-DC Buck-Boost Converter
2016 Published in 4th Intenational Symposium on Innovative Technologies in Engineeing and Science 3-5 Novembe 2016 (ISITES2016 Alanya/Antalya - Tukey) An Efficient Contol Appoach fo DC-DC Buck-Boost Convete
More informationChapter 9 Cascode Stages and Current Mirrors
Chapte 9 Cascode Stages and Cuent Mios 9. Cascode Stage 9. Cuent Mios CH 9 Cascode Stages and Cuent Mios Boosted Output Impedances S O S m out E O E m out g g Bipola Cascode Stage [ g ( )] out m O O O
More informationAnalysis of a Fractal Microstrip Patch Antenna
124 Analysis of a Factal Micostip Patch Antenna Vibha Rani Gupta and Nisha Gupta* Bila Institute of Technology, Mesa, Ranchi-835215, Jhakhand, India. vgupta@bitmesa.ac.in, ngupta@bitmesa.ac.in Abstact-
More informationECEN326: Electronic Circuits Fall 2017
ECEN36: Electonic Cicuits Fall 07 Lectue 4: Cascode Stages and Cuent Mios Sam Palemo Analog & Mixed-Signal Cente Texas A&M Univesity Announcements HW3 due 0/4 Exam 0/9 9:0-0:0 (0 exta minutes) Closed book
More informationNoise Attenuation Due to Vegetation
Noise Attenuation Due to Vegetation Vasile BACRIA Politehnica Univesity of Timisoaa, Bd. M.Viteazu,1, 300222 Timisoaa, bacia@mec.upt.o Nicolae HERISANU Politehnica Univesity of Timisoaa, Bd. M. Viteazu,
More informationINCREMENTAL REDUNDANCY (IR) SCHEMES FOR W-CDMA HS-DSCH
ICREMETAL REDUDACY (IR) SCHEMES FOR W-CDMA HS-DSCH Amitava Ghosh 1, Kenneth Stewat, Rapeepat Ratasuk 1, Eoin Buckley, and Raa Bachu 1 Advanced Radio Technology, GTSS, Motoola, Alington Heights, IL, USA
More informationTiling Layouts with Dominoes
+, 16th Canadian Confeence on Computational Geomety, 2004 Tiling Layouts with Dominoes Mak Watson Chis Woman c 1 We exploe the complexity of tiling finite subsets of the plane, which we call layouts, with
More informationPerformance Analysis of EGC Combining over Correlated Nakagami-m Fading Channels
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 9, No., June, 93-3 UDK: 6.39 DOI:.98/SJEE93M Pefoance Analysis of EGC Cobining ove Coelated Nakagai- Fading Channels Dejan Milić, Selena Stanojčić, Zoan Popović,
More informationAnalysis of the Radiation Resistance and Gain of Full-Wave Dipole Antenna for Different Feeding Design
Jounal of lectomagnetic Analysis and Applications, 01, 4, 35-4 http://dx.doi.og/10.436/jemaa.01.46033 Published Online June 01 (http://www.scirp.og/jounal/jemaa) 35 Analysis of the Radiation Resistance
More information51. IWK Internationales Wissenschaftliches Kolloquium International Scientific Colloquium
51. IWK Intenationales Wissenschaftliches Kolloquium Intenational Scientific Colloquium PROCEEDINGS 11-15 Septembe 26 FACULTY OF ELECTRICAL ENGINEERING AND INFORMATION SCIENCE INFORMATION TECHNOLOGY AND
More informationCCSDS Coding&Synchronization Working Group March Washington DC, USA SLS-C&S_08-CNES02
CCSDS Coding&Synchonization Woking Goup Mach 2008 1 Washington DC, USA DVB-S2 like fame constuction and LDPC codes ate o/and size extension fo use of Vaiable Coding & Modulation suitable fo X and Ka bands
More informationPerformance Analysis of Z-Source Inverter Considering Inductor Resistance
Pefomance Analysis of Z-Souce Invete Consideing Inducto Resistance Fatma A. Khea * and Essam Eddin M. Rashad ** Electic Powe and Machines Engineeing Depatment, Faculty of Engineeing, anta Univesity, anta,
More informationSynopsis of Technical Report: Designing and Specifying Aspheres for Manufacturability By Jay Kumler
OPTI 51 Synopsis (Gad Requiement #1) G. Desoches Synopsis of Technical Repot: Designing and Specifying Asphees fo Manufactuability By Jay Kumle Novembe 1, 007 Reviewed by: Gead Desoches Abstact Since asphees
More informationChannel Modelling ETIM10. Fading Statistical description of the wireless channel
Channel Modelling ETIM10 Lectue no: 3 Fading Statistical desciption of the wieless channel Ghassan Dahman \ Fedik Tufvesson Depatment of Electical and Infomation Technology Lund Univesity, Sweden 013-01-8
More informationDetermination of The Winding Inductances Of A Two-Phase Machine.
IOSR Jounal of Engineeing (IOSRJEN) ISSN (e): 5-31, ISSN (p): 78-8719 Vol. 5, Issue 4 (Apil. 15), V1 PP 16- www.iosjen.og Detemination of The Winding Inductances Of A Two-Phase Machine. * I.K. Onwuka,
More informationDesign of an LLC Resonant Converter Using Genetic Algorithm
Design of an LLC Resonant Convete Using Genetic Algoithm H. H. Nien, C. K. Huang, S. K. Changchien, C. H Chan Dept. of Electical Engineeing, Chienkuo Technology Univesity E-mail: nien@ctu.edu.tw Dept,
More informationOptimal Design of Smart Mobile Terminal Antennas for Wireless Communication and Computing Systems
Optimal Design of Smat Mobile Teminal Antennas fo Wieless Communication and Computing Systems Autho Lu, Junwei, Yang, Shiyou Published 2007 Confeence Title 2007 4th Intenational Symposium on Electomagnetic
More informationINVESTIGATION OF CLOSE-TO-WALL WIRELESS SENSOR DEPLOYMENT USING 2D FINITE-DIFFERENCE TIME-DOMAIN MODELLING. Y. Wu and I. J.
2 nd Intenational Confeence on Wieless Communications in Undegound and Confined Aeas August 25-27, 2008 Val-d O - Québec - Canada INVESTIGATION OF CLOSE-TO-WALL WIRELESS SENSOR DEPLOYMENT USING 2D FINITE-DIFFERENCE
More informationLow-Complexity Time-Domain SNR Estimation for OFDM Systems
Low-Complexity Time-Domain SR Estimation fo OFDM Systems A. jaz, A.B. Awoseyila and B.G. Evans A low-complexity SR estimation algoithm fo OFDM systems in fequency-selective fading channels is poposed.
More informationVolume 1, Number 1, 2015 Pages 1-12 Jordan Journal of Electrical Engineering ISSN (Print): , ISSN (Online):
JJEE Volume, Numbe, 5 Pages - Jodan Jounal of Electical Engineeing ISSN (Pint): 49-96, ISSN (Online): 49-969 Discimination between Tansfome Inush Cuent and Intenal Fault using Combined DFT-ANN Appoach
More informationIEEE Broadband Wireless Access Working Group < Modifications to the Feedback Methodologies in UL Sounding
Poject Title Date Submitted IEEE 802.16 Boadband Wieless Access Woking Goup Modifications to the Feedback Methodologies in UL Sounding 2008-01-14 Souce(s) Fed Vook, Jeff Zhuang,
More informationDESIGN AND PARAMETRIC EVALUATION OF RECTANGULAR MICROSTRIP PATCH ANTENNA FOR GSM APPLICATION
DESIGN AND PARAMETRIC EVALUATION OF RECTANGULAR MICROSTRIP PATCH ANTENNA FOR GSM APPLICATION RAHUL T. DAHATONDE, SHANKAR B. DEOSARKAR Dept. of E & TC, D. Babasaheb Ambedka Technological Univesity, Lonee,
More informationMicrowave Finite Element Modeling Applications to Coupled Electromagnetic-Thermal Problems and Characterization of Dielectric Materials
Micowave Finite Element Modeling Applications to Coupled Electomagnetic-Themal Poblems and Chaacteization of Dielectic Mateials Hulusi Acikgoz, Yann Le Bihan, Olivie Meye, and Lionel Pichon Laboatoie de
More informationKey Laboratory of Earthquake Engineering and Engineering Vibration, China Earthquake Administration, China
Shake Table Test fo Lage Indiect-Ai-Cooling Towe Stuctue of Fie Powe Plant Pat I Junwu DAI, Yongqiang YANG & Xuan WNG Key Laboatoy of athquake ngineeing and ngineeing Vibation, China athquake Administation,
More informationAntenna fundamentals: With answers to questions and problems (See also Chapter 9 in the textbook.)
adio Technology Metopolia/A. Koivumäki Antenna fundamentals: With answes to questions and poblems (See also Chapte 9 in the textbook.) 1. a) Make up a definition fo the tem "antenna". Answe: One definition:
More informationDerangements. Brian Conrey and Tom Davis and March 23, 2000
Deangements Bian Coney and Tom Davis coney@aimath.og and tomdavis@eathlink.net http://www.geomete.og/mathcicles Mach 23, 2000 Seating Mixup Imagine that Yankee Stadium is completely sold out, but when
More informationStatement of Works Data Template Version: 4.0 Date:
Statement of Woks Data Template Vesion: 4.0 Date: 16.08.17 This Statement of Woks (SoW) Data Template is to be completed by Distibution Netwok Opeatos (DNOs) in ode to povide National Gid the equied data
More informationJournal of Applied Science and Agriculture
Jounal of Applied Science and Agicultue, 9(16) Octobe 214, Pages: 1-15 AENSI Jounals Jounal of Applied Science and Agicultue ISSN 1816-9112 Jounal home page: www.aensiweb.com/jasa A Design of New Bluetooth
More informationExperimental Investigation of Influence on Non-destructive Testing by Form of Eddy Current Sensor Probe
Expeimental Investigation of Influence on Non-destuctive Testing by Fom of Eddy Cuent Senso Pobe Fengyun Xie * and Jihui Zhou School of Mechanical and Electonical Engineeing, East China Jiaotong Univesity,
More informationA Transmission Scheme for Continuous ARQ Protocols over Underwater Acoustic Channels
A Tansmission Scheme fo Continuous ARQ Potocols ove Undewate Acoustic Channels Mingsheng Gao 1, Wee-Seng Soh 1 and Meixia Tao 2 1 Dept. of Electical & Compute Engineeing, National Univesity of Singapoe,
More informationSchool of Electrical and Computer Engineering, Cornell University. ECE 303: Electromagnetic Fields and Waves. Fall 2007
School of Electical and Compute Engineeing, Conell Univesity ECE 303: Electomagnetic Fields and Waves Fall 007 Homewok 1 Due on Nov. 8, 007 by 5:00 PM Reading Assignments: i) Review the lectue notes. ii)
More informationDemosaicking using Adaptive Bilateral Filters
Demosaicking using Adaptive Bilateal Filtes Ekine Akuiyibo Timothy Atobatele EE 362, Winte 2006 0. Abstact Digital cameas sample the continuous spectum using an aay of colo filtes such that each pixel
More informationABSTRACTT FFT FFT-' Proc. of SPIE Vol U-1
Phase econstuction stategies in phase-locking system based on multi-apetue wave font sensos P.A. Semenov, S.D. Pol skikh Shvabe-Reseach, Moscow, Russian Fedeation; e-mail: pite@bk.u ABSTRACTT System of
More informationBinary Systematic Network Coding for Progressive Packet Decoding
Binay Systematic etwok Coding fo Pogessive Packet Decoding Andew L. Jones, Ioannis Chatzigeogiou and Andea Tassi School of Computing and Communications, Lancaste Univesity, United Kingdom Email: {a.jones2,
More informationUNCERTAINTY ESTIMATION OF SIZE-OF-SOURCE EFFECT MEASUREMENT FOR 650 NM RADIATION THERMOMETERS
XIX IMEKO Wold Congess Fundamental and Applied Metology Septembe 6 11, 29, Lisbon, Potugal UNCERTAINTY ESTIMATION OF SIZE-OF-SOURCE EFFECT MEASUREMENT FOR 65 NM RADIATION THERMOMETERS Fumihio Sakuma, Laina
More informationPSO driven RBFNN for design of equilateral triangular microstrip patch antenna
Indian Jounal of Radio & Space Physics Vol. 38, August 009, pp 33-37 PSO diven RBF fo design of equilateal tiangula micostip patch antenna Vidya Saga Chintakindi,$, Shyam Sunda Pattnaik,#,*, O P Bajpai
More informationRandomized Self-Assembly for Exact Shapes
Randomized Self-Assembly fo Exact Shapes David Doty Depatment of Compute Science Iowa State Univesity Ames, IA 500, USA ddoty@iastate.edu Abstact Woking in Winfee s abstact tile assembly model, we show
More informationVLSI Implementation of Low Complexity MIMO Detection Algorithms
, Impact Facto :.643 eissn : 349-000 & pissn : 394-4544 Intenational Jounal of Reseach and Applications (Ap-Jun 015 Tansactions) (6): 309-313 Intenational Confeence on Emeging Tends in Electonics & Telecommunications
More information6.1 Reciprocal, Quotient, and Pythagorean Identities
Chapte 6 Tigonometic Identities 1 6.1 Recipocal, Quotient, and Pthagoean Identities Wam-up Wite each epession with a common denominato. Detemine the estictions. a c a a) b d b) b c d c) a 1 c b c b a Definition
More informationPerformance Evaluation of Maximum Ratio combining Scheme in WCDMA System for Different Modulations
Intenational Jounal of Emeging Technologies in Engineeing Reseach (IJETER) Volume 4, Issue 5, ay (6) www.ijete.evescience.og efomance Evaluation of aimum Ratio combining Scheme in WCDA System fo Diffeent
More informationSTACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
H PRASHANTHA KUMAR et. al.: STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM DOI:.297/ijct.22.69 STACK DECODING OF LINEAR BLOCK CODES FOR DISCRETE MEMORYLESS CHANNEL
More informationOn Reducing Blocking Probability in Cooperative Ad-hoc Networks
On educing Blocking Pobability in Coopeative Ad-hoc Netwoks Ayda Basyouni, Walaa Hamouda ept of Electical and Compute Engineeing Concodia Univesity, Monteal, Canada Email: {a basy,hamouda}@ececoncodiaca
More informationTheoretical Analysis of the Multi-agent Patrolling Problem
Theoetical Analysis of the Multi-agent Patolling Poblem Yann Chevaleye Lamsade - univesity pais 9, place du Machal de Latte de Tassigny 75775 PARIS CEDEX 16 yann.chevaleye@lamsade.dauphine.f Abstact A
More informationISSN: [Reddy & Rao* et al., 5(12): December, 2016] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY SIMULATION COMPARISONS OF INDUCTION MOTOR DRIVE WITH ESTIMATOR AND PLL V. Nasi Reddy *, S. Kishnajuna Rao*, S.Nagenda Kuma * Assistant
More informationNICKEL RELEASE REGULATIONS, EN 1811:2011 WHAT S NEW?
NICKEL RELEASE REGULATIONS, EN 1811:2011 WHAT S NEW? BACKGROUND: EN 1811 is the intenationally ecognised test method which was devised almost 12 yeas ago to detemine the ate of nickel elease fom jewelley,
More informationExperiments with the HoloEye LCD spatial light modulator
Expeiments with the HoloEye LCD spatial light modulato HoloEye model LC00 spatial light modulato The HoloEye (http://www.holoeye.com/spatial_light_modulato_lc_00.html) LC 00 Spatial Light Modulato (SLM)
More informationSignal Extraction Technology
Extaction Technology Intoduction Masimo SET pulse oximety is a new and fundamentally distinct method of acquiing, pocessing and epoting ateial oxygen satuation and pulse ate. As illustated below, Masimo
More informationMinimizing Ringing and Crosstalk
Minimizing Ringing and Cosstalk By Glen Dash, Ampyx LLC, GlenDash at alum.mit.edu Copyight 1998, 26 Ampyx LLC When viewed on a schematic, a wie is just a wie. Howeve, when isetimes shink to a few nanoseconds
More informationFeasibility of a triple mode, low SAR material coated antenna for mobile handsets
Loughboough Univesity Institutional Repositoy Feasibility of a tiple mode, low SAR mateial coated antenna fo mobile handsets This item was submitted to Loughboough Univesity's Institutional Repositoy by
More informationTHE UNIVERSITY OF NEW SOUTH WALES. School of Electrical Engineering & Telecommunications
THE UNIESITY OF NEW SOUTH WAES School of Electical Engineeing & Telecommunications EE97 POWE EETONIS FO ENEWABE AND DISTIBUTED GENEATION EXAMINATION Session (Supplementay Exam) TIME AOWED: 3 hous TOTA
More informationPERFORMANCE OF TOA ESTIMATION TECHNIQUES IN INDOOR MULTIPATH CHANNELS
PERFORMANCE OF TOA ESTIMATION TECHNIQUES IN INDOOR MULTIPATH CHANNELS Xinong Li, Kaveh Pahlavan, and Jacques Beneat Cente fo Wiele Infomation Netwo Studies Electical and Compute Engineeing Depatment, Woceste
More informationTHE USE OF WAVELETS FOR NOISE DETECTION IN THE IMAGES TAKEN BY THE ANALOG AND DIGITAL PHOTOGRAMMETRIC CAMERAS
THE USE OF WAVELETS FO NOISE DETECTION IN THE IMAGES TAKEN BY THE ANALOG AND DIGITAL PHOTOGAMMETIC CAMEAS K. Pyka a, *, J. Siedlik b a Depatment of Geoinfomation, Photogammety and emote Sensing of Envionment
More informationStudy and Design of Dual Frequency High Gain and Conformal Microstrip Patch Antenna
, pp.236-243 http://dx.doi.og/10.14257/astl.2017.147.33 Study and Design of Dual Fequency High Gain and Confomal Micostip Patch Antenna S. Auna 1, K. Sinivasa Naik 2, J. Ramesh 2 and D. Madhu 2 1 Andha
More informationOptic Cable Tracking and Positioning Method Based on Distributed Optical Fiber Vibration Sensing
08 5th Intenational Confeence on Electical & Electonics Engineeing and Compute Science (ICEEECS 08) Optic Cable Tacking and Positioning Method Based on Distibuted Optical Fibe Vibation Sensing Zhang Chao,
More informationSpatial Coding Techniques for Molecular MIMO
Spatial Coding Techniques fo Molecula MIMO Matin Damath, H. Bikan Yilmaz, Chan-Byoung Chae, and Pete Adam Hoehe Faculty of Engineeing, Kiel Univesity, Gemany, Email: {md, ph}@tf.uni-kiel.de School of Integated
More informationOPTIMUM MEDIUM ACCESS TECHNIQUE FOR NEXT GENERATION WIRELESS SYSTEMS
9 th Febuay. Vol. 3 No. 5 - JATIT & LLS. All ights eseved. ISSN: 99-5 www.jatit.og E-ISSN: 7-395 OPTIMUM MEDIUM ACCESS TECHNIQUE FOR NEXT GENERATION WIRELESS SYSTEMS N.AMUTHA PRABHA, V.MANIANDAN VIT UNIVERSITY,
More informationController Design of Discrete Systems by Order Reduction Technique Employing Differential Evolution Optimization Algorithm
Contolle Design of Discete Systems by Ode Reduction Technique Employing Diffeential Evolution Optimization Algoithm J. S. Yadav, N. P. Patida, and J. Singhai Abstact One of the main objectives of ode eduction
More informationGAMMA SHAPED MONOPOLE PATCH ANTENNA FOR TABLET PC
GAMMA SHAPED MONOPOLE PATCH ANTENNA FOR TABLET PC Islam Md. Rafiqul, Mohammad Shawkat Habib and Khaizuan Abdullah Depatment of Electical and Compute Engineeing, Intenational Islamic Univesity Malaysia,
More informationHYBRID FUZZY PD CONTROL OF TEMPERATURE OF COLD STORAGE WITH PLC
Jounal of Theoetical and Applied Infomation Technology 28 th Febuay 2013. Vol. 48 No.3 2005-2013 JATIT & LLS. All ights eseved. ISSN: 1992-8645 www.jatit.og E-ISSN: 1817-3195 HYBRID FUZZY PD CONTROL OF
More informationChapter 5: Trigonometric Functions of Angles
Chapte 5: Tigonometic Functions of Angles In the pevious chaptes we have exploed a vaiety of functions which could be combined to fom a vaiety of shapes. In this discussion, one common shape has been missing:
More informationSliding Mode Control for Half-Wave Zero Current Switching Quasi-Resonant Buck Converter
Sliding Mode Contol fo Half-Wave Zeo Cuent Switching Quasi-Resonant Buck Convete M. Ahmed, Student membe, IEEE, M. Kuisma, P. Silventoinen Abstact This pape focuses on the pactical implementation of sliding
More informationImpact of bilateral filter parameters on medical image noise reduction and edge preservation
The Univesity of Toledo The Univesity of Toledo Digital Repositoy Theses and Dissetations 2009 Impact of bilateal filte paametes on medical image noise eduction and edge pesevation Michael D. Lekan Medical
More informationSpread Spectrum Codes Identification by Neural Networks
in "Systems and Contol: heoy and Applications", published by WSES, 2, pp. 257-262, ISBN 96-852-4 Spead Spectum Codes Identification by Neual Netwoks Céline BOUDER, Gilles BUREL Laboatoie d Electonique
More informationAnti-Forensics of Chromatic Aberration
Anti-Foensics of Chomatic Abeation Owen Maye and Matthew C. Stamm Dept. of Electical and Compute Engineeing, Dexel Univesity, Philadelphia, PA, USA ABSTRACT Ove the past decade, a numbe of infomation foensic
More informationThe reliability of wireless backhaul mesh networks
The eliability of wieless backhaul mesh netwoks Gei Egeland 1, Paal E. Engelstad 2 1 Depatment of Electical and Compute Engineeing, Univesity of Stavange, 4036 Stavange Noway 1 gei.egeland@gmail.com 2
More informationNear-field emission prediction of CESAME
Nea-field emission pediction of CESAME E. Sicad, S. Ben Dhia, E. Lamoueux INSA-GEI, 135 Av de Rangueil 31077 Toulouse Fance B. Vignon, L. Couau ST Micoelectonics, Cental R&D Colles, Fance Contact : etienne.sicad@insa-toulouse.f
More informationThe phenomenon of incoherent signal interference
The phenomenon of incoheent signal intefeence.. Goshenkov #, Y.N. Klikushin #, K.T. Koshekov *3 # Depatment "Technology of electonics", Omsk tate Technical Univesity, OmGTU, Omsk, Russia goshenkov@omgtu.u
More informationWireless Communication (Subject Code: 7EC3)
COMPUCOM INSTITUTE OF TECHNOLOGY & MANAGEMENT, JAIPUR (DEPARTMENT OF ELECTRONICS & COMMUNICATION) Notes Wieless Communication (Subject Code: 7EC3) Pepaed By: LOKESH KUMAR ARYA Class: B. Tech. IV Yea, VII
More informationPublished in: International Journal of Material Forming. Document Version: Peer reviewed version
A Vitual Inspection Technique fo Assessing the Dimensional Accuacy of Foged Compesso Blades Using FE Modeling and CMM Inspection Makem, J., Ou, H., Amstong, C., Rennie, A., & Nikov, S. (2008). A Vitual
More informationAssignment 0/0 2 /0 8 /0 16 Version: 3.2a Last Updated: 9/20/ :29 PM Binary Ones Comp Twos Comp
* Dynamic Memoy *Big O Notation*Stacks *Exteme Pogamming*Selection Sot*Insetion Sot*Watefall Model Sting*Aays*AayList*Client Seve*Atificial Intelligence*Inheitance*Files*Video Games*Shot cicuit evaluation*
More informationThe Marginal Utility of Cooperation in Sensor Networks
e Maginal Utility of Coopeation in Senso Netwoks Yu-Ching Tong, Geg Pottie Depatment of Electical Engineeing Univesity of Califonia, Los Angeles Los Angeles, Califonia 99 Email: yuching@ee.ucla.edu, pottie@icsl.ucla.edu
More informationProbabilistic Spectrum Assignment for QoS-constrained Cognitive Radios with Parallel Transmission Capability
Pobabilistic Spectum Assignment fo QoS-constained Cognitive Radios with Paallel Tansmission Capability Haythem Ahmad any Salameh epatment of Telecommunication Engineeing Yamouk Univesity haythem@yuedujo
More informationPower Minimization in Uni-directional Relay Networks with Cognitive Radio Capabilities
00 5th Intenational Symposium on elecommunications (IS'00) Poe Minimization in Uni-diectional Relay Netoks ith Cognitive Radio Capabilities Adalan Alizadeh Seyed Mohammad-Sajad Sadough Cognitive elecommunication
More informationChamber Influence Estimation for Radiated Emission Testing in the Frequency Range of 1 GHz to 18 GHz
Chambe Influence Estimation fo Radiated Emission Testing in the Fequency Range of 1 GHz to 18 GHz Alexande Kiz Electomagnetic Compatibility and RF-Engineeing ARC eibesdof eseach GmbH eibesdof, Austia alexande.kiz@acs.ac.at
More informationOptimal Strategies in Jamming Resistant Uncoordinated Frequency Hopping Systems. Bingwen Zhang
Optimal Stategies in Jamming Resistant Uncoodinated Fequency Hopping Systems by Bingwen Zhang A Thesis Submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in patial fulfillment of the equiements
More informationCyclic Constellation Mapping Method for PAPR Reduction in OFDM system
2013 8th Intenational Confeence on Communications and Netwoking in China (CHINACOM) Cyclic Constellation Mapping Method fo PAPR Reduction in OFDM system Yong Cheng, Jianhua Ge, Jun Hou, and Fengkui Gong
More informationInvestigation. Name: a About how long would the threaded rod need to be if the jack is to be stored with
Think Unit bout 6 This Lesson Situation 1 Investigation 1 Name: Think about the design and function of this automobile jack. Use the uto Jack custom tool to test ou ideas. a bout how long would the theaded
More information