Fastest mixing Markov chain on a path
|
|
- Kelley Campbell
- 6 years ago
- Views:
Transcription
1 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 chai or radom walk mixes as rapidly as possible. I this ote we prove that fastest mixig is obtaied whe each edge has a trasitio probability of. Although this result is ituitive (it was cojectured i [7]), ad ca be foud umerically usig covex optimizatio methods [2], we give a self-cotaied proof. I [2], the authors ider the problem of assigig trasitio probabilities to the edges of a coected graph i such a way that the associated Markov chai mixes as rapidly as possible. We show that this problem ca be solved, at least umerically, usig tools of covex PSfrag optimizatio, replacemets i particular, semidefiite programmig [9, 3]. The preset ote presets a simple, self cotaied example where the optimal Markov chai ca be idetified aalytically. Cosider a path with 2 odes, labeled 1, 2,...,, with 1 edges coectig pairs of adjacet odes, ad a loop at each ode, as show i figure 1. We ider a Markov chai (or radom walk) o this path, with trasitio probability from ode i to ode j deoted P ij. The requiremet that trasitios ca oly occur alog a edge or loop of the path is equivalet to P ij = 0 for i j > 1, i.e., P is a tridiagoal matrix. Sice P ij are trasitio probabilities, we have P ij 0, ad j P ij = 1, i.e., P is a stochastic matrix. This ca be expressed as P 1 = 1, where 1 is the vector with all compoets oe. We will ider symmetric trasitio probabilities, i.e., those that satisfy P ij = P ji. Thus, P is a symmetric, (doubly) stochastic, tridiagoal matrix. Sice P 1 = 1, we have (1/) T P = 1/, which meas that the uiform distributio, give by 1 T /, is statioary. P 11 P 22 P 33 P12 P Figure 1: A path with loops at each ode, with trasitio probabilities labeled. Submitted to The America Mathematical Mothly, October Authors listed i alphabetical order. Iformatio Systems Laboratory, Departmet of Electrical Egieerig, Staford Uiversity, CA addresses: boyd@staford.edu, suju@staford.edu, lxiao@staford.edu. Departmet of Statistics ad Departmet of Mathematics, Staford Uiversity, CA
2 The eigevalues of P are real (sice it is symmetric), ad o more tha oe i modulus (sice it is stochastic). We deote them i oicreasig order: 1 = λ 1 (P ) λ 2 (P ) λ (P ) 1. The asymptotic rate of covergece of the Markov chai to the statioary distributio, i.e., its mixig rate, depeds o the secod-largest eigevalue modulus (SLEM) of P, which we deote µ(p ): µ(p ) = max i=2,, λ i(p ) = max {λ 2 (P ), λ (P )}. The smaller µ(p ) is, the faster the Markov chai coverges to its statioary distributio. For example, we have the followig boud: π(t) 1 T / TV µ t, where π(t) = π(0)p t is the probability distributio at time t, ad TV deotes the total variatio orm. (The total variatio distace betwee two probability distributios π ad ˆπ is the maximum of prob π (S) probˆπ (S) over all subsets S {1, 2,..., }.) For more backgroud, see, e.g., [6, 4, 1, 2] ad refereces therei. The questio we address is: What choice of P miimizes µ(p ) amog all symmetric stochastic tridiagoal matrices? I other words, what is the fastest mixig (symmetric) Markov chai o a path? We will show that the trasitio matrix P = 0 0 achieves the smallest possible value of µ(p ), (π/), amog all symmetric stochastic tridiagoal matrices. Thus, to obtai the fastest mixig Markov chai o a path, we assig a PSfrag probability replacemets of of movig left, a probability of movig right, ad a probability of stayig at each of the two ed odes. (For the odes ot at either ed, the probability of stayig at the ode is zero.) This optimal Markov chai is show i figure Figure 2: Fastest mixig Markov chai o a path. For = 2, we have µ(p ) = (π/2) = 0, which is clearly the optimal solutio; i oe step the distributio is exactly uiform, for ay iitial distributio π(0). For 3, P is the trasitio matrix oe would guess yields fastest mixig; ideed, this was cojectured i [7]. But we are ot aware of a simpler proof of its optimality tha the oe we give below. Before proceedig, we describe aother cotext where the same mathematical problem arises. We imagie that there is a processor at each ode of our path, ad that each lik 2 (1)
3 represets a direct etwork coectio betwee the adjacet processors. Processor i has a job queue or load q i (t) (which we approximate as a positive real umber) at time t. The goal is to shift jobs across the liks, at each step, i such a way as to balace the load. I other words, we would like to have q i (t) q as t, where q = (1/) i q i (0) is the average of the iitial queues. We igore the reductio i the queues due to processig (or equivaletly, assume that the load balacig is doe before the processig begis). We use the followig simple scheme to balace the load: at each step, we compute the load imbalace, q i+1 (t) q i (t), across each lik. We the trasfer a fractio θ i [0, 1] of the load imbalace from the more loaded to the less loaded processor. We must have θ i + θ i+1 1, to esure that we are ot asked to trasfer more tha the load o a processor to its eighbors. It ca be show that if θ i are positive, ad satisfy θ i + θ i+1 1, the this iterative scheme achieves asymptotic balaced loads, i.e., q i (t) q as t. The problem is to fid the fractios θ i that result i the fastest possible load balacig. It turs out that this optimal iterative load balacig problem is idetical to the problem of fidig the fastest mixig Markov chai o a path, with P i,i+1 = θ i. I particular, the evolutio of the loads at the processors is give by q(t) = P t q(0). The speed of covergece of q(t) to q1 is give by the secod-largest eigevalue modulus µ(p ). By the basic result i this paper, the fastest possible load balacig is accomplished by shiftig oe-half of the load imbalace o each edge from the more loaded to the less loaded processor. More discussio of this load balacig problem ca be foud i [7]. We ow proceed to prove the basic result. Lemma. Let P R be a symmetric stochastic matrix. The we have µ(p ) = P (1/)11 T 2, where 2 deotes the spectral orm (maximum sigular value). Proof. To see this, we ote that 1 is the eigevector of P associated with the eigevalue λ 1 = 1. Therefore the eigevalues of P 11 T / are 0, λ 2,..., λ. Sice P 11 T / is symmetric, its spectral orm is equal to the maximum magitude of its eigevalues, i.e., max{λ 2, λ }, which is µ(p ). Lemma. Let P R be a symmetric stochastic matrix, ad suppose y, z R satisfy The we have µ(p ) 1 T z. 1 T y = 0, y 2 = 1, (2) (z i + z j )/2 y i y j for P ij 0. (3) Proof. For ay P, y ad z that satisfy the assumptios i the lemma, we have µ(p ) = P (1/)11 T 2 y ( T P (1/)11 ) T y = y T P y = i,j P ij y i y j 3
4 i,j ()(z i + z j )P ij = ()(z T P T P z) = 1 T z. The first iequality follows from the assumptio y 2 = 1 ad the first lemma. The secod iequality follows from the assumptio (3), ad P ij 0. Theorem. The matrix P, give i (1), attais the smallest value of µ, (π/), amog all symmetric stochastic tridiagoal matrices. Proof. The result is clear for = 2. We assume ow that > 2. The eigevalues ad associated orthoormal eigevectors of P are λ 1 = 1, v 0 = (1/ )1 ( ) ( ) (j 1)π 2 (2k 1)(j 1)π λ j =, v j (k) =, 2 j = 2,..., k = 1,...,. (See, e.g.,[8, 16.3].) Therefore we have µ(p ) = λ 2 = λ = (π/). We show that this is the smallest µ possible by tructig a pair y ad z that satisfy the assumptios (2) ad (3) i the secod lemma, for ay symmetric tridiagoal stochastic matrix P, with 1 T z = (π/). We take y = v 2, so the assumptios (2) i the secod lemma clearly hold. We take z to be z i = 1 [ ( ( ) / ( ) π (2i 1)π π + ) ], i = 1,...,. It is easy to verify that 1 T z = (π/). It remais to check that y ad z satisfy (3) for ay symmetric tridiagoal matrix P. Let s first check the superdiagoal etries. For i = 1,..., 1, we have z i + z i+1 2 = 1 [ + ) 1 ( ( ) ( )) / (2i 1)π (2i + 1)π + 2 = 1 [ ( ( )] π 2iπ + ) = 2 ( ) ( ) (2i 1)π (2i + 1)π = y i y i ) ] Therefore equality always holds for the superdiagoal (ad subdiagoal) etries. For the diagoal etries, we eed to check (z i + z i )/2 = z i y 2 i, i.e., + ) ( ) / (2i 1)π ( ( ) π (2i 1)π 2 ) 2 = ( ) (2i 1)π
5 for i = 1,...,, which is equivalet to [ ( )] [ π 1 1 But this is certaily true because This completes the proof. ( ) (2i 1)π ( ) / (2i 1)π ( ) ] π 0, i = 1,...,., i = 1,...,. ) Refereces [1] D. Aldous ad J. Fill. Reversible Markov Chais ad Radom Walks o Graphs. stat Forthcomig book. [2] S. Boyd, P. Diacois, ad L. Xiao. Fastest mixig Markov chai o a graph. To appear i SIAM Review, problems ad techiques sectio, Available at [3] S. Boyd ad L. Vadeberghe. Covex Optimizatio. Cambridge Uiversity Press, Available at [4] P. Brémaud. Markov Chais, Gibbs Fields, Mote Carlo Simulatio ad Queues. Texts i Applied Mathematics. Spriger-Verlag, Berli-Heidelberg, [5] G. Cobb ad Y. Che. A applicatio of Markov chai Mote Carlo to commuity ecology. The America Mathematical Mothly, 110(4): , [6] P. Diacois ad D. Stroock. Geometric bouds for eigevalues of Markov chais. The Aals of Applied Probability, 1(1):36 61, [7] R. Diekma, S. Muthukrisha, ad M. V. Nayakkakuppam. Egieerig diffusive load balacig algorithms usig experimets. I Lecture Notes i Computer Sciece, volume 1253, pages Spriger Verlag, [8] W. Feller. A Itroductio to Probability ad Its Applicatios, volume I. Wiely, New York, 3rd editio, [9] L. Vadeberghe ad S. Boyd. Semidefiite programmig. SIAM Review, 38(1):49 95,
Notes 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 information2 Markov Chain Monte Carlo Sampling
22 Part I. Markov Chais ad Stochastic Samplig Figure 10: Hard-core colourig of a lattice. 2 Markov Chai Mote Carlo Samplig We ow itroduce Markov chai Mote Carlo (MCMC) samplig, which is a extremely importat
More informationAchieving Stationary Distributions in Markov Chains. Monday, November 17, 2008 Rice University
Istructor: Achievig Statioary Distributios i Markov Chais Moday, November 1, 008 Rice Uiversity Dr. Volka Cevher STAT 1 / ELEC 9: Graphical Models Scribe: Rya E. Guerra, Tahira N. Saleem, Terrace D. Savitsky
More informationAN INTRODUCTION TO SPECTRAL GRAPH THEORY
AN INTRODUCTION TO SPECTRAL GRAPH THEORY JIAQI JIANG Abstract. Spectral graph theory is the study of properties of the Laplacia matrix or adjacecy matrix associated with a graph. I this paper, we focus
More informationCMSE 820: Math. Foundations of Data Sci.
Lecture 17 8.4 Weighted path graphs Take from [10, Lecture 3] As alluded to at the ed of the previous sectio, we ow aalyze weighted path graphs. To that ed, we prove the followig: Theorem 6 (Fiedler).
More informationA Hadamard-type lower bound for symmetric diagonally dominant positive matrices
A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of
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 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 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 informationMixing Times for Random Walks on Geometric Random Graphs
Mixig Times for Radom Walks o Geometric Radom Graphs Stephe Boyd Arpita Ghosh Balaji Prabhakar Devavrat Shah Iformatio Systems Laboratory, Staford Uiversity Staford, CA 94305-9510 {boyd, arpitag, balaji,
More informationIntroduction to Computational Molecular Biology. Gibbs Sampling
18.417 Itroductio to Computatioal Molecular Biology Lecture 19: November 16, 2004 Scribe: Tushara C. Karuarata Lecturer: Ross Lippert Editor: Tushara C. Karuarata Gibbs Samplig Itroductio Let s first recall
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 informationFormulas for the Number of Spanning Trees in a Maximal Planar Map
Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces
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 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 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 informationc 2006 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 7, No. 3, pp. 851 860 c 006 Society for Idustrial ad Applied Mathematics EXTREMAL EIGENVALUES OF REAL SYMMETRIC MATRICES WITH ENTRIES IN AN INTERVAL XINGZHI ZHAN Abstract.
More informationLecture 9: Expanders Part 2, Extractors
Lecture 9: Expaders Part, Extractors Topics i Complexity Theory ad Pseudoradomess Sprig 013 Rutgers Uiversity Swastik Kopparty Scribes: Jaso Perry, Joh Kim I this lecture, we will discuss further the pseudoradomess
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 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 information1 Hash tables. 1.1 Implementation
Lecture 8 Hash Tables, Uiversal Hash Fuctios, Balls ad Bis Scribes: Luke Johsto, Moses Charikar, G. Valiat Date: Oct 18, 2017 Adapted From Virgiia Williams lecture otes 1 Hash tables A hash table is a
More informationFeedback in Iterative Algorithms
Feedback i Iterative Algorithms Charles Byre (Charles Byre@uml.edu), Departmet of Mathematical Scieces, Uiversity of Massachusetts Lowell, Lowell, MA 01854 October 17, 2005 Abstract Whe the oegative system
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 informationSOME TRIBONACCI IDENTITIES
Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece
More informationThe Perturbation Bound for the Perron Vector of a Transition Probability Tensor
NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS Numer. Liear Algebra Appl. ; : 6 Published olie i Wiley IterSciece www.itersciece.wiley.com. DOI:./la The Perturbatio Boud for the Perro Vector of a Trasitio
More informationBounds for the Extreme Eigenvalues Using the Trace and Determinant
ISSN 746-7659, Eglad, UK Joural of Iformatio ad Computig Sciece Vol 4, No, 9, pp 49-55 Bouds for the Etreme Eigevalues Usig the Trace ad Determiat Qi Zhog, +, Tig-Zhu Huag School of pplied Mathematics,
More informationON THE RELIABILITY OF AN n-component SYSTEM 1. INTRODUCTION
ON THE RELIABILITY OF AN -COMPONENT SYSTEM Do Rawligs ad Lawrece Sze Uder assumptios compatible with the theory of Markov chais, we use a property of Vadermode matrices to examie the reliability of a -compoet
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 informationif j is a neighbor of i,
We see that if i = j the the coditio is trivially satisfied. Otherwise, T ij (i) = (i)q ij mi 1, (j)q ji, ad, (i)q ij T ji (j) = (j)q ji mi 1, (i)q ij. (j)q ji Now there are two cases, if (j)q ji (i)q
More informationFastest Mixing Markov Chain on Graphs with Symmetries
Fastest Mixig Markov Chai o Graphs with Symmetries Stephe Boyd Persi Diacois Pablo A Parrilo Li Xiao December 5, 2006 Abstract We show how to exploit symmetries of a graph to efficietly compute the fastest
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 informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
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 informationOptimization Methods: Linear Programming Applications Assignment Problem 1. Module 4 Lecture Notes 3. Assignment Problem
Optimizatio Methods: Liear Programmig Applicatios Assigmet Problem Itroductio Module 4 Lecture Notes 3 Assigmet Problem I the previous lecture, we discussed about oe of the bech mark problems called trasportatio
More informationStochastic Matrices in a Finite Field
Stochastic Matrices i a Fiite Field Abstract: I this project we will explore the properties of stochastic matrices i both the real ad the fiite fields. We first explore what properties 2 2 stochastic matrices
More informationCompositions of Random Functions on a Finite Set
Compositios of Radom Fuctios o a Fiite Set Aviash Dalal MCS Departmet, Drexel Uiversity Philadelphia, Pa. 904 ADalal@drexel.edu Eric Schmutz Drexel Uiversity ad Swarthmore College Philadelphia, Pa., 904
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 informationAsymptotic distribution of products of sums of independent random variables
Proc. Idia Acad. Sci. Math. Sci. Vol. 3, No., May 03, pp. 83 9. c Idia Academy of Scieces Asymptotic distributio of products of sums of idepedet radom variables YANLING WANG, SUXIA YAO ad HONGXIA DU ollege
More informationMath 25 Solutions to practice problems
Math 5: Advaced Calculus UC Davis, Sprig 0 Math 5 Solutios to practice problems Questio For = 0,,, 3,... ad 0 k defie umbers C k C k =! k!( k)! (for k = 0 ad k = we defie C 0 = C = ). by = ( )... ( k +
More information18.S096: Homework Problem Set 1 (revised)
8.S096: Homework Problem Set (revised) Topics i Mathematics of Data Sciece (Fall 05) Afoso S. Badeira Due o October 6, 05 Exteded to: October 8, 05 This homework problem set is due o October 6, at the
More informationA class of spectral bounds for Max k-cut
A class of spectral bouds for Max k-cut Miguel F. Ajos, José Neto December 07 Abstract Let G be a udirected ad edge-weighted simple graph. I this paper we itroduce a class of bouds for the maximum k-cut
More informationModern Discrete Probability Spectral Techniques
Moder Discrete Probability VI - Spectral Techiques Backgroud Sébastie Roch UW Madiso Mathematics December 1, 2014 1 Review 2 3 4 Mixig time I Theorem (Covergece to statioarity) Cosider a fiite state space
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 informationLinear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d
Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y
More informationMarkov Decision Processes
Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes
More informationOutput Analysis and Run-Length Control
IEOR E4703: Mote Carlo Simulatio Columbia Uiversity c 2017 by Marti Haugh Output Aalysis ad Ru-Legth Cotrol I these otes we describe how the Cetral Limit Theorem ca be used to costruct approximate (1 α%
More informationDefinitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.
Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,
More informationAppendix to Quicksort Asymptotics
Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala
More informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
More informationSpectral Graph Theory and its Applications. Lillian Dai Oct. 20, 2004
Spectral raph Theory ad its Applicatios Lillia Dai 6.454 Oct. 0, 004 Outlie Basic spectral graph theory raph partitioig usig spectral methods D. Spielma ad S. Teg, Spectral Partitioig Works: Plaar raphs
More informationON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES. 1 Introduction
Appl. Math. J. Chiese Uiv. Ser. B 2007, 22(4): 478-484 ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES Wag Yi 1 Fa Yizheg 1 Ta Yigyig 1,2 Abstract. I this paper, a equivalet coditio of a graph G with
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 informationTMA4205 Numerical Linear Algebra. The Poisson problem in R 2 : diagonalization methods
TMA4205 Numerical Liear Algebra The Poisso problem i R 2 : diagoalizatio methods September 3, 2007 c Eiar M Røquist Departmet of Mathematical Scieces NTNU, N-749 Trodheim, Norway All rights reserved A
More informationMonte Carlo Integration
Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce
More informationRANDOM WALKS ON THE TORUS WITH SEVERAL GENERATORS
RANDOM WALKS ON THE TORUS WITH SEVERAL GENERATORS TIMOTHY PRESCOTT AND FRANCIS EDWARD SU Abstract. Give vectors { α i } [0, 1)d, cosider a radom walk o the d- dimesioal torus T d = R d /Z d geerated by
More informationApplication 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 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 information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
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 informationOn Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below
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, 630090
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationMath 216A Notes, Week 5
Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
More informationVariable selection in principal components analysis of qualitative data using the accelerated ALS algorithm
Variable selectio i pricipal compoets aalysis of qualitative data usig the accelerated ALS algorithm Masahiro Kuroda Yuichi Mori Masaya Iizuka Michio Sakakihara (Okayama Uiversity of Sciece) (Okayama Uiversity
More information1 Duality revisited. AM 221: Advanced Optimization Spring 2016
AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationChapter 2 The Solution of Numerical Algebraic and Transcendental Equations
Chapter The Solutio of Numerical Algebraic ad Trascedetal Equatios Itroductio I this chapter we shall discuss some umerical methods for solvig algebraic ad trascedetal equatios. The equatio f( is said
More informationAN EIGENVALUE REPRESENTATION FOR RANDOM WALK HITTING TIMES AND ITS APPLICATION TO THE ROOK GRAPH
AN EIGENVALUE REPRESENTATION FOR RANDOM WALK HITTING TIMES AND ITS APPLICATION TO THE ROOK GRAPH HOWARD LEVINSON Abstract Give a aperiodic radom walk o a fiite graph, a expressio will be derived for the
More informationChapter 2 The Monte Carlo Method
Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful
More informationSupplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate
Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We
More information1 Covariance Estimation
Eco 75 Lecture 5 Covariace Estimatio ad Optimal Weightig Matrices I this lecture, we cosider estimatio of the asymptotic covariace matrix B B of the extremum estimator b : Covariace Estimatio Lemma 4.
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 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 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 informationIntro to Learning Theory
Lecture 1, October 18, 2016 Itro to Learig Theory Ruth Urer 1 Machie Learig ad Learig Theory Comig soo 2 Formal Framework 21 Basic otios I our formal model for machie learig, the istaces to be classified
More informationPrecise Rates in Complete Moment Convergence for Negatively Associated Sequences
Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo
More informationThe inverse eigenvalue problem for symmetric doubly stochastic matrices
Liear Algebra ad its Applicatios 379 (004) 77 83 www.elsevier.com/locate/laa The iverse eigevalue problem for symmetric doubly stochastic matrices Suk-Geu Hwag a,,, Sug-Soo Pyo b, a Departmet of Mathematics
More information5.1 Review of Singular Value Decomposition (SVD)
MGMT 69000: Topics i High-dimesioal Data Aalysis Falll 06 Lecture 5: Spectral Clusterig: Overview (cotd) ad Aalysis Lecturer: Jiamig Xu Scribe: Adarsh Barik, Taotao He, September 3, 06 Outlie Review of
More informationEstimation of the essential supremum of a regression function
Estimatio of the essetial supremum of a regressio fuctio Michael ohler, Adam rzyżak 2, ad Harro Walk 3 Fachbereich Mathematik, Techische Uiversität Darmstadt, Schlossgartestr. 7, 64289 Darmstadt, Germay,
More informationTHE STRONG LAW OF LARGE NUMBERS FOR STATIONARY SEQUENCES
THE STRONG LAW OF LARGE NUMBERS FOR STATIONARY SEQUENCES Debdeep Pati Idia Statistical Istitute, Kolkata Jue 26, 2006 Abstract The traditioal proof of the strog law of large umbers usig idepedet ad idetically
More informationOptimization Methods MIT 2.098/6.255/ Final exam
Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short
More informationON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS
Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J OPTIM Vol 20, No 2, pp 792 819 c 2009 Society for Idustrial ad Applied Mathematics FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES STEPHEN BOYD, PERSI DIACONIS, PABLO PARRILO, AND LIN XIAO
More information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More informationA RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS
J. Japa Statist. Soc. Vol. 41 No. 1 2011 67 73 A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS Yoichi Nishiyama* We cosider k-sample ad chage poit problems for idepedet data i a
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationSpectral bounds for the k-independence number of a graph
Spectral bouds for the k-idepedece umber of a graph Aida Abiad a, Sebastia M. Cioabă b ad Michael Tait c a Dept. of Quatitative Ecoomics, Operatios Research Maastricht Uiversity, Maastricht, The Netherlads
More informationBernoulli trials with variable probabilities - an observation by Feller
Beroulli trials with variable probabilities - a observatio by Feller Peter Haggstrom www.gotohaggstrom.com mathsatbodibeach@gmail.com October 15, 014 1 Backgroud I his famous book, A Itroductio to Probability
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationSeries: Infinite Sums
Series: Ifiite Sums Series are a way to mae sese of certai types of ifiitely log sums. We will eed to be able to do this if we are to attai our goal of approximatig trascedetal fuctios by usig ifiite degree
More informationDIGITAL FILTER ORDER REDUCTION
DIGITAL FILTER RDER REDUTI VAHID RAISSI DEHKRDI, McGILL UIVERSITY, AADA, vahid@cim.mcgill.ca AMIR G. AGHDAM, RDIA UIVERSITY, AADA, aghdam@ece.cocordia.ca ABSTRAT I this paper, a method is proposed to reduce
More informationROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND
Pacific-Asia Joural of Mathematics, Volume 5, No., Jauary-Jue 20 ROLL CUTTING PROBLEMS UNDER STOCHASTIC DEMAND SHAKEEL JAVAID, Z. H. BAKHSHI & M. M. KHALID ABSTRACT: I this paper, the roll cuttig problem
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 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 informationRates of Convergence by Moduli of Continuity
Rates of Covergece by Moduli of Cotiuity Joh Duchi: Notes for Statistics 300b March, 017 1 Itroductio I this ote, we give a presetatio showig the importace, ad relatioship betwee, the modulis of cotiuity
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationBasic Iterative Methods. Basic Iterative Methods
Abel s heorem: he roots of a polyomial with degree greater tha or equal to 5 ad arbitrary coefficiets caot be foud with a fiite umber of operatios usig additio, subtractio, multiplicatio, divisio, ad extractio
More informationShannon s noiseless coding theorem
18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece
More information