On the Size of Some Trees Embedded in R d

Size: px
Start display at page:

Download "On the Size of Some Trees Embedded in R d"

Transcription

1 INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Size of Some Trees Embee in R Pero Machao Manhães e Castro Olivier Devillers inria , version - 8 Jan N 779 Janvier apport e recherche ISSN ISRN INRIA/RR FR+ENG

2 inria , version - 8 Jan

3 On the Size of Some Trees Embee in R Pero Machao Manhães e Castro, Olivier Devillers Thème : Computational Geometry, Geometric Graphs Équipe-Projet Geometrica Rapport e recherche n 779 Janvier 3 pages inria , version - 8 Jan Abstract: This paper extens the result of Steele [6, 5] on the worst-case length of the Eucliean minimum spanning tree EM ST an the Eucliean minimum insertion tree EMIT of a set of n points S R. More precisely, we show that, if the weight w of an ege e is its Eucliean length to the power of α, the following quantities e EMST w(e an e EMIT w(e are both worst-case O(n α/, where is the imension an α, < α <, is the weight. Also, we analyze an compare the value of e T w(e for some trees T embee in R which are of interest in (but not limite to the point location problem []. Key-wors: Computational Geometry, Geometric Graphs This work is partially supporte by ANR Project Triangles an Région PACA. Centre e recherche INRIA Sophia Antipolis Méiterranée 4, route es Lucioles, BP 93, 69 Sophia Antipolis Ceex Téléphone : Télécopie :

4 Sûr la Taille e Quelques Arbres Plongées ans R Résumé : Ce papier éten le résultat e Steele [6, 5] sûr la taille au pire es cas e la plus petite arbre e couverture minimal Eucliienne et l arbre insertion minimal un ensemble e n points S R. Plus précisément, nous émontrons que si le pois w une arête e est sa longueur Eucliienne à la puissance α, les quantités suivantes e EMST w(e et e EMIT w(e valent au pire es cas O(n α/, où est la imension et α, < α <, est le poi. Nous éterminons et comparons aussi la valeur e e T w(e pour es arbres T plongées ans R, qui sont intèrêt au problème e la localisation es points []. Mots-clés : Géométrie Algorithmique, Graphes Géométriques inria , version - 8 Jan

5 On the Size of Some Trees Embee in R 3 Introuction inria , version - 8 Jan This paper extens the result of Steele [6, 5] on the worst-case length of the Eucliean minimum spanning tree EM ST an the Eucliean minimum insertion tree EMIT of a set of n points S R. More precisely, we show that, if the weight w of an ege e is its Eucliean length to the power α, the following quantities e EMST w(e an e EMIT w(e are both worst-case O(n α/, where is the imension an α, < α <, is the weight. Also, we analyze an compare the value of e T w(e for some trees T embee in R which are of interest in (but not limite to the point location problem []. Let S {p i, i n} be a set of points in R an G (V, E be the complete graph such that the vertex v i V is embee on the point p i S; the ege e ij E linking two vertices v i an v j is weighte by p i p j α, its Eucliean length to the power of α. G is usually referre to as the geometric graph of S. We will enote the sum of the weight of the eges of G by G α (or G if α. We will also refer to G α as the weighte-length of G. Consier the following trees: (i A star is a tree having one vertex that is linke to all others (see Figure a. (ii A path is a tree having all vertices of egree but two with egree (see Figure b. (iii Among all the trees spanning S, a tree with the minimal length is calle an Eucliean minimum spanning tree of S an enote EMST (S (see Figure c. (iv Consier that an orering is given by a permutation σ, vertices are inserte in the orer v σ(, v σ(,..., v σ(n. We buil incrementally a spanning tree T i for S i {p σ(j S, i j} with T {v σ( }, T i T i {v σ(i v σ(j } an a fixe k, with k < n, such that v σ(i v σ(j has the shortest length for any max (, i k j < i. This tree is calle the Eucliean minimum k-insertion tree, an will be enote by EMIT k (S (see Figure e; when k n, we will write EMIT (S (see Figure. EMIT (S epens on σ an for some permutations it coincies with EM ST (S. It is noteworthy that both the combinatorics of EMST (S an of EMIT (S are invariant to α (since f(λ λ α, is monotonically increasing for positive α an λ. What changes is the sum of the weights associate with the eges. Also, EMST assumes that the position of all the points in S is available (static whereas EM IT clearly oes not (ynamic. p 4 p 3 c p 7 p 6 p 5 p p p 8 (a Star p 4 p 3 p 5 p 6 p 7 p p p 8 (b Path p 4 p 3 p 5 p 6 p 7 p p p 8 (c EMST p 4 p 3 p 5 p 6 p 7 p p p 8 ( EMIT p 4 p 3 p 5 p 6 p 7 p p p 8 (e EMIT Figure : Trees embee in the plane. Steele proves [4] that if p i are i.i.. ranom variables with compact support, then EMST (S α O(n α/ with probability. For the extreme case of α, Alous an Steele [] show that EMST (S O( if the variables RR n 779

6 4 P. e Castro & O. Devillers inria , version - 8 Jan above are evenly istribute in the unit cube. Without any epenence on probabilistic hypotheses, Steele proves [6] that the complexity of EM ST (S is boune by O(n / in the worst case. Finally, the asymptotic length of EMIT (S is shown to be the same as the one of EMST (S [5]. In other wors, EMIT (S O(n /. This result is surprising because it means that a priori knowlege of S oes not affect the asymptotic length of trees following the greey strategy of an EMST. This fact has application in the ynamic point location problem []. This work is presente as follow: First, in Section, we exten the result of Steele [5] stating that EMIT an EMST have the same asymptotical behavior to the case of EMIT α an EMST α for < α < as well. Secon, in Section 3, we obtain the expecte weighte-length of some stars of interest insie the unit ball. Then in Section 4 we obtain some ratios between the expecte weighte-length of such stars an ranom paths in the unit ball. Finally, in Section 5 we obtain bouns on the expecte weighte-length of EMIT k. Weighte Eucliean Minimum Insertion Tree We exten the result of Steele [5] for EMIT α (an consequently EMST α with the following theorem: Theorem. Let S be a sequence of n points in [, ], then EMST (S α EMIT (S α γ,α n α/, with an < α <. Where, γ,α + 4 / ( α (/α. The proof of Theorem follows exactly the same line as Steele [5], an starts with the two lemmas below. Given a fixe sequence S {p, p,..., p n } of points in R, then we can buil a spanning tree for S by sequentially joining x i to the tree forme by {p, p,..., p i } for < i n. Let w i R be efine as follow: w i min p i p j α, ( j<i then w i is the minimal cost of joining p i to a vertex of a spanning tree of {p, p,..., p i }. Now, we have that EMIT (S α <i n w i. Lemma. If {p, p,..., p n } [, ] an w i min p i p j α, for < i n, j<i an < α <, then for any < λ < we have w /α i 8 /. ( λ w i< α λ Proof. Let C {i : λ w i < α λ} an for each i C let B i be a ball of raius r i 4 w/α i with center p i. We will argue by contraiction that B i B j for all i < j. If B i B j, then the bouns r i α λ an r j α λ gives us p i p j 4 (w i /α + w j /α < λ /α. (3 But, by efinition of w j we have p i p j α w j for all i < j, which implies p i p j w /α j for all i < j; an, by the lower boun on the summans in Eq.( INRIA

7 On the Size of Some Trees Embee in R 5 we have λ w j, which means λ /α w /α j, so we also see p i p j λ /α. Since p i p j λ /α contraicts Eq.(3, we have B i B j. Now, since all of the balls B i are isjoint an containe in a sphere with raius, the sum of their volumes is boune by the volume of the sphere of raius. Thus, if ω enotes the volume of the unit ball in R, we have the boun ω w /α i 4 ω / from which Eq.( follows. i C Lemma ( 3. Let Ψ be a positive an non-increasing function on the interval, ], then for any < a < b, with an < α <, a w i b w i (/α+ Ψ(w i b α α 8 / a/ α Ψ(λλ. (4 inria , version - 8 Jan Proof. By Lemma we have for any < λ <, w /α i I(λ w i < α λ 8 /, where a w i<b I(λ w i < α λ I( α w i λ < w i is the inicator function. If we multiply by Ψ(λ an integrate over [ a, b], we α fin wi b (/α w i Ψ(λλ 8 / Ψ(λλ. (5 w i/ α a/ α a w i b Since Ψ is non-increasing, the integran on the left-han sie of Eq.(5 is boune from below by Ψ(w i, so Ψ(w i w i ( w i α w i/ Ψ(λλ, an Eq.(4 α follows from Eq(5. Proof of Theorem. Divie the set {w, w 3,..., w n } in two sets R {w i : w i n α/ } an R {w i : w i > n α/ }. We have the trivial boun [ w i w i n n α/ n α/. Now, let [a, b] n α/, ], w i R w i n α/ Ψ(λ λ /α in Eq.(4, then we have: w i n α/ w i ( α α 8 / (/α α n α/ (/α /. An hence, n w i i w i R w i w i R w i + 4 / ( α (/α n α/. Now, we have that w i R w i ( 4 / + ( α n α/, (/α from which Theorem follows. The constant is γ,α + 4 / ( α (/α. RR n 779

8 6 P. e Castro & O. Devillers 3 Two Stars Embee in R Assume a set of points S {p i, i n}, evenly istribute insie the unit ball B. Let c be a point in B, an E( cp α, p B be the expecte value of the istance between c an a point insie the unit ball to the power of α, with α >, as n. The following theorem istinguish two stars of particular interest. Theorem 4. The shortest an largest expecte weighte-length stars insie the ball are respectively: the star centere at O, the center of the ball; an the star centere at Ω, a point on the bounary of the ball, enote by H. inria , version - 8 Jan We have that lim n i n p i c α E( cp α, p B. n In other wors, lim n E( cp α, p B is the weighte-length of an ege of the star centere in c as n. Now, let us turn the attention to the so-calle weighte Steiner star of S, the star with the smallest weighte-length we can imagine of S. Consier that the weighte Steiner star of the first n points is centere at c n, then we have n p i c n α i n p i c α, (6 for any n > an c B. Let A n (c n i p i c α /n. The proof of Theorem 4 is ivie into several lemmas. First, we show that A n (c n converges. Then we show that there is a point c B such that A n (c an A n (c n converge to the same limit. Finally, we argue that c must be the center of the ball, the point O. Lemma 5. Let A n (c n i p i c α /n an c n be the center of the weighte Steiner star of the first n points A n (c n. Then A n (c n converges. i Proof. As points are evenly istribute in B, c n is a non-constant sequence with probability, an thus we can assume that < A n (c n < α for any n > an. We have from Eq.(6 A n+ (c n+ A n+ (c n n p i c n α i n n i p i c n α n + + p n+ c n α. n + p n+ c n α n + But p n+ c n, an thus A n+ (c n+ A n (c n + α /n, which means A n+ (c that lim n+ n A n (c. Analogously, we have, from the fact that p n+ n c n+ an Eq.(6, A n (c n ( n+ n An+ (c n+ α n. This means that A n+ (c lim n+ A n+ (c n A n (c, an thus lim n+ n n A n (c. As < A n (c n < α for n any n > an, A n (c n converges. INRIA

9 On the Size of Some Trees Embee in R 7 Now, we nee the following easy lemma. Lemma 6. Assume a, b R, a, b, for each α > there is a function f α (b such that (a + b α a α + f α (b an lim b f α (b. Proof. For α, we have f α (b b α, as (a + b α a α + b α. For α an α N, we have f α (b α b, as (a + b α a α + b α i ( α a α i b i a α + α b. i Let, {x} signify x x, then for α > an α / N, we have f α (b α b {α} + α b, as inria , version - 8 Jan (a + b α (a + b α (a + b {α} ( a α + α b (a {α} + b {α} a α + α b {α} + α b. Lemma 7. There is a point c B such that A n (c an A n (c n converge to the same limit. Proof. If a topological space X is compact, then every infinite subset of X has an accumulation point. Assume c is an accumulation point of the sequence {c i } i,,...,, then we have a subsequence of inices ζ : N N such that {c ζ(i } i,,..., converges to c. Because of the triangulation inequality an by irect application of Lemma 6, for any i >, we have that A ζ(i (c A ζ(i (c ζ(i + f α( cc ζ(i. As cc ζ(i converges to, then f α( cc ζ(i also converges to (see Lemma 6. An thus lim A ζ(i (c lim A ζ(i (c ζ(i. Therefore, as A i i n(c n converges, lim A ζ(i(c ζ(i lim A n(c n an lim A n(c lim A ζ(i (c lim A i n n i n(c n. n Proof of Theorem 4. By symmetry, lim A n(o lim A n(c for any c B, n n an from Eq.(6 an Lemma 7, we have that lim A n(o lim A n(c n n n lim A n(c lim A n(o. Therefore, at the limit, we have that the length of n n the weighte Steiner star is equivalent to the length of the star centere at O. With analogous arguments, we have that the largest weighte-star an a star centere at the bounary of the ball have equivalent length. Denote the shortest an largest expecte weighte-length stars insie the ball by S an H respectively. Let E( Op α, p B an E( Ωp α, p B be the expecte value of an ege of S an H respectively, then as n the size of S an H are given accoringly by n E( Op α, p B an n E( Ωp α, p B. We analyze in the sequel the values of E( Op α, p B an E( Ωp α, p B. RR n 779

10 8 P. e Castro & O. Devillers Theorem 8. When points are uniformly i.i. in a ball, the expecte size E( Op α, p B of an ege of the star centere at the center of the unit ball, with positive α, is given by: (. + α Proof. Let B l be a ball with raius l centere at the origin, we have E( Op α, p B l α P rob(p B l+l \ B l l +α l + α, l α (V (l/ll V ( where V (l is the volume of a ball of raius l (an V (l/l is its area. inria , version - 8 Jan Theorem 9. When points are uniformly i.i. in a ball, the expecte size E( Ωp α, p B of an ege of the star centere at the bounary of the unit ball, with positive α, is given by: +α ( + α + α B ( +, + + α B ( +,, where B(x, y λx ( λ y λ is the so-calle Beta function. The computation of the average is more involve than in Theorem 8, an we split the computation into several lemmas. Lemma. Consier the spherical cap H h forme by crossing a ball B R with raius R centere at the origin, with the plane x R h. Denote h the height of the cap. The volume of H h is the volume of the intersection between the half-space x R h an B R. This volume is given by: R π Γ( + arccos ( R h R sin (λλ. (7 Proof. The volume V (r of a ball with raius r in imension is given by r π /Γ( +. Each cross-section x R h + δ, δ h is a ( - imensional ball. If we integrate all of those balls along the x axis, we have R R h V ( R t t. Eq.(7 follows from replacing t by λ R cos (t. Lemma. Let Ω be a point on the bounary of the unit ball B unit, an P H (l P rob( Ωp l ; p B unit be the cumulative istribution function of istances between an uniformly istribute ranom point insie B unit an Ω, then ( arccos ( l / arccos (l/ P H (l B ( +, sin (λλ + l sin (λλ, where B(x, y λx ( λ y λ is the Beta function. Proof. If we enote B l the ball of raius l centere in Ω, the esire probability is clearly volume(b l B unit /volume(b unit. B l B unit is the union of two spherical caps limite by the plane x l / which can be compute using Lemma. INRIA

11 On the Size of Some Trees Embee in R 9 Proof of Theorem 9. The theorem follows from: E( Ωp α, p B l α l α P H(ll ( l l 4 B ( +, + l arccos (l/ sin (λλ B ( +, l inria , version - 8 Jan l +α ( l 4 B ( +, l + l +α arccos (l/ sin (λλ B ( +, l The right part of the expression above correspons exactly to the expecte value of l α where l is the length of a ranom segment etermine by two evenly istribute points in the unit ball [3, 7]. Its value is given by: l +α arccos (l/ sin (λλ ( B ( +, l +α + α The left part of the expression can be obtaine as follows: Finally, we have l +α ( l 4 B ( +, B ( +, + + α B ( +,. l +α y ( +α y y B ( +, +α z + α ( z z B ( +, +α B ( +, + + α B ( +,. E( Ωp α, p B +α ( + α + α B ( +, + + α B ( +,. 4 Some Ratios We may ask now what is the value of the ratio ρ(, α between E( Ωp α, p B an E( Op α, p B. It is an easy exercise to verify that ρ(, α α. In Corollary, we compute lim ρ(, α. Corollary. The ratio ρ(, α E( Ωp α, p B/E( Op α, p B when is given by α/. Proof. Computing ρ(, α with Theorems 8 an 9 gives: ( ( + α B ρ(, α +α +, + + α B ( +, (8 RR n 779

12 P. e Castro & O. Devillers Using the Stirling s ientities: B(a, b π aa b b, a, b, (9 (a + b a+b inria , version - 8 Jan we have: { ( + α lim ρ(, α lim +α +α π ( lim ( π + + α B(a, b Γ(ba b, a b >, ( α/ lim { ( B + + α, + } + α/ e α/4 e α/4 α/ ( B ( +, + + α + + α ( + + α ( + + ( + + α +α ( + + α + ( + + α +α If we consier a tree which is a ranom path in the unit ball, then the average size of its ege is given by the expecte weighte-length of a ranom segment etermine by two evenly istribute points in the unit ball. This is given by: +α ( + α B ( +, + + α } B ( +, ( The reaer may refer to Tu an Fischbach [7] for a proof. From Theorem 8, Corollary an Eq.( we obtain the following corollary: Corollary 3. The ratio between the weighte-length of a ranom path in the unit ball an the weighe-length of a star centere at the center of the unit ball is α +α/ when an α/ when. From Theorem 9 an Eq.( we obtain the following corollary: Corollary 4. The ratio between the weighte-length of a star centere at the bounary of the unit ball an the weighte-length of a ranom path in the unit ball is given by +α. 5 Weighte Eucliean Minimum k-insertion Tree for Ranom Points Now, we will compute a boun on the expecte weighte-length of an ege of EMIT k α for points evenly istribute in the unit ball. Theorem 5. When points are uniformly i.i. in a ball, the expecte length E(length of an ege of EMIT k α, with positive α, verifies: ( α ( B k +, α ( E(length α α ( B k +, α, ( where B(x, y λx ( λ y λ is the Beta function. INRIA

13 On the Size of Some Trees Embee in R First, we will evaluate the weighte-istance between the origin an the closest amongst k points {p, p,..., p k } evenly istribute in the unit ball. This provies the lower-boun. Then, we will fin an upper-boun on the weighte-istance between any point insie the ball an the closest amongst k points {p, p,..., p k } evenly istribute in the unit ball. Lemma 6. Let c be a point insie the unit ball, P rob ( cp l P c (l be the probability that the istance between a point p B an c is less or equal to l, an P c,k (l P rob (min( cp j j k l be the cumulative istribution function of the minimum istance among k points following a uniformly i.i. insie the unit ball an c, then P c,k (l ( P c (l k. Proof. inria , version - 8 Jan P c,k (l P rob (min( cp j j k l P rob ( cp j > l, j k P rob ( cp > l k ( P c (l k. A irect consequence of Lemma 6 is the following corollary. Corollary 7. Let P B,k (l P rob (min( Op j j k l be the cumulative istribution function of the minimum istance among k points following a uniformly i.i. insie the unit ball, an the center of the unit ball, then P B,k (l ( l k. Lemma 8. The expecte value E (min( Op j α j k of the minimum weighteistance among k points following a uniformly i.i. insie the unit ball an the center of the unit ball, with positive α, is given by E (min( Op j α j k ( α B ( k +, α. Proof. Using Corollary 7, we have: E (min( Op j α j k k ( α B l α P B,k(ll k λ α/ ( λ k λ kb ( k +, α. l +α ( l k l ( k, + α Now, we shall obtain the upper-boun, which is more involve. First we will obtain a general expression for the expecte value of min( cp j α j k. Assume δ(c + Oc in what follows. RR n 779

14 P. e Castro & O. Devillers Lemma 9. The expecte value E (min( cp j α j k of the minimum weighteistance among k points following a uniformly i.i. insie the unit ball an c, with positive α, is given by E (min( cp j α j k δ(c αl α ( P c (l k l. Proof. As P c ( an P c (δ(c, integration by parts gives us the following ientity: inria , version - 8 Jan δ(c δ(c α l α P c(lp c i (l δ(c αl α Pc(l i, i >. (3 i From Lemma 6, we also have the following expression for E (min( cp j α j k : E (min( cp j α j k δ(c k i Replacing Eq.(3 in Eq.(4 leas to: kl α P c(l( P c (l k ( i ( k i k ( k δ(c ( i kl α P i c(lpc(ll i i δ(c kl α P c(lp c(ll. i (4 k ( k δ(c ( i αl α P i c(ll i k ( k αl α ( i P i i c(ll i δ(c δ(c i αl α ( P c (l k l. Proof of Theorem 5. Lemma 8 gives us the lower-boun in Theorem 5. Now, if we take a function Ψ(l such that Ψ(l P c (l for l δ(c, it upperbouns the integral in Lemma 9. Take Ψ(l (l/δ(c, then we have: E (min( cp j α j k δ(c δ(c δ(c αl α ( P c (l k l αl α ( Ψ(l k l ( k αl α l δ(c l αδ(c α λ α ( λ k λ ( δ(c α α y (α/ ( y k y ( δ(c α α ( B k +, α. INRIA

15 On the Size of Some Trees Embee in R 3 An thus, δ(c (c on the bounary maximizes the value above. completes the proof. This Remark: The results obtaine here for evenly istribute points in the unit ball (expecte values, ratios, bouns so far are vali for any positive α. Then, we have that the expecte weighte-length of the i-th step s i of EMIT in the unit ball for evenly istribute point is i + B (i +, s i B (i +, i +. Evaluating for n steps leas to inria , version - 8 Jan Ω(log n n+ i n+ i EMIT i i O(log n. Unlike EMST of points evenly istribute insie the unit cube, which converges to a constant as n [], the expecte value of EMIT of points evenly istribute insie the unit ball is Θ(log n. With the same argument, for k > we have that the expecte EMIT k Θ ( log k + n k. References [] D. Alous an J. M. Steele. Asymptotics for eucliean minimal spanning trees on ranom points. Probab. Theory Relate Fiels, 9:47 58, 99. [] Pero Machao Manhães e Castro an Olivier Devillers. Self-Aapting Point Location. Technical report. [3] Luis A. Santaló. Integral Geometry an Geometric Probability. Aison- Wesley, 976. [4] J. M. Steele. Growth rates of eucliean minimal spanning trees with power weighte eges. AnnProb, 6: , 988. [5] J. M. Steele. Cost of sequential connection for points in space. Operations Research Letters, 8:37 4, 989. [6] J. M. Steele an T. L. Snyer. Worst-case growth rates of some classical problems of combinatorial optimization. SIAM J. Comput., 8:78 87, 989. [7] Shu-Ju Tu an Ephraim Fischbach. A new geometric probability technique for an n-imensional sphere an its applications to physics. arxiv.org Mathematical Physics,. RR n 779

16 inria , version - 8 Jan Centre e recherche INRIA Sophia Antipolis Méiterranée 4, route es Lucioles - BP Sophia Antipolis Ceex (France Centre e recherche INRIA Boreaux Su Ouest : Domaine Universitaire - 35, cours e la Libération Talence Ceex Centre e recherche INRIA Grenoble Rhône-Alpes : 655, avenue e l Europe Montbonnot Saint-Ismier Centre e recherche INRIA Lille Nor Europe : Parc Scientifique e la Haute Borne - 4, avenue Halley Villeneuve Ascq Centre e recherche INRIA Nancy Gran Est : LORIA, Technopôle e Nancy-Brabois - Campus scientifique 65, rue u Jarin Botanique - BP Villers-lès-Nancy Ceex Centre e recherche INRIA Paris Rocquencourt : Domaine e Voluceau - Rocquencourt - BP Le Chesnay Ceex Centre e recherche INRIA Rennes Bretagne Atlantique : IRISA, Campus universitaire e Beaulieu Rennes Ceex Centre e recherche INRIA Saclay Île-e-France : Parc Orsay Université - ZAC es Vignes : 4, rue Jacques Mono Orsay Ceex Éiteur INRIA - Domaine e Voluceau - Rocquencourt, BP Le Chesnay Ceex (France ISSN

Maximizing the Cohesion is NP-hard

Maximizing the Cohesion is NP-hard INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Maximizing the Cohesion is NP-hard arxiv:1109.1994v2 [cs.ni] 9 Oct 2011 Adrien Friggeri Eric Fleury N 774 version 2 initial version 8 September

More information

On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells

On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells On the behavior of upwind schemes in the low Mach number limit. IV : P0 Approximation on triangular and tetrahedral cells Hervé Guillard To cite this version: Hervé Guillard. On the behavior of upwind

More information

Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks

Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks Alonso Silva Patricio Reyes Mérouane Debbah N 6854 February 29 Thème

More information

Quartic formulation of Coulomb 3D frictional contact

Quartic formulation of Coulomb 3D frictional contact INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Quartic formulation of Coulomb 3D frictional contact Olivier Bonnefon Gilles Daviet N 0400 January 10, 2011 Modeling, Optimization, and

More information

Multiplication by an Integer Constant: Lower Bounds on the Code Length

Multiplication by an Integer Constant: Lower Bounds on the Code Length INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Multiplication by an Integer Constant: Lower Bounds on the Code Length Vincent Lefèvre N 4493 Juillet 2002 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4493--FR+ENG

More information

A CMA-ES for Mixed-Integer Nonlinear Optimization

A CMA-ES for Mixed-Integer Nonlinear Optimization A CMA-ES for Mixed-Integer Nonlinear Optimization Nikolaus Hansen To cite this version: Nikolaus Hansen. A CMA-ES for Mixed-Integer Nonlinear Optimization. [Research Report] RR-, INRIA.. HAL Id: inria-

More information

A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces

A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A General Framework for Nonlinear Functional Regression with Reproducing Kernel Hilbert Spaces Hachem Kadri Emmanuel Duflos Manuel Davy

More information

Henry law and gas phase disappearance

Henry law and gas phase disappearance INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0904.1195v1 [physics.chem-ph] 7 Apr 2009 Henry law and gas phase disappearance Jérôme Jaffré Amel Sboui apport de recherche N 6891

More information

Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives

Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal and asymptotically optimal CUSUM rules for change point detection in the Brownian Motion model with multiple alternatives Olympia

More information

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach

The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach Cyril Duron, Jean-Marie Proth To cite this version: Cyril Duron, Jean-Marie Proth. The 0-1 Outcomes Feature Selection Problem : a Chi-2 Approach.

More information

A filtering method for the interval eigenvalue problem

A filtering method for the interval eigenvalue problem A filtering method for the interval eigenvalue problem Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. A filtering method for the interval

More information

Bernstein s basis and real root isolation

Bernstein s basis and real root isolation INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Bernstein s basis and real root isolation Bernard Mourrain Fabrice Rouillier Marie-Françoise Roy N 5149 Mars 2004 THÈME 2 N 0249-6399 ISRN

More information

Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions

Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Real-Parameter Black-Box Optimization Benchmarking 2009: Noiseless Functions Definitions Nikolaus Hansen, Steffen Finck, Raymond Ros, Anne Auger To cite this version: Nikolaus Hansen, Steffen Finck, Raymond

More information

Bounds on eigenvalues and singular values of interval matrices

Bounds on eigenvalues and singular values of interval matrices Bounds on eigenvalues and singular values of interval matrices Milan Hladik, David Daney, Elias P. Tsigaridas To cite this version: Milan Hladik, David Daney, Elias P. Tsigaridas. Bounds on eigenvalues

More information

Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions

Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Bound on Run of Zeros and Ones for Images of Floating-Point Numbers by Algebraic Functions Tomas Lang, Jean-Michel Muller To cite this version: Tomas Lang, Jean-Michel Muller Bound on Run of Zeros and

More information

Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model

Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire model Jonathan Touboul To cite this version: Jonathan Touboul. Sensitivity to the cutoff value in the quadratic adaptive integrate-and-fire

More information

Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances

Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Rigid Transformation Estimation in Point Registration Procedures: Study of the Use of Mahalanobis Distances Manuel Yguel To cite this version: Manuel Yguel. Rigid Transformation Estimation in Point Registration

More information

An algorithm for reporting maximal c-cliques

An algorithm for reporting maximal c-cliques An algorithm for reporting maximal c-cliques Frédéric Cazals, Chinmay Karande To cite this version: Frédéric Cazals, Chinmay Karande. An algorithm for reporting maximal c-cliques. [Research Report] RR-5642,

More information

Error Bounds on Complex Floating-Point Multiplication

Error Bounds on Complex Floating-Point Multiplication Error Bounds on Complex Floating-Point Multiplication Richard Brent, Colin Percival, Paul Zimmermann To cite this version: Richard Brent, Colin Percival, Paul Zimmermann. Error Bounds on Complex Floating-Point

More information

Euler scheme for SDEs with non-lipschitz diffusion coefficient: strong convergence

Euler scheme for SDEs with non-lipschitz diffusion coefficient: strong convergence Author manuscript, published in "SAIM: Probability and Statistics 12 (28) 15" INSTITUT NATIONAL D RCHRCH N INFORMATIQU T N AUTOMATIQU uler scheme for SDs with non-lipschitz diffusion coefficient: strong

More information

Delaunay triangulation of a random sample of a good sample has linear size

Delaunay triangulation of a random sample of a good sample has linear size Delaunay triangulation of a random sample of a good sample has linear size Olivier Devillers, Marc Glisse To cite this version: Olivier Devillers, Marc Glisse. Delaunay triangulation of a random sample

More information

Bounded Normal Approximation in Highly Reliable Markovian Systems

Bounded Normal Approximation in Highly Reliable Markovian Systems Bounded Normal Approximation in Highly Reliable Markovian Systems Bruno Tuffin To cite this version: Bruno Tuffin. Bounded Normal Approximation in Highly Reliable Markovian Systems. [Research Report] RR-3020,

More information

Large Triangles in the d-dimensional Unit-Cube (Extended Abstract)

Large Triangles in the d-dimensional Unit-Cube (Extended Abstract) Large Triangles in the -Dimensional Unit-Cube Extene Abstract) Hanno Lefmann Fakultät für Informatik, TU Chemnitz, D-0907 Chemnitz, Germany lefmann@informatik.tu-chemnitz.e Abstract. We consier a variant

More information

A Note on Node Coloring in the SINR Model

A Note on Node Coloring in the SINR Model A Note on Node Coloring in the SINR Model Bilel Derbel, El-Ghazali Talbi To cite this version: Bilel Derbel, El-Ghazali Talbi. A Note on Node Coloring in the SINR Model. [Research Report] RR-7058, INRIA.

More information

CHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold

CHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the

More information

Lower bounds on Locality Sensitive Hashing

Lower bounds on Locality Sensitive Hashing Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

Anti-sparse coding for approximate nearest neighbor search

Anti-sparse coding for approximate nearest neighbor search INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:1110.3767v2 [cs.cv] 25 Oct 2011 Anti-sparse coding for approximate nearest neighbor search Hervé Jégou Teddy Furon Jean-Jacques Fuchs

More information

LECTURE NOTES ON DVORETZKY S THEOREM

LECTURE NOTES ON DVORETZKY S THEOREM LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.

More information

Acute sets in Euclidean spaces

Acute sets in Euclidean spaces Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of

More information

arxiv: v4 [cs.ds] 7 Mar 2014

arxiv: v4 [cs.ds] 7 Mar 2014 Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning

More information

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations

Lecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:

More information

A new flexible Checkpoint/Restart model

A new flexible Checkpoint/Restart model A new flexible Checkpoint/Restart model Mohamed Slim Bouguerra, Denis Trystram, Thierry Gautier, Jean-Marc Vincent To cite this version: Mohamed Slim Bouguerra, Denis Trystram, Thierry Gautier, Jean-Marc

More information

Quantum Mechanics in Three Dimensions

Quantum Mechanics in Three Dimensions Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.

More information

On the enumeration of partitions with summands in arithmetic progression

On the enumeration of partitions with summands in arithmetic progression AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics

More information

Optimal Routing Policy in Two Deterministic Queues

Optimal Routing Policy in Two Deterministic Queues Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal, Emmanuel Hyon To cite this version: Bruno Gaujal, Emmanuel Hyon. Optimal Routing Policy in Two Deterministic Queues. [Research Report] RR-37,

More information

Lecture 5. Symmetric Shearer s Lemma

Lecture 5. Symmetric Shearer s Lemma Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here

More information

A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d

A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition

More information

Parallel bottleneck in the Quasineutrality solver embedded in GYSELA

Parallel bottleneck in the Quasineutrality solver embedded in GYSELA INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Parallel bottleneck in the Quasineutrality solver embedded in GYSELA G. Latu N. Crouseilles V. Grandgirard N 7595 Avril 2011 Domaine 1 apport

More information

Optimal Routing Policy in Two Deterministic Queues

Optimal Routing Policy in Two Deterministic Queues INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal Emmanuel Hyon N 3997 Septembre 2000 THÈME 1 ISSN 0249-6399 ISRN INRIA/RR--3997--FR+ENG

More information

Ramsey numbers of some bipartite graphs versus complete graphs

Ramsey numbers of some bipartite graphs versus complete graphs Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

Sharp Thresholds. Zachary Hamaker. March 15, 2010

Sharp Thresholds. Zachary Hamaker. March 15, 2010 Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior

More information

Introduction to the Vlasov-Poisson system

Introduction to the Vlasov-Poisson system Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its

More information

Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models

Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Numerical modification of atmospheric models to include the feedback of oceanic currents on air-sea fluxes in ocean-atmosphere coupled models Florian Lemarié To cite this version: Florian Lemarié. Numerical

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

ISSN ISRN INRIA/RR FR+ENG. apport de recherche

ISSN ISRN INRIA/RR FR+ENG. apport de recherche INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE 3914 Analytic Combinatorics of Chord Diagrams Philippe Flajolet, Marc Noy N3914 March 2000 THEME 2 ISSN 0249-6399 ISRN INRIA/RR--3914--FR+ENG

More information

12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011

12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 1 th Annual Johns Hopkins Math Tournament Saturay, February 19, 011 Geometry Subject Test 1. [105] Let D x,y enote the half-isk of raius 1 with its curve bounary externally tangent to the unit circle at

More information

Geometry and Numerics of CMC Surfaces with Radial Metrics

Geometry and Numerics of CMC Surfaces with Radial Metrics INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Geometry and Numerics of CMC Surfaces with Radial Metrics Gabriel Dos Reis N 4763 Mars 2003 THÈME 2 ISSN 0249-6399 ISRN INRIA/RR--4763--FRENG

More information

12.11 Laplace s Equation in Cylindrical and

12.11 Laplace s Equation in Cylindrical and SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering

More information

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory

More information

Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing

Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Closed-Form Solution to the Structure from Motion Problem by Fusing Visual and Inertial Sensing Agostino Martinelli N???? Mai 2012 Thèmes

More information

Prof. Dr. Ibraheem Nasser electric_charhe 9/22/2017 ELECTRIC CHARGE

Prof. Dr. Ibraheem Nasser electric_charhe 9/22/2017 ELECTRIC CHARGE ELECTRIC CHARGE Introuction: Orinary matter consists of atoms. Each atom consists of a nucleus, consisting of protons an neutrons, surroune by a number of electrons. In electricity, the electric charge

More information

Iterative Methods for Model Reduction by Domain Decomposition

Iterative Methods for Model Reduction by Domain Decomposition INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE arxiv:0712.0691v1 [physics.class-ph] 5 Dec 2007 Iterative Methods for Model Reduction by Domain Decomposition Marcelo Buffoni Haysam Telib

More information

A distributed algorithm for computing and updating the process number of a forest

A distributed algorithm for computing and updating the process number of a forest INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE A distributed algorithm for computing and updating the process number of a forest David Coudert Florian Huc Dorian Mazauric N 6560 June

More information

Global Gene Regulation in Metabolic Networks

Global Gene Regulation in Metabolic Networks Global Gene Regulation in Metabolic Networks Diego Oyarzun, Madalena Chaves To cite this version: Diego Oyarzun, Madalena Chaves. Global Gene Regulation in Metabolic Networks. [Research Report] RR-7468,

More information

REAL ANALYSIS I HOMEWORK 5

REAL ANALYSIS I HOMEWORK 5 REAL ANALYSIS I HOMEWORK 5 CİHAN BAHRAN The questions are from Stein an Shakarchi s text, Chapter 3. 1. Suppose ϕ is an integrable function on R with R ϕ(x)x = 1. Let K δ(x) = δ ϕ(x/δ), δ > 0. (a) Prove

More information

Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices

Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices Fanny Dufossé, Bora Uçar To cite this version: Fanny Dufossé, Bora Uçar. Notes on Birkhoff-von Neumann decomposition of doubly

More information

Permanent vs. Determinant

Permanent vs. Determinant Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an

More information

Math 1271 Solutions for Fall 2005 Final Exam

Math 1271 Solutions for Fall 2005 Final Exam Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly

More information

arxiv: v1 [math.mg] 10 Apr 2018

arxiv: v1 [math.mg] 10 Apr 2018 ON THE VOLUME BOUND IN THE DVORETZKY ROGERS LEMMA FERENC FODOR, MÁRTON NASZÓDI, AND TAMÁS ZARNÓCZ arxiv:1804.03444v1 [math.mg] 10 Apr 2018 Abstract. The classical Dvoretzky Rogers lemma provies a eterministic

More information

Throughput optimization for micro-factories subject to failures

Throughput optimization for micro-factories subject to failures Throughput optimization for micro-factories subject to failures Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe To cite this version: Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod,

More information

Stability and regulation of nonsmooth dynamical systems

Stability and regulation of nonsmooth dynamical systems Stability and regulation of nonsmooth dynamical systems Sophie Chareyron, Pierre-Brice Wieber To cite this version: Sophie Chareyron, Pierre-Brice Wieber. Stability and regulation of nonsmooth dynamical

More information

On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane

On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE On the Holonomy or Algebraicity of Generating Functions Counting Lattice Walks in the Quarter-Plane arxiv:1004.1733v1 [math.pr] 10 Apr 2010

More information

Separation of Variables

Separation of Variables Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical

More information

On non-antipodal binary completely regular codes

On non-antipodal binary completely regular codes Discrete Mathematics 308 (2008) 3508 3525 www.elsevier.com/locate/isc On non-antipoal binary completely regular coes J. Borges a, J. Rifà a, V.A. Zinoviev b a Department of Information an Communications

More information

A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz

A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae

More information

Online Distributed Traffic Grooming on Path Networks

Online Distributed Traffic Grooming on Path Networks INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Online Distributed Traffic Grooming on Path Networks Jean-Claude Bermond David Coudert Joseph Peters N 6833 February 2009 Thème COM apport

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

Boundary Control Problems for Shape Memory Alloys under State Constraints

Boundary Control Problems for Shape Memory Alloys under State Constraints INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Boundary Control Problems for Shape Memory Alloys under State Constraints Nikolaus Bubner, Jan Sokołowski and Jürgen Sprekels N 2994 Octobre

More information

Math 115 Section 018 Course Note

Math 115 Section 018 Course Note Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of

More information

arxiv: v2 [math.cv] 2 Mar 2018

arxiv: v2 [math.cv] 2 Mar 2018 The quaternionic Gauss-Lucas Theorem Riccaro Ghiloni Alessanro Perotti Department of Mathematics, University of Trento Via Sommarive 14, I-38123 Povo Trento, Italy riccaro.ghiloni@unitn.it, alessanro.perotti@unitn.it

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

Counting eigenvalues in domains of the complex field

Counting eigenvalues in domains of the complex field Counting eigenvalues in domains of the complex field Emmanuel Kamgnia, Bernard Philippe To cite this version: Emmanuel Kamgnia, Bernard Philippe. Counting eigenvalues in domains of the complex field. INRIA.

More information

A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations

A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations A hybridizable discontinuous Galerkin method for time-harmonic Maxwell s equations Stéphane Lanteri, Liang Li, Ronan Perrussel To cite this version: Stéphane Lanteri, Liang Li, Ronan Perrussel. A hybridizable

More information

x f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.

x f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0. Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?

More information

DIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 7. Geodesics and the Theorem of Gauss-Bonnet

DIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 7. Geodesics and the Theorem of Gauss-Bonnet A P Q O B DIFFERENTIAL GEOMETRY OF CURVES AND SURFACES 7. Geoesics an the Theorem of Gauss-Bonnet 7.. Geoesics on a Surface. The goal of this section is to give an answer to the following question. Question.

More information

Generalized Optimization Framework for Graph-based Semi-supervised Learning

Generalized Optimization Framework for Graph-based Semi-supervised Learning INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Generalized Optimization Framework for Graph-based Semi-supervised Learning Konstantin Avrachenkov Paulo Gonçalves Alexey Mishenin Marina

More information

Combining Mixture Components for Clustering

Combining Mixture Components for Clustering INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Combining Mixture Components for Clustering Jean-Patrick Baudry Adrian E. Raftery Gilles Celeux enneth Lo Raphael Gottardo inria-319, version

More information

x f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.

x f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0. Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?

More information

Space Time relaying versus Information Causality

Space Time relaying versus Information Causality Space Time relaying versus Information Causality Philippe Jacquet To cite this version: Philippe Jacquet. Space Time relaying versus Information Causality. [Research Report] RR-648, INRIA. 008, pp.15.

More information

1 Math 285 Homework Problem List for S2016

1 Math 285 Homework Problem List for S2016 1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:

More information

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM

More information

LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS

LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS Ann. Sci. Math. Québec 33 (2009), no 2, 115 123 LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS TAKASHI AGOH Deicate to Paulo Ribenboim on the occasion of his 80th birthay. RÉSUMÉ.

More information

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+

More information

Optimal control of state constrained integral equations

Optimal control of state constrained integral equations INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal control of state constrained integral equations J. Frédéric Bonnans Constanza de la Vega inria-473952, version 1-16 Apr 21 N 7257

More information

Homework 3 - Solutions

Homework 3 - Solutions Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator

More information

u!i = a T u = 0. Then S satisfies

u!i = a T u = 0. Then S satisfies Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace

More information

UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics

UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics UC Berkeley Department of Electrical Engineering an Computer Science Department of Statistics EECS 8B / STAT 4B Avance Topics in Statistical Learning Theory Solutions 3 Spring 9 Solution 3. For parti,

More information

ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS

ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an

More information

Unit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule

Unit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin

More information

7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then

7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then 7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,

More information

Rare event simulation for a static distribution

Rare event simulation for a static distribution INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Rare event simulation for a static distribution F. Cérou P. Del Moral T. Furon A. Guyader N 6792 Janvier 2009 Thèmes COG et NUM apport de

More information

Supervised Dictionary Learning

Supervised Dictionary Learning INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Supervised Dictionary Learning Julien Mairal Francis Bach Jean Ponce Guillermo Sapiro Andrew Zisserman N 6652 September 2008 Thème COG apport

More information

Some Examples. Uniform motion. Poisson processes on the real line

Some Examples. Uniform motion. Poisson processes on the real line Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]

More information

On colour-blind distinguishing colour pallets in regular graphs

On colour-blind distinguishing colour pallets in regular graphs J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article

More information

Triangles to Capture Social Cohesion

Triangles to Capture Social Cohesion Triangles to Capture Social Cohesion Adrien Friggeri, Guillaume Chelius, Eric Fleury To cite this version: Adrien Friggeri, Guillaume Chelius, Eric Fleury. Triangles to Capture Social Cohesion. [Research

More information

Performance de Compound TCP en présence de pertes aléatoires

Performance de Compound TCP en présence de pertes aléatoires INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Performance de Compound TCP en présence de pertes aléatoires Alberto Blanc Konstantin Avrachenkov Denis Collange Giovanni Neglia N 6736

More information