CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
|
|
- Verity Richard
- 5 years ago
- Views:
Transcription
1 CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture and foralie the idea of a eoryless rando walk on a finite nuber of states, and which have wide applicability as a statistical odel of any phenoena Markov chains are postulated to have a set of possible states, and to transition randoly fro one state to a next state, where the probability of transitioning to a particular next state depends only on, and is deterined fully by, the state that it is currently in This last property of being eoryless and having the next state s probabilities deterined only by the current state is called the Markov property Rando-walk-based algorith Consider -SAT, the proble of deterining whether or not a boolean forula in conjunctive noral for, when there are at ost two literals per clause, has a satisfying assignent The following algorith is based on a rando walk First start with an arbitrary assignent to the n variables, and then, up to n ties, if the forula is not satisfied, choose a rando unsatisfied clause and a rando variable fro that clause, and flip the value of that variable If at any point during the n iterations of this, if the forula is satisfied, then return that satisfying assignent Else return unsatisfiable In order to analye this algorith, we ll consider how likely it is to stuble upon a particular satisfying assignent S during n iterations For each iteration t, consider X t, the nuber of variables that agree with S iediately before the tth iteration of the algorith The algorith can then be projected to a rando walk on X t : each tie a variable is flipped, it either increases or decreases X t by one The algorith succeeds if X t ever reaches n Since the flipped variable at each step is one of two variables in an unsatisfied clause, and since every clause is satisfied in S, there is at least an one-half chance that the flipped variable started out disagreeing with S and flipped into a state that agreed with S We express this as: [X t+ = i + X t = i] Consider the pessial version of this where [X t+ = i + X t = ] is exactly one half at every step (unless X t = ) This gives the process the property of being eoryless the transitions at each step are independent of the history of previous states, so this pessial version is a Markov chain Also assue that X = We will show that in this case, E[in t X t = n] = n This iplies that, if the forula is satisfiable, the expected nuber of iterations it ll take for the algorith to succeed is at ost n, so by doing n iterations, we obtain a chance at ost of this algorith reporting a false negative To show that E[in t X t = n] = n, let h j be the expected nuber of steps to reach n on our rando walk when we start at j We get a straightforward recurrence by expanding h j in ters of the nuber of steps to reach n one step after we leave j: h j = + h j + h j+ = h j h j+ = h j h j + Using the base case that h h =, a siple induction yields h j h j+ = j + Then, using h n =, another siple induction gives us: n h = h n + h j h j+ = j= n ( ) n(n ) j + = n + = n j= -
2 Finite Markov chains A finite Markov chain is a rando walk on a directed graph The directed graph has its edges labeled with transition probabilities, in a way so that the law of total probability holds (ie for each vertex, the sus of its outgoing edge labels is exactly ) Each vertex in this graph is called a state of the Markov chain A Markov chain can equivalently be described as a transition atrix P, where P ij is the probability of transitioning to state j if the preceding state is i Thus if X t denotes the state of the Markov chain at tie t, we write [X t+ = j X t = i] = P ij The property that P satisfies the law of total probability eans that it is a stochastic atrix Figure : Markov chain, depicted in graph for Figure : Sae Markov chain as a transition atrix Let p (t) denote the probability distribution for the state of the Markov chain at tie t, so that p (t) i = [X t = i] Then p () gives the initial probability distribution for the Markov chain is in, so that p () = (,,, ) eans to start in state, and p () = ( n,, n ) eans to start in a uniforly rando state The atrix forulation of a Markov chain gives us the following equivalences: p (t+) = p (t) P, and p (t+) = p (t) P Definition An irreducible Markov chain is one whose corresponding graph is strongly connected The period of a state i in a Markov chain is the greatest coon divisor of all n such that (P n ) ii > A Markov chain is aperiodic if the period of every state is For exaple, a bipartite Markov chain is never aperiodic, and given any Markov chain P, we can construct an aperiodic one by taking P = (I + P ) All the Markov chains we ll consider will be finite, irreducible, and aperiodic This iplies that there is soe N > such that for all n N, the entries of the atrix P n will be strictly positive (ie nonero) Stationary distributions Definition A probability distribution π is a stationary distribution of a Markov chain with transition atrix P if π = πp Consequently, for all states j, π j = i π ip ij A stationary distribution of P can be thought of as a fixed point, or an eigenvector of eigenvalue The atrix P ay have eigenvalues not equal to, but since the law of total probability ust be satisfied, the corresponding eigenvectors will not be probability distributions (they ust have negative coponents) The following technical definitions and lea will be needed to prove the Fundaental Theore of Markov Chains later on: Definition The hitting tie T ij is equal to in t {X t = j X = i} That is, it is a rando variable tracking the nuber of steps it takes to get to j fro i Let h ij = E[T ij ] Then h ii is the expected tie of first return to state i after starting fro state i Lea For all states x and y in an irreducible Markov chain, h xy < -
3 oof There are r N and ε > such that for all states and w and for soe j r, it holds that (P j ) w > ε This is true since we can guarantee a nonero unifor lower bound for all nonero entries in {(P j ) w } just because there are a finite nuber of such entries, and we can guarantee that there exists a nonero (P j ) w for each pair of states, w by taking a high enough r, because of irreducibility So consider a rando walk on the Markov chain starting at x Within the first r steps, there is at least a ε chance of the walk having reached y Suppose it doesn t: then the walk is at soe state x y after the rth step There is then at least a ε chance of reaching y in r ore steps starting fro x Continuing on in this fashion, the expected value of T xy is at least: h xy r + ( ε)r + ( ε) r + = r ( ε) k = r ε k= Theore (Fundaental Theore of Markov Chains) For any finite, irreducible, aperiodic Markov chain: There exists soe stationary distribution π, and π x > for all states x π is unique π i = /h ii For all states i, j, li t (P t ) ij = π j oof of () For a rando state, define π y to be the expected nuber of ties the rando walk visits state y before returning to Then: π y = [X t = y ( u < t)x u ] [( u < t)x u ] = h < t= We clai that π is a fixed point of P We verify this by calculating the yth coponent of πp, first by expanding the definition of π x, then by substituting x [X t = x]p xy = [X t+ = y]: ( πp ) y = x = x = t = = t= t= π x P xy ( t ( x t= ) [X t = x T > t] P xy [X t = x T > t]p xy ) [X t+ = y T t + ] [X t = y T t] = π y [X = y T > ] + t= = π y [X = y] + [X T = y] = π y, [X t = y T = t] where the last equality is because we set X =, and so X T = since T is the tie it takes to get back to So we concluded that πp = π, so all we have to do to get our stationary distribution is to noralie π: π x = π x y π y = π x h -
4 oof of () Suppose π and π are two stationary distributions of P and we ll show that π = π Let x = argin y π y / π y, and let c = π x / π x Then: c = π x y = π yp yx y π x y π c π yp yx yp yx y π = c yp yx We substituted using π y c π y and found that that inequality is actually an equality Therefore, since π and π are both noralied and π = c π, we ust have c = and π = π oof of () Reeber fro our construction of the stationary state π that: π x = π x y π y = π x h By uniqueness, we could have set = x and have coe up with the sae value for π x So then: π x = π x h = E x[# of visits to x before returning to x] h xx = h xx oof of () Because P is irreducible, there exists an r such that all the entries of P r are greater than ero Thus, for soe sufficiently sall δ >, (P r ) xy δπ y for all states x, y Let Π the the atrix fored by using π as each of its rows, so that: π π Π = π Then we can define a stochastic atrix Q by setting: P r = δπ + ( δ)q, where Q ust be stochastic because it is a weighted average of stochastic atrices with nonnegative entries Now, two properties of any stochastic atrix M are that MΠ = Π, and if πm = π then ΠM = Π To show that li t (P t ) xy = π y for all x, y, we will show that: P rk = ( ( δ) k )Π + ( δ) k Q k This proceeds by induction on k Since we can write P rk Π = ( δ) k (Q k Π), and ΠP = Π, we can ultiply both sides by P r and get: P rk+r Π = ( δ) k (Q k P r Π) = ( δ) k (Q k (δπ + ( δ)q) Π) = ( δ) k (δq k Π + ( δ)q k+ Π) = ( δ) k (( δ)q k+ ( δ)π), = ( δ) k+ (Q k+ Π), so that: P r(k+) = ( ( δ) k+ )Π + ( δ) k+ Q k+ -
5 Maxiu Matching in Regular Bipartite Graphs Hall s arriage theore guarantees that regular bipartite graphs (bipartite graphs where all vertices have the sae degree) always have a perfect atching In this section, we will give an algorith for finding a perfect atching for a regular bipartite graph G with n nodes and edges in O(n log n) expected tie A partial atching of G is a set of edges with no shared nodes Given a partial atching, an augenting path for that atching is a path which starts and ends at two separate unatched nodes and alternates between edges in the atch and edges outside of it Theore A atching M is axial if and only if there is no augenting path for M oof If there is an augenting path to M, then we can use it to construct a bigger atching Each node in M s path except for the ends was an endpoint of an edge in the atching, and the ends of the path were two different unatched nodes, so each node is visited exactly once Therefore, since the atched and unatched edges in the augenting path alternate, the unatched edges for a atching Since the path started and ended with unatched edges, there is one ore edge in this new atching than the original atching, aking it larger than M and eaning M is not axial Therefore, M is axial only if there is no augenting path Next, we want to show that if there is no augenting path for M, then M is axial Assue for contrapositive that M is not axial Then there exists soe larger atching M such that M > M Since M contains at least one ore edge than M, there are at least two ore atched vertices in M than in M Start at soe vertex atched in M but not in M, and follow edges atched in one of the (which ust alternate, since each vertex is atched to at ost one other vertex in each atching) until either reaching a vertex atched in M but not in M, or vice versa If the vertex is atched in M but not M, then this is an augenting path for M If the vertex is atched in M but not M, then this path had the sae nuber of vertices atched in M as in M Since we know M has ore vertices atched than M, we will always eventually find an augenting path for M The traditional approach to finding a perfect atching for G is the augenting path algorith: Repeatedly find an augenting path alternating between atched and unatched edges until no augenting path can be found This algorith runs in O() steps We will use a randoied algorith to iprove on this tie, running in expected tie O(n log n) We will still use the augenting path strategy, but instead of perforing breadth first search to find an augenting path, we will use a rando walk On each iteration of the algorith, we start with a partial atching M Our graph is bipartite, so let L be one of the independent sets of nodes and R be the other We will refer to L as being on the left, and R as being on the right Construct a directed graph G corresponding to our original graph G by having all edges in M go fro R to L, and all other edges go fro L to R Add two vertices s and t such that there is an edge fro s to each unatched vertex in L for each edge out of it, and an edge fro each unatched vertex in R for each edge into it to t Add edges fro t to s equal to the nuber of edges out of s (which is equal to the nuber of edges into t) Contract each edge in M to a single vertex with the edges of both endpoints By this construction, and because G is regular, each vertex in G will have the sae in-degree as out-degree, so G is Eulerian G has an augenting path if and only if there is a path fro an unatched vertex in L to an unatched vertex in R in G, or equivalently by our construction, G has a cycle fro s to s Our algorith will be to do a rando walk starting fro s The expected tie to find an augenting path is the expected travel tie fro s to s, E(T s,s ) = h s,s As we showed earlier, h s,s = π s Clai In a Eulerian directed graph, the stationary distribution is π v = dout (v) where d out is the out degree of vertex v (which is equal to its in degree) and is the total nuber of edges in the graph oof In the stationary distribution, π v is the su of in flow to v fro all vertices: -5
6 π v = u (u,v) E π u p uv = u (u,v) E d out (u) d out (u) = dout (v) = din (v) d out (s) Therefore, h s,s = In each iteration of the rando walk, we add an edge to our atching In iteration i, there are i edges in the atching, eaning that d out (s) (n i)d, where d is the degree of G Then h s,s dn d(n i) = Since we ust find a cycle in each of the n iterations, the total running tie of the algorith is at ost: n i= The algorith runs in O(n log n) tie as desired n = O(n log n) n i n n i -6
13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE227C (Spring 2018): Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee227c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee227c@berkeley.edu October
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationFixed-to-Variable Length Distribution Matching
Fixed-to-Variable Length Distribution Matching Rana Ali Ajad and Georg Böcherer Institute for Counications Engineering Technische Universität München, Gerany Eail: raa2463@gail.co,georg.boecherer@tu.de
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationOcean 420 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers
Ocean 40 Physical Processes in the Ocean Project 1: Hydrostatic Balance, Advection and Diffusion Answers 1. Hydrostatic Balance a) Set all of the levels on one of the coluns to the lowest possible density.
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5,
Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5, 2015 31 11 Motif Finding Sources for this section: Rouchka, 1997, A Brief Overview of Gibbs Sapling. J. Buhler, M. Topa:
More informationThe Fundamental Basis Theorem of Geometry from an algebraic point of view
Journal of Physics: Conference Series PAPER OPEN ACCESS The Fundaental Basis Theore of Geoetry fro an algebraic point of view To cite this article: U Bekbaev 2017 J Phys: Conf Ser 819 012013 View the article
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationPhysics 215 Winter The Density Matrix
Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationA Markov Framework for the Simple Genetic Algorithm
A arkov Fraework for the Siple Genetic Algorith Thoas E. Davis*, Jose C. Principe Electrical Engineering Departent University of Florida, Gainesville, FL 326 *WL/NGS Eglin AFB, FL32542 Abstract This paper
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationLecture 21 Nov 18, 2015
CS 388R: Randoized Algoriths Fall 05 Prof. Eric Price Lecture Nov 8, 05 Scribe: Chad Voegele, Arun Sai Overview In the last class, we defined the ters cut sparsifier and spectral sparsifier and introduced
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationFigure 1: Equivalent electric (RC) circuit of a neurons membrane
Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of
More informationi ij j ( ) sin cos x y z x x x interchangeably.)
Tensor Operators Michael Fowler,2/3/12 Introduction: Cartesian Vectors and Tensors Physics is full of vectors: x, L, S and so on Classically, a (three-diensional) vector is defined by its properties under
More informationEE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng
EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationEECS 495: Randomized Algorithms Lecture 14 Random Walks. j p ij = 1. Pr[X t+1 = j X 0 = i 0,..., X t 1 = i t 1, X t = i] = Pr[X t+
EECS 495: Randomized Algorithms Lecture 14 Random Walks Reading: Motwani-Raghavan Chapter 6 Powerful tool for sampling complicated distributions since use only local moves Given: to explore state space.
More informationSupplementary to Learning Discriminative Bayesian Networks from High-dimensional Continuous Neuroimaging Data
Suppleentary to Learning Discriinative Bayesian Networks fro High-diensional Continuous Neuroiaging Data Luping Zhou, Lei Wang, Lingqiao Liu, Philip Ogunbona, and Dinggang Shen Proposition. Given a sparse
More information25.1 Markov Chain Monte Carlo (MCMC)
CS880: Approximations Algorithms Scribe: Dave Andrzejewski Lecturer: Shuchi Chawla Topic: Approx counting/sampling, MCMC methods Date: 4/4/07 The previous lecture showed that, for self-reducible problems,
More informationA Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks with Order-Optimal Per-Flow Delay
A Low-Coplexity Congestion Control and Scheduling Algorith for Multihop Wireless Networks with Order-Optial Per-Flow Delay Po-Kai Huang, Xiaojun Lin, and Chih-Chun Wang School of Electrical and Coputer
More informationarxiv: v1 [cs.ds] 3 Feb 2014
arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationINTRODUCTION TO MARKOV CHAINS AND MARKOV CHAIN MIXING
INTRODUCTION TO MARKOV CHAINS AND MARKOV CHAIN MIXING ERIC SHANG Abstract. This paper provides an introduction to Markov chains and their basic classifications and interesting properties. After establishing
More informationCombining Classifiers
Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationProbability & Computing
Probability & Computing Stochastic Process time t {X t t 2 T } state space Ω X t 2 state x 2 discrete time: T is countable T = {0,, 2,...} discrete space: Ω is finite or countably infinite X 0,X,X 2,...
More informationCS Lecture 13. More Maximum Likelihood
CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationSingularities of divisors on abelian varieties
Singularities of divisors on abelian varieties Olivier Debarre March 20, 2006 This is joint work with Christopher Hacon. We work over the coplex nubers. Let D be an effective divisor on an abelian variety
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationMidterm 1 Sample Solution
Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a
More informationNew Slack-Monotonic Schedulability Analysis of Real-Time Tasks on Multiprocessors
New Slack-Monotonic Schedulability Analysis of Real-Tie Tasks on Multiprocessors Risat Mahud Pathan and Jan Jonsson Chalers University of Technology SE-41 96, Göteborg, Sweden {risat, janjo}@chalers.se
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationLecture 8 Symmetries, conserved quantities, and the labeling of states Angular Momentum
Lecture 8 Syetries, conserved quantities, and the labeling of states Angular Moentu Today s Progra: 1. Syetries and conserved quantities labeling of states. hrenfest Theore the greatest theore of all ties
More informationThe Inferential Complexity of Bayesian and Credal Networks
The Inferential Coplexity of Bayesian and Credal Networks Cassio Polpo de Capos,2 Fabio Gagliardi Cozan Universidade de São Paulo - Escola Politécnica 2 Pontifícia Universidade Católica de São Paulo cassio@pucsp.br,
More informationMarkov Chains and Stochastic Sampling
Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationOn random Boolean threshold networks
On rando Boolean threshold networs Reinhard Hecel, Steffen Schober and Martin Bossert Institute of Telecounications and Applied Inforation Theory Ul University Albert-Einstein-Allee 43, 89081Ul, Gerany
More informationStudy on Markov Alternative Renewal Reward. Process for VLSI Cell Partitioning
Int. Journal of Math. Analysis, Vol. 7, 2013, no. 40, 1949-1960 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ia.2013.36142 Study on Markov Alternative Renewal Reward Process for VLSI Cell Partitioning
More informationarxiv: v3 [cs.sy] 29 Dec 2014
A QUADRATIC LOWER BOUND FOR THE CONVERGENCE RATE IN THE ONE-DIMENSIONAL HEGSELMANN-KRAUSE BOUNDED CONFIDENCE DYNAMICS EDVIN WEDIN AND PETER HEGARTY Abstract. Let f k n) be the axiu nuber of tie steps taken
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationUniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval
Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,
More informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More informationAlgebraic Montgomery-Yang problem: the log del Pezzo surface case
c 2014 The Matheatical Society of Japan J. Math. Soc. Japan Vol. 66, No. 4 (2014) pp. 1073 1089 doi: 10.2969/jsj/06641073 Algebraic Montgoery-Yang proble: the log del Pezzo surface case By DongSeon Hwang
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationTight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
Tight Bounds for axial Identifiability of Failure Nodes in Boolean Network Toography Nicola Galesi Sapienza Università di Roa nicola.galesi@uniroa1.it Fariba Ranjbar Sapienza Università di Roa fariba.ranjbar@uniroa1.it
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationMonochromatic images
CHAPTER 8 Monochroatic iages 1 The Central Sets Theore Lea 11 Let S,+) be a seigroup, e be an idepotent of βs and A e There is a set B A in e such that, for each v B, there is a set C A in e with v+c A
More informationThe Hilbert Schmidt version of the commutator theorem for zero trace matrices
The Hilbert Schidt version of the coutator theore for zero trace atrices Oer Angel Gideon Schechtan March 205 Abstract Let A be a coplex atrix with zero trace. Then there are atrices B and C such that
More informationMarkov Chains Handout for Stat 110
Markov Chains Handout for Stat 0 Prof. Joe Blitzstein (Harvard Statistics Department) Introduction Markov chains were first introduced in 906 by Andrey Markov, with the goal of showing that the Law of
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationIterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel
1 Iterative Decoding of LDPC Codes over the q-ary Partial Erasure Channel Rai Cohen, Graduate Student eber, IEEE, and Yuval Cassuto, Senior eber, IEEE arxiv:1510.05311v2 [cs.it] 24 ay 2016 Abstract In
More information12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Power Round-Poles and Polars
1 th Annual Johns Hopkins Math Tournaent Saturday, February 19, 011 Power Round-Poles and Polars 1. Definition and Basic Properties 1. Note that the unit circles are not necessary in the solutions. They
More informationSupport Vector Machines MIT Course Notes Cynthia Rudin
Support Vector Machines MIT 5.097 Course Notes Cynthia Rudin Credit: Ng, Hastie, Tibshirani, Friedan Thanks: Şeyda Ertekin Let s start with soe intuition about argins. The argin of an exaple x i = distance
More informationMarkov Chains, Random Walks on Graphs, and the Laplacian
Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationLean Walsh Transform
Lean Walsh Transfor Edo Liberty 5th March 007 inforal intro We show an orthogonal atrix A of size d log 4 3 d (α = log 4 3) which is applicable in tie O(d). By applying a rando sign change atrix S to the
More informationProblem Set 2. Chapter 1 Numerical:
Chapter 1 Nuerical: roble Set 16. The atoic radius of xenon is 18 p. Is that consistent with its b paraeter of 5.15 1 - L/ol? Hint: what is the volue of a ole of xenon atos and how does that copare to
More informationMULTIPLAYER ROCK-PAPER-SCISSORS
MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationCharacterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone
Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS
#A34 INTEGERS 17 (017) ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS Jürgen Kritschgau Departent of Matheatics, Iowa State University, Aes, Iowa jkritsch@iastateedu Adriana Salerno
More informationIEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 60, NO. 2, FEBRUARY ETSP stands for the Euclidean traveling salesman problem.
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 60, NO., FEBRUARY 015 37 Target Assignent in Robotic Networks: Distance Optiality Guarantees and Hierarchical Strategies Jingjin Yu, Meber, IEEE, Soon-Jo Chung,
More informationare equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,
Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More information1 Rademacher Complexity Bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #10 Scribe: Max Goer March 07, 2013 1 Radeacher Coplexity Bounds Recall the following theore fro last lecture: Theore 1. With probability
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More information