On Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below
|
|
- Egbert Cross
- 6 years ago
- Views:
Transcription
1 O Algorithm for the Miimum Spaig Trees Problem with Diameter Bouded Below Edward Kh. Gimadi 1,2, Alexey M. Istomi 1, ad Ekateria Yu. Shi 2 1 Sobolev Istitute of Mathematics, 4 Acad. Koptyug aveue, Novosibirsk, Russia 2 Novosibirsk State Uiversity, 2 Pirogova Str , Novosibirsk, Russia gimadi@math.sc.ru, alexeyistomi@gmail.com, Shius90@yadex.ru Abstract. The miimum spaig trees problem is to fid k edge-disjoit spaig trees i a give udirected weighted graph. It ca be solved i polyomial time. I the k miimum spaig trees problem with diameter bouded below (k-mstbb there is a additioal requiremet: a diameter of every spaig tree must be ot less tha some predefied value d. The k-mstbb is NP - hard. We propose a asymptotically optimal polyomial time algorithm to solve this problem. Keywords: miimum spaig tree, miimum spaig trees problem, asymptotically optimal algorithm, probabilistic aalysis, bouded below, performace guaratees, radom iputs Itroductio The Miimum Spaig Tree (MST problem is oe of the classic discrete optimizatio problems. Give G = (V, E udirected weighted graph, the MST is to fid a spaig tree of a miimal weight. The MST is polyomially solvable, there are classic algorithms by Boruvka (1926, Kruskal (1956 ad Prim (1957. These algorithms have complexity O( 2 ad O(M log where M = E ad = V. The Miimum Spaig Tree with diameter Bouded Below (MSTBB problem is a atural geeralizatio of the MST problem. I the MSTBB aim is to fid a spaig tree of a miimal weight such that its diameter is ot less tha some predefied value d. Diameter of a tree is defied as the umber of edges o the logest path betwee two leaves i the tree. The MSTBB is studied i [6]. It is NP-hard sice with d = 1 it is equivalet to the problem of fidig Hamiltoia Path of a miimal weight i a give graph. Moreover if d is costat the the MSTBB ca be solved i polyomial time by iteratig through all possible simple paths cosistig exactly of d edges. Thus MSTBB is actual with d growig. By F A (I ad OP T (I we deote respectively the approximate (obtaied by some approximatio algorithm A ad the optimum value of the objective fuctio of the Copyright c by the paper s authors. Copyig permitted for private ad academic purposes. I: A. Kooov et al. (eds.: DOOR 2016, Vladivostok, Russia, published at
2 12 Edward Kh. Gimadi, Alexey M. Istomi, Ekateria Yu. Shi problem o the iput I. Accordig to [5] a algorithm A is said to have performace guaratees ( ε A (, δ A ( o the set of radom iputs of the problem of the size, if { Pr F A (I > ( 1 + ε A ( } OP T (I δ A (, (1 where ε A ( is a assessmet of the relative error of the solutio obtaied by algorithm A, δ A ( is a estimatio of the failure probability of the algorithm, which is equal to the proportio of cases whe the algorithm does ot hold the relative error ε A ( or does ot produce ay aswer at all. A algorithm A is called asymptotically optimal o the class of istaces of the problem, if there are such performace guaratees that ε A ( 0 ad δ A ( 0 as. Let us deote by UNI(a, b a class of complete graphs with vertices where weights of edges are idepedet idetically distributed radom variables with uiform distributio o a segmet [a, b ]. By EXP(a, α we will deote a class of complete graphs with vertices where weights of edges are idepedet idetically distributed radom variables with expoetial distributio with a probability fuctio p(x = { 1 α exp ( x a α, if a x <, 0, otherwise. Ad by N(a, σ we will deote a class of complete graphs with vertices where weights of edges are idepedet idetically distributed radom variables with cuttedormal distributio with a probability fuctio p(x = { 2 2πσ 2 exp ( (x a 2 2σ 2, if a x <, 0, otherwise. I [6] preseted a asymptotically optimal algorithm à with complexity O(2 for graphs which belog to UNI(a, b class. O the first stage algorithm à build a path P = {(i 0, i 1, (i 1, i 2,..., (i d 1, i d } of d edges startig from a arbitrary vertex i 0 ad elargig it by addig successive edges of a miimal weight. O the secod stage a spaig tree of a miimal weight D which cotais path P is built usig Prim algorithm. Built tree is take as a solutio. The algorithm à o graphs which belog to UNI(a, b class has the followig performace guaratees: So, à is asymptotically optimal if ( b /a ε = O / l 1, δ = e 0.25( d. d b /a l, d = o(. The same result but for graphs with ulimited edges weights was preseted i [7], where preseted aalysis of algorithm à for graphs from classes EXP(a, α ad
3 O Algorithm for the k-mstbb 13 N(a, σ. It is show that à fids a solutio with performace guaratees: ( β /a ε = O, δ = O(1/. /l Thus the algorithm is asymptotically optimal i the case the β ( = o, a l where β = α for the graphs from EXP(a, α ad σ i the case of N(a, σ. Aother geeralizatio of the MST problem is the problem of fidig k edge-disjoit spaig trees of a miimal total weight (k-msts. The k-msts is also polyomially solvable, i [4] by Roskid ad Tarja was preseted a algorithm with complexity O( 2 log( + 2 k 2. I curret work a modificatio of the k-msts is cosidered where the aim is to fid k edge-disjoit spaig trees of a miimal total weight such that every tree has a diameter ot less tha some predefied value d. We will call this problem as k miimum spaig trees problem with diameter bouded below (k-mstbb. It is NP-hard sice with d = 1 ad k = 1 it is equivalet to a problem of fidig Hamiltoia Path of a miimal weight i a give graph. We propose a polyomial time algorithm to solve the k-mstbb problem. The algorithm builds k edge-disjoit Hamiltoia chais with d edges each o the preselected set of d + 1 vertices. The by the algorithm by Roskid ad Tarja [4] edge-disjoit spaig trees i the umber of k cotaiig these chais are foud. Also we preset performace guaratees of the algorithm ad sufficiet coditios of asymptotic optimality for the graphs from UNI(a, b. 1 New algorithm A k Let us cosider G = (V, E, a udirected complete -vertex graph belogig to UNI(a, b. Our ew algorithm is based o ideas of from [6], uses the algorithm by Roskid ad Tarja [4] ad algorithm A AV [1] which builds a Hamiltoia path i a give arbitrary graph G p with probability 1 δ AV. Algorithm A k : 1. Build k paths with a umber of edges of d o the set of d + 1 vertices. (a Radomly remove all but d + 1 vertices from graph G, get G[d] iducted by the set of vertices left. (b Build subgraphs G 1 [d],..., G k [d] by a radom procedure: every edge from G[d] radomly gets oe color betwee 1 ad k. (c Remove all edges from G 1 [d],..., G k [d] which weight more tha some threshold w, so we get graphs G 1 w[d],..., G k w[d]. (d I G 1 w[d],..., G k w[d] fid Hamiltoia paths by the algorithm A AV.
4 14 Edward Kh. Gimadi, Alexey M. Istomi, Ekateria Yu. Shi 2. By the Roskid-Tarja algorithm fid k edges-disjoit spaig trees cotaiig paths built o the previous step. Threshold value w must be chose i a way that G i w[d] cotais a Hamiltoia path. I [2] it was established that o a d + 1 vertex graph where edge exists with a probability p if the value of p is so that graph cotais more tha c(d + 1 log(d + 1 edges, the graph will have a Hamiltoia path. I the paper [1] preseted a algorithm A AV to fid such Hamiltoia path with high probability (whp i O(d l 2 d time. Theorem 1. [1] For all α > 0 there exists a K(α such that if the umber of edges i a radom graph N > (α + K(α(d + 1 l(d + 1, where K(α is sufficietly large, the probability that algorithm A AV fids a Hamiltoia path is 1 O(d α. We will deote a threshold value of algorithm A AV as c AV = (α + K(α. Now let us formulate a Lemma to provide a estimatio of probability that G i w[d] cotais eough edges for A AV to succeed. Lemma 1. The probability that G i w[d] cotais less tha N edges is less tha e d if p 4(N+d ( 1. Proof. δ N = P r{g i w[d] cotais less tha N edges } = Now by the iequality (1 βp k=0 N 1 k=0 ( p k (1 p k e β2 p 2. k ( d(d 1 2 p k (1 p d(d 1 2 k. k which is correct for all, p, β, where is iteger, p [0, 1] ad β [0, 1], we get if p 4(N+d d(d 1. δ N e d(d 1 4 p+n e d, Let s deote δ AV a probability of a case whe the algorithm A AV was uable to give us a solutio: G i w[d] had ot eough edges or algorithm A AV retured failure. By Theorem 1 ad Lemma 1 δ AV = O(d α + e d. Let D be a solutio of the k-mstbb foud by algorithm A k o a -vertex graph. By w 0 we will deote a weight of solutio of the k-msts. Now, let us formulate the followig Lemma. Lemma 2. If all C i, i {1, 2,... k}, were successfully built by the algorithm A k, the w( D w 0 + w(c w(c k kda.
5 O Algorithm for the k-mstbb 15 Proof. It is obvious that D is a solutio of the k-msts problem with a modified weight fuctio, if w ij is a origial weight of a edge (i, j the modified oe will be w ij, if (i, j / k C t, w ij = t=1 a, if k C t. D is a group of k edge-disjoit spaig trees with a miimum total weight amog a set D of all possible groups of k edge-disjoit spaig trees, where edges weights are w ij. O the oe had we have: mi w ij D D = w ij = (i,j D (i,j D w ij w ij + w( D w(c 1... w(c k = (i,j C 1 (i,j C k t=1 kda + w( D w(c 1... w(c k. O the other had, sice w ij w ij: mi w ij D D mi w ij D D = (i,j D (i,j D mi {w(d D D } = w 0. Combiatio of these two iequalities gives us the result of the Lemma. Lemma 3. If C i was successfully built by the algorithm A k, the w(c i da + 5kc AV (b a log d, i = 1,..., k, where c AV is a threshold value defied for algorithm A AV by Theorem 1 [1]. Proof. Let i {1,..., k}. Let w be (b a p + a, sice edges weights have uiform distributio o a segmet [a, b ] (we are cosiderig graphs from class UNI(a, b, the probability that a edge have weight less tha w is equal to p. To grat to algorithm A AV a possibility to fid a Hamiltoia path graph G i w[d] must have more tha c AV (d+ 1 log(d + 1 edges. Together with Lemma 1 it meas p 5kc AV log d d. It give us that every edge i G i w[d] has weight less tha C i cotais d edges, so 5kc AV (b a log d d + a. w(c i 5kc AV (b a log d + da.
6 16 Edward Kh. Gimadi, Alexey M. Istomi, Ekateria Yu. Shi Theorem 2. Algorithm A k has the followig performace guaratees: ε = 5kc AV log d b a a, ( ( 1 δ = O k d α + 1 e d, where c AV = (α + K(α is a costat, α > 0. Proof. Let us first assume that we are uder the coditio that every C i, i = 1,..., k, was successfully foud by the algorithm A AV. Usig iequality ka w 0 w( D ad Lemma 2 we have: { P r w( D > (1 + ε w } P r {w 0 + w(c w(c k kda > (1 + ε w } P r {w(c w(c k kda > ε w } P r {w(c w(c k kda > ε ka }. The last probability equals to zero sice the iequality iside is always false due to the defiitio of ε ad Lemma 3 uder the assumptio that every C i, i = 1,..., k, was successfully foud by the algorithm A AV. A probability that C i was successfully foud is 1 δ AV, it give us the followig expressio for the value of the failure probability of the algorithm A k : δ = 1 k (1 δ AV i=1 k i=1 ( ( 1 δ AV = kδ AV = O k d α + 1. d Theorem 3. The algorithm A k is asymptotically optimal if d as, d = o( ad b /a = o(/ log. Proof. It follows from the Theorem 2. 2 Coclusio The problem of fidig k miimum spaig trees with diameter bouded below was studied. The polyomial algorithm was preseted, its performace guaratees ad sufficiet coditios of beig asymptotically optimal were foud for the case where edges weights have idepedet uiform distributio o a segmet [a, b ], b > a > 0. Further aalysis of this problem o graphs with other distributios of edges weights, for example a case whe a = 0, is of a big iterest. Ackowledgmets. This research was supported by the Russia Foudatio for Basic Research (grats ad
7 O Algorithm for the k-mstbb 17 Refereces 1. Aglui D.,Valiat L.G.: Fast probabilistic algorithms for Hamiltoia circuits ad matchigs. Joural of Computer ad System Scieces, Vol 18(2, ( Erdos P., Reyi A.: O radom graphs I, Publ. Math. Debrece 6, , ( Petrov V.V.: Limit Theorems of Probability Theory. Sequeces of Idepedet Radom Variables. Claredo Press, Oxford, 304 p., ( Roskid J. ad Tarja R. E.: ote o fidig miimum-cost edge-disjoit spaig trees. Math. Oper. Res., 10 (1985, 4, Gimadi E.Kh., Glebov N.I., ad Perepelitsa V.A.: Algorithms with Estimates for Discrete Optimizatio Problems. Probl. Kiber., (1975, o. 31, pp (i Russia 6. Gimadi E. Kh., Serdyukov A. I.: A algorithm for fidig the miimum spaig tree with a diameter bouded from below. Diskret. Aal. Issled. Oper., Ser. 1, 7(2 (2000, 3-11 (i Russia 7. Gimadi E. Kh., Shi E. Yu.: Probabilistic aalysis of a algorithm for the miimum spaig tree problem with diameter bouded below. Joural of Applied ad Idustrial Mathematics (October 2015, Volume 9, Issue 4,
Application to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationA note on log-concave random graphs
A ote o log-cocave radom graphs Ala Frieze ad Tomasz Tocz Departmet of Mathematical Scieces, Caregie Mello Uiversity, Pittsburgh PA53, USA Jue, 08 Abstract We establish a threshold for the coectivity of
More informationOn matchings in hypergraphs
O matchigs i hypergraphs Peter Frakl Tokyo, Japa peter.frakl@gmail.com Tomasz Luczak Adam Mickiewicz Uiversity Faculty of Mathematics ad CS Pozań, Polad ad Emory Uiversity Departmet of Mathematics ad CS
More informationLecture 2 Long paths in random graphs
Lecture Log paths i radom graphs 1 Itroductio I this lecture we treat the appearace of log paths ad cycles i sparse radom graphs. will wor with the probability space G(, p) of biomial radom graphs, aalogous
More informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationPolynomial identity testing and global minimum cut
CHAPTER 6 Polyomial idetity testig ad global miimum cut I this lecture we will cosider two further problems that ca be solved usig probabilistic algorithms. I the first half, we will cosider the problem
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationLecture 23: Minimal sufficiency
Lecture 23: Miimal sufficiecy Maximal reductio without loss of iformatio There are may sufficiet statistics for a give problem. I fact, X (the whole data set) is sufficiet. If T is a sufficiet statistic
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationSolutions for the Exam 9 January 2012
Mastermath ad LNMB Course: Discrete Optimizatio Solutios for the Exam 9 Jauary 2012 Utrecht Uiversity, Educatorium, 15:15 18:15 The examiatio lasts 3 hours. Gradig will be doe before Jauary 23, 2012. Studets
More informationSome special clique problems
Some special clique problems Reate Witer Istitut für Iformatik Marti-Luther-Uiversität Halle-Witteberg Vo-Seckedorff-Platz, D 0620 Halle Saale Germay Abstract: We cosider graphs with cliques of size k
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationIndependence number of graphs with a prescribed number of cliques
Idepedece umber of graphs with a prescribed umber of cliques Tom Bohma Dhruv Mubayi Abstract We cosider the followig problem posed by Erdős i 1962. Suppose that G is a -vertex graph where the umber of
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationON POINTWISE BINOMIAL APPROXIMATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece
More informationBalanced coloring of bipartite graphs
Balaced colorig of bipartite graphs Uriel Feige Shimo Koga Departmet of Computer Sciece ad Applied Mathematics Weizma Istitute, Rehovot 76100, Israel uriel.feige@weizma.ac.il Jue 16, 009 Abstract Give
More informationDifferentiable Convex Functions
Differetiable Covex Fuctios The followig picture motivates Theorem 11. f ( x) f ( x) f '( x)( x x) ˆx x 1 Theorem 11 : Let f : R R be differetiable. The, f is covex o the covex set C R if, ad oly if for
More informationElement sampling: Part 2
Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig
More informationOn size multipartite Ramsey numbers for stars versus paths and cycles
Electroic Joural of Graph Theory ad Applicatios 5 (1) (2017), 4 50 O size multipartite Ramsey umbers for stars versus paths ad cycles Aie Lusiai 1, Edy Tri Baskoro, Suhadi Wido Saputro Combiatorial Mathematics
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationSelf-normalized deviation inequalities with application to t-statistic
Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric
More informationThe random version of Dvoretzky s theorem in l n
The radom versio of Dvoretzky s theorem i l Gideo Schechtma Abstract We show that with high probability a sectio of the l ball of dimesio k cε log c > 0 a uiversal costat) is ε close to a multiple of the
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationSpectral Partitioning in the Planted Partition Model
Spectral Graph Theory Lecture 21 Spectral Partitioig i the Plated Partitio Model Daiel A. Spielma November 11, 2009 21.1 Itroductio I this lecture, we will perform a crude aalysis of the performace of
More informationA Note on the Kolmogorov-Feller Weak Law of Large Numbers
Joural of Mathematical Research with Applicatios Mar., 015, Vol. 35, No., pp. 3 8 DOI:10.3770/j.iss:095-651.015.0.013 Http://jmre.dlut.edu.c A Note o the Kolmogorov-Feller Weak Law of Large Numbers Yachu
More informationBI-INDUCED SUBGRAPHS AND STABILITY NUMBER *
Yugoslav Joural of Operatios Research 14 (2004), Number 1, 27-32 BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * I E ZVEROVICH, O I ZVEROVICH RUTCOR Rutgers Ceter for Operatios Research, Rutgers Uiversity,
More informationarxiv: v3 [math.co] 6 Aug 2014
NEAR PERFECT MATCHINGS IN -UNIFORM HYPERGRAPHS arxiv:1404.1136v3 [math.co] 6 Aug 2014 JIE HAN Abstract. Let H be a -uiform hypergraph o vertices where is a sufficietly large iteger ot divisible by. We
More informationFundamental Theorem of Algebra. Yvonne Lai March 2010
Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More informationRecursive Algorithms. Recurrences. Recursive Algorithms Analysis
Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects
More informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationCS322: Network Analysis. Problem Set 2 - Fall 2009
Due October 9 009 i class CS3: Network Aalysis Problem Set - Fall 009 If you have ay questios regardig the problems set, sed a email to the course assistats: simlac@staford.edu ad peleato@staford.edu.
More informationSRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l
SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/
More informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationTechnische Universität Ilmenau Institut für Mathematik
Techische Uiversität Ilmeau Istitut für Mathematik Preprit No. M 07/09 Domiatio i graphs of miimum degree at least two ad large girth Löwestei, Christia; Rautebach, Dieter 2007 Impressum: Hrsg.: Leiter
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationIT is well known that Brouwer s fixed point theorem can
IAENG Iteratioal Joural of Applied Mathematics, 4:, IJAM_4 0 Costructive Proof of Brouwer s Fixed Poit Theorem for Sequetially Locally No-costat ad Uiformly Sequetially Cotiuous Fuctios Yasuhito Taaka,
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationLinear chord diagrams with long chords
Liear chord diagrams with log chords Everett Sulliva Departmet of Mathematics Dartmouth College Haover New Hampshire, U.S.A. everett..sulliva@dartmouth.edu Submitted: Feb 7, 2017; Accepted: Oct 7, 2017;
More informationLecture 7: October 18, 2017
Iformatio ad Codig Theory Autum 207 Lecturer: Madhur Tulsiai Lecture 7: October 8, 207 Biary hypothesis testig I this lecture, we apply the tools developed i the past few lectures to uderstad the problem
More informationECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015
ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],
More informationAnalytic Continuation
Aalytic Cotiuatio The stadard example of this is give by Example Let h (z) = 1 + z + z 2 + z 3 +... kow to coverge oly for z < 1. I fact h (z) = 1/ (1 z) for such z. Yet H (z) = 1/ (1 z) is defied for
More informationPRACTICE FINAL/STUDY GUIDE SOLUTIONS
Last edited December 9, 03 at 4:33pm) Feel free to sed me ay feedback, icludig commets, typos, ad mathematical errors Problem Give the precise meaig of the followig statemets i) a f) L ii) a + f) L iii)
More informationResearch Article A New Second-Order Iteration Method for Solving Nonlinear Equations
Abstract ad Applied Aalysis Volume 2013, Article ID 487062, 4 pages http://dx.doi.org/10.1155/2013/487062 Research Article A New Secod-Order Iteratio Method for Solvig Noliear Equatios Shi Mi Kag, 1 Arif
More informationDimension-free PAC-Bayesian bounds for the estimation of the mean of a random vector
Dimesio-free PAC-Bayesia bouds for the estimatio of the mea of a radom vector Olivier Catoi CREST CNRS UMR 9194 Uiversité Paris Saclay olivier.catoi@esae.fr Ilaria Giulii Laboratoire de Probabilités et
More informationBest bounds for dispersion of ratio block sequences for certain subsets of integers
Aales Mathematicae et Iformaticae 49 (08 pp. 55 60 doi: 0.33039/ami.08.05.006 http://ami.ui-eszterhazy.hu Best bouds for dispersio of ratio block sequeces for certai subsets of itegers József Bukor Peter
More informationA Note on Matrix Rigidity
A Note o Matrix Rigidity Joel Friedma Departmet of Computer Sciece Priceto Uiversity Priceto, NJ 08544 Jue 25, 1990 Revised October 25, 1991 Abstract I this paper we give a explicit costructio of matrices
More informationMa/CS 6b Class 19: Extremal Graph Theory
/9/05 Ma/CS 6b Class 9: Extremal Graph Theory Paul Turá By Adam Sheffer Extremal Graph Theory The subfield of extremal graph theory deals with questios of the form: What is the maximum umber of edges that
More informationDECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More informationSome remarks on the paper Some elementary inequalities of G. Bennett
Soe rears o the paper Soe eleetary iequalities of G. Beett Dag Ah Tua ad Luu Quag Bay Vieta Natioal Uiversity - Haoi Uiversity of Sciece Abstract We give soe couterexaples ad soe rears of soe of the corollaries
More informationDisjoint set (Union-Find)
CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed
More informationMaximal sets of integers not containing k + 1 pairwise coprimes and having divisors from a specified set of primes
EuroComb 2005 DMTCS proc. AE, 2005, 335 340 Maximal sets of itegers ot cotaiig k + 1 pairwise coprimes ad havig divisors from a specified set of primes Vladimir Bliovsky 1 Bielefeld Uiversity, Math. Dept.,
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationApproximations and more PMFs and PDFs
Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationDECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More informationAnalysis of Algorithms. Introduction. Contents
Itroductio The focus of this module is mathematical aspects of algorithms. Our mai focus is aalysis of algorithms, which meas evaluatig efficiecy of algorithms by aalytical ad mathematical methods. We
More informationSequences and Limits
Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q
More informationResearch Article Complete Convergence for Maximal Sums of Negatively Associated Random Variables
Hidawi Publishig Corporatio Joural of Probability ad Statistics Volume 010, Article ID 764043, 17 pages doi:10.1155/010/764043 Research Article Complete Covergece for Maximal Sums of Negatively Associated
More informationMetric Space Properties
Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All
More informationA GRÜSS TYPE INEQUALITY FOR SEQUENCES OF VECTORS IN NORMED LINEAR SPACES AND APPLICATIONS
A GRÜSS TYPE INEQUALITY FOR SEQUENCES OF VECTORS IN NORMED LINEAR SPACES AND APPLICATIONS S. S. DRAGOMIR Abstract. A discrete iequality of Grüss type i ormed liear spaces ad applicatios for the discrete
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationCSE 202 Homework 1 Matthias Springer, A Yes, there does always exist a perfect matching without a strong instability.
CSE 0 Homework 1 Matthias Spriger, A9950078 1 Problem 1 Notatio a b meas that a is matched to b. a < b c meas that b likes c more tha a. Equality idicates a tie. Strog istability Yes, there does always
More informationProbability theory and mathematical statistics:
N.I. Lobachevsky State Uiversity of Nizhi Novgorod Probability theory ad mathematical statistics: Law of Total Probability. Associate Professor A.V. Zorie Law of Total Probability. 1 / 14 Theorem Let H
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationSOME GENERALIZATIONS OF OLIVIER S THEOREM
SOME GENERALIZATIONS OF OLIVIER S THEOREM Alai Faisat, Sait-Étiee, Georges Grekos, Sait-Étiee, Ladislav Mišík Ostrava (Received Jauary 27, 2006) Abstract. Let a be a coverget series of positive real umbers.
More informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
More informationRecursive Algorithm for Generating Partitions of an Integer. 1 Preliminary
Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the
More informationInformation Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame
Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for
More informationAda Boost, Risk Bounds, Concentration Inequalities. 1 AdaBoost and Estimates of Conditional Probabilities
CS8B/Stat4B Sprig 008) Statistical Learig Theory Lecture: Ada Boost, Risk Bouds, Cocetratio Iequalities Lecturer: Peter Bartlett Scribe: Subhrasu Maji AdaBoost ad Estimates of Coditioal Probabilities We
More informationk-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction
Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)
More informationLecture 2 Clustering Part II
COMS 4995: Usupervised Learig (Summer 8) May 24, 208 Lecture 2 Clusterig Part II Istructor: Nakul Verma Scribes: Jie Li, Yadi Rozov Today, we will be talkig about the hardess results for k-meas. More specifically,
More informationLecture 14: Randomized Computation (cont.)
CSE 200 Computability ad Complexity Wedesday, May 15, 2013 Lecture 14: Radomized Computatio (cot.) Istructor: Professor Shachar Lovett Scribe: Dogcai She 1 Radmized Algorithm Examples 1.1 The k-th Elemet
More informationLecture 9: Hierarchy Theorems
IAS/PCMI Summer Sessio 2000 Clay Mathematics Udergraduate Program Basic Course o Computatioal Complexity Lecture 9: Hierarchy Theorems David Mix Barrigto ad Alexis Maciel July 27, 2000 Most of this lecture
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationNEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE
UPB Sci Bull, Series A, Vol 79, Iss, 207 ISSN 22-7027 NEW FAST CONVERGENT SEQUENCES OF EULER-MASCHERONI TYPE Gabriel Bercu We itroduce two ew sequeces of Euler-Mascheroi type which have fast covergece
More informationFastest mixing Markov chain on a path
Fastest mixig Markov chai o a path Stephe Boyd Persi Diacois Ju Su Li Xiao Revised July 2004 Abstract We ider the problem of assigig trasitio probabilities to the edges of a path, so the resultig Markov
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationTechnical Proofs for Homogeneity Pursuit
Techical Proofs for Homogeeity Pursuit bstract This is the supplemetal material for the article Homogeeity Pursuit, submitted for publicatio i Joural of the merica Statistical ssociatio. B Proofs B. Proof
More informationOPTIMAL PIECEWISE UNIFORM VECTOR QUANTIZATION OF THE MEMORYLESS LAPLACIAN SOURCE
Joural of ELECTRICAL EGIEERIG, VOL. 56, O. 7-8, 2005, 200 204 OPTIMAL PIECEWISE UIFORM VECTOR QUATIZATIO OF THE MEMORYLESS LAPLACIA SOURCE Zora H. Perić Veljo Lj. Staović Alesadra Z. Jovaović Srdja M.
More informationDiscrete mathematics , Fall Instructor: prof. János Pach. 1 Counting problems and the inclusion-exclusion principle
Discrete mathematics 014-015, Fall Istructor: prof Jáos Pach - covered material - Special thaks to Jaa Cslovjecsek, Kelly Fakhauser, ad Sloboda Krstic for sharig their lecture otes If you otice ay errors,
More informationA constructive analysis of convex-valued demand correspondence for weakly uniformly rotund and monotonic preference
MPRA Muich Persoal RePEc Archive A costructive aalysis of covex-valued demad correspodece for weakly uiformly rotud ad mootoic preferece Yasuhito Taaka ad Atsuhiro Satoh. May 04 Olie at http://mpra.ub.ui-mueche.de/55889/
More informationarxiv: v1 [math.co] 5 Jan 2014
O the degree distributio of a growig etwork model Lida Farczadi Uiversity of Waterloo lidafarczadi@gmailcom Nicholas Wormald Moash Uiversity ickwormald@moashedu arxiv:14010933v1 [mathco] 5 Ja 2014 Abstract
More information