Isoperimetric problems
|
|
- Darleen Griffin
- 6 years ago
- Views:
Transcription
1 CHAPTER 2 Isoperimetric problems 2.1. History One of the earliest problems in geometry was the isoperimetric problem, which was considered by the ancient Greeks. The problem is to find, among all closed cures of a gien length, the one which encloses the maimum area. The basic isoperimetric problem for graphs is essentially the same. Namely, remoe as little of the graph as possible to separate out a subset of ertices of some desired size. Here the size of a subset of ertices may mean the number of ertices, the number of edges, or some other appropriate measure defined on graphs. A typical case is to remoe as few edges as possible to disconnect the graph into two parts of almost equal size. Such problems are usually called separator problems and are particularly useful in a number of areas including recursie algorithms, network design, and parallel architectures for computers, for eample [183]. In a graph, a subset of edges which disconnects the graph is called a cut. Cuts arise naturally in the study of connectiity of graphs where the sizes of the disconnected parts are not of concern. Isoperimetric problems eamine optimal relations between the size of the cut and the sizes of the separated parts. Many different names are used for arious ersions of isoperimetric problems (such as the conductance of a graph, the isoperimetric number, etc.). The concepts are all quite similar, but the differences are due to the arying definitions of cuts and sizes. We will consider two types of cuts. A erte-cut is a subset of ertices whose remoal disconnects the graph. Similarly, an edge-cut is a subset of edges whose remoal separates the graph. The size of a subset of ertices depends on either the number of ertices or the number of edges. Therefore, there are seeral combinations. Roughly speaking, isoperimetric problems inoling edge-cuts correspond in a natural way to Cheeger constants in spectral geometry. The formulation and the proof techniques are ery similar. Cheeger constants were studied in the thesis of Cheeger [52], but they can be traced back to Polyá and Szegö [216]. We will follow tradition and call the discrete ersions by the same names, such as the Cheeger constant and the Cheeger inequalities. 23
2 24 2. ISOPERIMETRIC PROBLEMS 2.2. The Cheeger constant of a graph Before we discuss isoperimetric problems for graphs, let us first consider a measure on subsets of ertices. The typical measure assigns weight 1 to each erte, so the measure of a subset is its number of ertices. Howeer, this implies that all ertices hae the same measure. For some problems, this is appropriate only for regular graphs and does not work for general graphs. The measure we will use here takes into consideration the degree of a erte. For a subset S of the ertices of G, we define ol S, theolume of S, to be the sum of the degrees of the ertices in S: for S V (G). ol S = S d, Net, we define the edge boundary S of S to consist of all edges with eactly one endpoint in S, i.e., S = {{u, } E(G):u Sand S}. Let S denote the complement of S, i.e., S = V S. Clearly, S = S = E(S, S) where E(A, B) denotes the set of edges with one endpoint in A and one endpoint in B. Similarly, we can define the erte boundary δs of S to be the set of all ertices not in S but adjacent to some erte in S, i.e., δs = { S : {u, } E(G),u S}. We are ready to pose the following questions: Problem 1: Forafiednumberm, find a subset S with m ol S ol S such that the edge boundary S contains as few edges as possible. Problem 2: Forafiednumberm, find a subset S with m ol S ol S such that the erte boundary δs contains as few ertices as possible. Cheeger constants are meant to answer eactly the questions aboe. subset S V, we define E(S, (2.1) h G (S) = S) min(ol S,ol S). The Cheeger constant h G of a graph G is defined to be (2.2) h G =minh G (S). S For a In some sense, the problem of determining the Cheeger constant is equialent to soling Problem 1, since S h G ol S. We remark that G is connected if and only if h G > 0. We will only consider connected graphs. In a similar manner, we define the analogue of (2.1) for erte epansion (instead of edge epansion ). For a subset S V, we define (2.3) g G (S) = ol δ(s) min(ol S, ol S)
3 2.3. THE EDGE EXPANSION OF A GRAPH 25 and (2.4) g G =ming G (S). S For regular graphs, we hae g G (S) = δ(s) min( S, S ). We define for a graph G (not necessarily regular) and ḡ G (S) = δ(s) min( S, S ) ḡ G =minḡ G (S). S We remark that ḡ is the corresponding Cheeger constant when the measure for each erte is taken to be 1. More general measures will be considered later in Section 2.6. We note that both g G and ḡ G are concerned with the erte epansion of a graph and are useful for many problems The edge epansion of a graph In this section, we focus on the fundamental relations between eigenalues and the Cheeger constant. We first derie a simple upper bound for the eigenalue λ 1 in terms of the Cheeger constant of a connected graph. Lemma h G λ 1. Proof. We choose f based on an optimum edge cut C which achiees h G and separates the graph G into two parts, A and B: f() = 1 ol A if is in A, 1 if is in B. ol B By substituting f into (1.2), we hae the following: λ 1 C (1/ol A +1/ol B) 2 C min(ol A, ol B) = 2h G.
4 26 2. ISOPERIMETRIC PROBLEMS Now, we will proceed to gie a relatiely short proof of an inequality in the opposite direction, so that we will hae altogether 2h G λ 1 > h2 G 2. This is the so-called Cheeger inequality which often proides an effectie way for bounding the eigenalues of the graph. The following proof is one of four proofs of the Cheeger inequality and its ariations gien in [64]. Theorem 2.2. For a connected graph G, λ 1 > h2 G 2. Proof. We consider the harmonic eigenfunction f of L with eigenalue λ 1. We order ertices of G according to f. That is, relabel the ertices so that f( i ) f( i+1 ), for 1 i n 1. Let S i = { 1,..., i } and define α G =minh Si. i Let r denote the largest integer such that ol(s r ) ol(g)/2. Since g()d =0, g() 2 d =min (g() c) 2 d (g() g( r )) 2 d. c We define the positie and negatie part of g g( r ), denoted by g + and g, respectiely, as follows: { g() g(r ) if g() g( g + () = r ), 0 otherwise, { g() g(r ) if g() g( g ()= r ), 0 otherwise. We consider λ G = u (g(u) g())2 g()2 d u (g(u) g())2 (g() g( r)) 2 d ( (g+ (u) g + ()) 2 +(g (u) g ()) 2) ( g+ () 2 + g () 2). d u u Without loss of generality, we assume R(g + ) R(g ) and therefore we hae λ G R(g + ) since a + b c + d min{ a c, b d }. We here use the notation ol(s) =min{ol(s), ol(g) ol(s)} so that (S i ) α Gol(Si ).
5 2.3. THE EDGE EXPANSION OF A GRAPH 27 Then we hae λ G R(g + ) u = (g +(u) g + ()) 2 u g2 + (u)d u ( u = (g +(u) g + ()) 2)( u (g +(u)+g + ()) 2) u g2 + (u)d u u (g +(u)+g + ()) 2 ( u (g +(u) 2 g + () 2 ) ) 2 2 ( u g2 + (u)d ) 2 by the Cauchy-Schwarz inequality, u ( i = g +( i ) 2 g + ( i+1 ) 2 (S i ) ) 2 2 ( ) 2 by counting, u g2 +(u)d u ( i g +( i ) 2 g + ( i+1 ) 2 α G ol(s i ) ) 2 2 ( u g2 + (u)d ) 2 by the def. of α G, u ( = α2 G i g +( i ) 2 ( ol(s i ) ol(s i+1 ) ) ) 2 ( ) 2 2 u g2 +(u)d u ( i g ) +( i ) 2 2 d i = α2 G 2 = α2 G 2. ( u g2 + (u)d ) 2 u We hae proed that λ 1 h 2 G /2. There are seeral ways to show that the equality does not hold. One of the ways is to use the inequality in Theorem 2.3 (by noting > 2 /2for>0. This completes the proof of Theorem 2.2. We will state an improed ersion of Theorem 2.2 which howeer has a slightly more complicated proof. Theorem 2.3. For any connected graph G, we always hae λ G 1 1 h 2 G. Proof. From the proof of Theorem 2.2, we hae λ G (g + (u) g + ()) 2 u g+ 2 ()d = W.
6 28 2. ISOPERIMETRIC PROBLEMS Also, we hae W = ( (g + (u) g + ()) 2 ) ( + (u)+g + ()) u u (g 2 ) ( V g 2 + ()d ) ( u (g + (u)+g + ()) 2 ) ( g+(u) 2 g+() ) 2 2 u ( g 2 +()d ) (2 g 2 +()d W g 2 +()d ) ( i g 2 +( i ) g 2 +( i+1 ) (S i ) ) 2 (2 W )( g 2 +()) 2 d ( i (g+( 2 i ) g+( 2 i+1 ))α d j ) 2 j i (2 W )( g 2 + ())2 d This implies that Therefore we hae α 2 2 W. W 2 2W + α 2 0. λ 1 W 1 1 α h 2 G. For any connected (simple) graph G, wehae h G 2 ol G. Using Cheeger s inequality, we hae λ 1 > 1 2 ( 2 ol G )2 2 n 4. This lower bound is somewhat weaker than that in Lemma 1.9. Eample 2.4. For a path P n, the Cheeger constant is 1/ (n 1)/2. Asshown π in Eample 1.4, the eigenalue λ 1 of P n is 1 cos n 1 π2 2(n 1). This shows that 2 the Cheeger inequality in Theorem 2.2 is best possible up to within a constant factor. Eample 2.5. For an n-cube Q n, the Cheeger constant is 2/n which is equal to λ 1 (see Eample 1.6). Therefore the inequality in Lemma 2.1 is sharp to within a constant factor. Jerrum and Sinclair [169, 231] first used Cheeger s inequality as a main tool in deriing polynomial approimation algorithms for enumerating permanents and
7 2.4. THE VERTEX EXPANSION OF A GRAPH 29 for other counting problems. The reader is referred to [230] for the related computational aspects of the Cheeger inequality The erte epansion of a graph The proofs of upper and lower bounds for the modified Cheeger constant g G associated with erte epansion are more complicated than those for edge epansion. This is perhaps due to the fact that the definition of h G is in a way more natural and better scaled. Neertheless, erte epansion comes up often in many settings and it is certainly interesting in its own right. Since g G h G,wehae 2g G λ 1. For a general graph G, the eigenalue λ 1 can sometimes be much smaller than gg 2 /2. One such eample is gien by joining two complete subgraphs by a matching. Suppose n is the total number of ertices. The eigenalue λ 1 is no more than 8/n 2, but g G is large. Still, it is desirable to hae a lower bound for λ 1 in terms of g G.Herewegie a proof which is adapted from the argument first gien by Alon [5]. Theorem 2.6. For a connected graph G, gg 2 λ 1 >, 4d +2dg G where d denotes the maimum degree. Proof. We follow the definition in the proof of Theorem 2.2. We hae (f() f(u))f() λ 1 = > V + u V + d f 2 () (f() f(u)) u u, V + (g(u) g()) 2 u, g 2 ()d 2 + u, V + u V + V + d f 2 () f()(f() f(u)) Now we use the ma-flow min-cut theorem [129] as follows. Consider the network with erte set {s, t} X Y where s is the source, t is the sink, X is a copy of V + and Y is a copy of V (G). The directed edges and their capacities are gien as follows:
8 30 2. ISOPERIMETRIC PROBLEMS For eery in X, the directed edge (s, ) has capacity (1 + g G )d u where is labelled by erte u. For eery X, y Y, there is a directed edge (, y) with capacity d if is lablled by erte u, y is labelled by erte and {u, } is an edge. For eery X, y Y, there is a directed edge (, y) with capacity d u if and y are labelled by the same erte u. For eery y Y labelled by, the directed edge (y, t) has capacity d. To check that this network has its min-cut of size (1+g G )ol V +,letcdenote a cut separating s and t. Let X 1 = { X : {s, } C}and {Y = {y Y : {y, t} C}. Then C separates X 1 from Y \ Y. Therefore the total capacity of the cut C is at least the sum of capacities of the edges {s, },s X X 1,theedges(u, ), u X 1 and X 1 δx 1 \Y and edges (y, t), y Y. Since ol (X 1 δx 1 ) (1+g G )ol X 1, the total capacity of the cut is at least (1 + g G )ol(v + X 1 )+ol(x 1 δx 1 \ Y )+oly (1 + g G )ol(v + X 1 )+(1+g G )ol X 1 = (1+g G )ol V +. Since there is a cut of size (1 + g G )ol V +, we hae proed that the min-cut is of size equal to (1 + g G )ol V +. By the ma-flow min-cut theorem, there eists a flow function F (u, ) for all directed edges in the network so that F (u, ) is bounded aboe by the capacity of (u, ) andforeachfied Xand y Y,wehae F(, ) = (1+g G )d, Y F(, y) d y. X Then, 2 {u,} E = 2 {u,} E 2 F 2 (u, )(f + (u)+f + ()) 2 f 2 + ()( F 2 (u, )(f 2 +(u)+f 2 +()) u {u,} E F 2 (u, )+ f 2 +()(d 2 +(1+g G )dd ) u {u,} E F 2 (, u)) 2d(2 + g G ) f 2 + ()d.
9 2.5. A CHARACTERIZATION OF THE CHEEGER CONSTANT 31 Also, = u {u,} E f 2 + (u)( F (u, )(f 2 +(u) f 2 +()) {u,} E g G f+()d 2. F (u, ) {u,} E F (, u)) Combining the aboe facts, we hae (f + (u) f + ()) 2 λ 1 = {u,} E {u,} E ( f+()d 2 {u,} E (f + (u) f + ()) 2 F 2 (u, )(f + (u)+f + ()) 2 f+ 2 ()d {u,} E {u,} E F (u, )(f 2 +(u) f 2 +()) ) 2 F 2 (u, )(f + (u)+f + ()) 2 f+ 2 ()d 2d(2 + g G ) f+ 2 ()d ( F (u, )(f+ 2 1 (u) f + 2 ()) {u,} E 4d +2dg G f+ 2 ()d 2 g 2 G 4d +2dg G, as desired. Eample 2.7. For an n-cube, the erte isoperimetric problem has been well ( studied. According to the Kruskal-Katona theorem [174, 180], for a subset S of n ( k) ertices, for k n/2, the erte boundary of S has at least n k+1) ertices. Therefore, we hae g Qn = ( n n/2) 2 (n 1) 2 πn,forneen A characterization of the Cheeger constant In this section, we consider a characterization of the Cheeger constant which has similar form to the Rayleigh quotient but with a different norm.
10 32 2. ISOPERIMETRIC PROBLEMS (2.5) Theorem 2.8. The Cheeger constant h G of a graph G satisfies f() f(y) h G = inf sup f c R y f() c d V where f ranges oer all functions f : V R which are not constant functions. In language analogous to the continuous case, (2.5) can be thought of as f h G = inf sup. f c R f c and Proof. We choose c such that f()<c f() c If g = f c, thenforσ<0, we hae and for σ>0, we hae g()<σ g()<σ d d > d d d f()c d. f()>c d g()σ d. g()>σ We consider g(σ) = {{, y} E(G):g() σ<g(y)}. Then we hae f() f(y) = g(σ)dσ y = 0 h G dσ 0 g(σ) d g()<σ g()<σ dσ g()<σ = h G f() c d. V d + d dσ dσ g()>σ In the opposite direction, suppose X is a subset of V satisfying h G = E(X, X) ol X. g(σ) d d g()>σ g()>σ d
11 2.5. A CHARACTERIZATION OF THE CHEEGER CONSTANT 33 We consider a character function ψ defined by: { 1 if X, ψ() = 1 otherwise. Then we hae, ψ() ψ(y) sup C y V Therefore, we hae and Theorem 2.8 is proed. ψ() C d C = sup h G inf sup f c R 2 E(X, X) = 2ol X = h G. 2 E(X, X) (1 C)ol X +(1+C)ol X f() f(y) y f() c d V We will proe a ariation of Theorem 2.8 which is not sharp but seems to be easier to use. Later on it will be used to derie an isoperimetric relationship between graphs and their Cartesian products. Corollary 2.9. For a graph G, we hae f() f(y) h G inf f where f : V (G) R satisfies (2.6) y f() d V f()d =0. V Proof. From Theorem 2.8, we already hae f() f(y) h G inf f y f() d V 1 2 h G for f satisfying (2.6). It remains to proe the second part of the inequality. Suppose we define c as in the proof of Theorem 2.8. If c 0, then we hae f() c d f() d f() c = f() 0 f()0 f() d.
12 34 2. ISOPERIMETRIC PROBLEMS Therefore f() d 2 f() c d 2 f() c d. f() c The same results follows similarly if c 0. Thus we hae f() d 2 inf f() c d c and the desired upper bound on h G follows from f() f(y) inf f y 1 f() d 2 h G. V Suppose we decide to hae our measure be the number of ertices in S (and not the olume of S) forasubsetsof ertices. We can then pose similar isoperimetric problems. Problem 3: For a fied number m, what is the minimum edge-boundary for a subset S of m ertices? Problem 4: For a fied number m, what is the minimum erte-boundary for a subset S of m ertices? We can define a modified Cheeger constant, which is sometimes called the isoperimetric number, by h E(S, S) (S)= min( S, S ) and h G = inf S h (S). We note that h G min d h G h G ma d. These modified Cheeger constants are related to the eigenalues of L, denoted by 0 = λ 0 λ 1 λ n 1,and (f(u) f()) 2 λ 1 = inf sup f c = inf f u f,lf f,f (f() c) 2 where f ranges oer all functions f satisfying f() = 0 which are not identically zero. The aboe definition differs from that of L in (1.3) by the multiplicatie factors of d for each term in the sum of the denominator. So, eigenalues λ i of L satisfy 0 λ i λ i ma d.
13 2.6. ISOPERIMETRIC INEQUALITIES FOR CARTESIAN PRODUCTS 35 By using methods similar to those in preious sections, we can show 2h G λ 1. Howeer, the lower bound for λ 1 in terms of h G is a little messy in its deriation. We need to use the fact: u (f(u)+f()) 2 2 f() 2 d 2 f() 2 ma d w w in order to derie the modified Cheeger inequality: λ 1 h 2 G 2ma d. This is less elegant than the statement in Theorem 2.2. We remark that the erte epansion ersion of the Cheeger inequality are closely related to the so-called epander graphs, which we will eamine further in Chapter Isoperimetric inequalities for Cartesian products Suppose G is a graph with a weight function w which assigns nonnegatie alues to each erte and each edge. A general Cheeger constant can be defined as follows: w(, y) h(g, w) =min S {,y} E(S, S) min( S w(), y S w(y)). We say the weight function w is consistent if w(u, ) =w(). u For eample, the ordinary Cheeger constant is obtained by using the weight function w 0 () =d for any erte and w 0 (u, ) = 1 for any edge {u, }. Clearly, w 0 is consistent. On the other hand, the modified Cheeger constant is h G = h(g, w 1) where the weight function w 1 satisfies w 1 (u, ) = 1 for any edge {u, } and w 1 () = 1 for any erte. In this case, w 1 is not necessarily consistent. We note that graphs with consistent weight functions correspond in a natural way to random walks and reersible Marko chains. Namely, for a graph with a consistent weight function w, we can define the random walk with transition probability of moing from a erte u to each of its neighbors to be P (u, ) = w(u, ) w(). Similar to Theorem 2.8, the general isoperimetric inariant h(g, w) has the following characterization:
14 36 2. ISOPERIMETRIC PROBLEMS Theorem For a graph G with weight function w, the isoperimetric inariant h(g, w) of a graph G satisfies f() f(y) w(, y) (2.7) h(g, w) = inf sup f c R y f() c w() where f ranges oer all f : V R which are not constant functions. V In particular, we also hae the following characterization for the modified Cheeger constant. Theorem f() f(y) (2.8) h G = inf sup f c R y f() c where f ranges oer all f : V R which are not constant functions. V For two graphs G and H, thecartesian product G2H has erte set V (G) V (H) with(u, ) adjacent to (u, ) if and only if u = u and is adjacent to in H, or= and u is adjacent to u in G. For eample, the Cartesian product of n copies of one single edge is an n-cube, which is sometimes called a hypercube. The isoperimetric problem for n-cubes is an old and well-known problem. Just as in the continuous case where the sets with minimum erte boundary form spheres, in a hypercube the subsets of gien size with minimum erte-boundary are socalled Hamming balls, which consist of all ertices within a certain distance [23, 158, 159, 191]. The isoperimetric problems for grids (which are Cartesian products of paths) and tori (which are Cartesian products of cycles) hae been well-studied in many papers [34, 35, 252]. We also consider a Cartesian product of weighted graphs with consistent weight functions. For two weighted graphs G and G, with weight functions w, w, respectiely, the weighted Cartesian product G G hasertesetv(g) V(G )with weight function w w defined as follows: For an edge {u, } in E(G), we define w w ((u, ), (, )) = w(u, )w ( ) and for an edge {u, } in E(G ), we define w w ((u, u ), (u, )) = w(u)w (u, ). We require w w to be consistent. Clearly, foraerte=(u, ) ing G, the weight of in G G is eactly 2w(u)w (). In general, for graphs G i with consistent weight functions w i, i =1,...,k,the weighted Cartesian product G 1 G k has erte set V (G) V(G k )with a consistent weight function w 1 w k defined as follows: For an edge {u, } in E(G i ), the edge joining ( 1,..., i 1,u, i+1,..., k )and( 1,..., i 1,, i+1,..., k )hasweightw 1 ( 1 )...w i 1 ( i 1 )w i (u, )w i+1 ( i+1 )...w k ( k ). We remark that G 1 G 2 G 3 is different from (G 1 G 2 ) G 3 or G 1 (G 2 G 3 ). The weighted Cartesian product of graphs corresponds naturally to the Cartesian product of random walks on graphs. Suppose G 1,...,G k are graphs with the erte sets V (G i ). Each G i is associated with a random walk with transition
15 2.6. ISOPERIMETRIC INEQUALITIES FOR CARTESIAN PRODUCTS 37 probability P i as defined as in Section 1.5. The Cartesian product of the random walks can be defined as follows: At the erte ( 1,..., k ), first choose a random direction i, between 1 and k, each with probability 1/k. Then moe to the erte ( 1,..., i 1,u i, i+1,..., k ) according to P i. In other words, P (( 1,..., i 1, i, i+1,...,u k ),( 1,..., i 1,u i, i+1,..., k )) = 1 k P ( i,u i ). We point out that the aboe two notions of the Cartesian products are closely related. In particular, cλ G2H λ G H c 1 λ G2H where min (min deg G, min deg H) c = ma (ma deg G, ma deg H). Here min deg and ma deg denote the minimum degree and the maimum degree, respectiely. The random walk on G 1 2 2G k has transition probability P of moing from a erte ( 1,..., k )totheerte( 1,..., i 1,u i, i+1,..., k )gien by: P (( 1,..., i 1, i, i+1,...,u k ),( 1,..., i 1,u i, i+1,..., k )) = w( i,u i ) w( j ). 1 j k For a graph G, the natural consistent weight function associated with G has edge weight 1 and erte weight d for any erte. Then we hae the following. Theorem The eigenalue of a weighted Cartesian product of G 1,G 2,..., G k satisfies λ G1 G 2 G k = 1 k min(λ G 1,λ G2,...,λ Gk ) where λ G denotes the first eigenalue λ 1 of the graph G. Here we will gie a proof for the case k = 2. Namely, we will show that the eigenalue of a weighted Cartesian product of G and H satisfies (2.9) λ G H = 1 2 min(λ G,λ H ). Proof. Without loss of generality, we assume that λ G λ H. It is easy to see that λ G H 1 2 λ G. Suppose f : V (G) R is the harmonic eigenfunction achieing λ G. We choose a function f 0 : V (G) V (H) R by setting f 0 (u, ) =f(u). Clearly, λ G H is less than the Rayleigh quotient using f 0 whose alue is eactly λ G /2.
16 38 2. ISOPERIMETRIC PROBLEMS In the opposite direction, we consider the harmonic eigenfunction g : V (G) V (H) R achieing λ G H. We denote, for u V (G), V(H), g(u, )d g u = g =, ol H g(u, )d u u, ol G g(u, )d u d u, (2.10) c = ol G ol H. Here, we repeatedly use the definition of eigenalues and the Cauchy-Schwarz inequality: (g(u, ) g(u,)) 2 d + (g(u, ) g(u, )) 2 d u u u λ G H = u (g(u, ) c) 2 2d u d λ G u, (g(u, ) g ) 2 d u d +( u, u (g(u, ) g ) 2 2d u d + u, u, λ G λ G 2. This completes the proof of (2.9). d u ) (g g ) 2 (g c) 2 2d u d d u ) (g c) 2 d (g(u, ) g ) 2 d u d + λ H ( u, u (g(u, ) g ) 2 2d u d + (g c) 2 2d u d u, u, Theorem The Cheeger constant of a weighted Cartesian product of G 1,G 2,,G k satisfies 1 k min(h G 1,h G2,...,h Gk ) h G1 G 2 G k 1 2k min(h( G 1,h G2,...,h Gk ). Here we again will proe the case for the product of two graphs and leae the proof of the general case as an eercise. 1 (2.11) 2 min(h G,h H )h G H 1 4 min(h G,h H ). Proof. Without loss of generality, we assume that h G h H.
17 2.6. ISOPERIMETRIC INEQUALITIES FOR CARTESIAN PRODUCTS 39 First we note that h G H h G 2. Suppose f : V (G) R is a function achieing h(g) in (2.7). We choose a function f 0 : V (G) V (H) R by setting f 0 (u, ) =f(u). Clearly, h G H is no more than the alue for the quotient of (2.7) using f 0 whose alue is eactly h G /2. It remains to show that h G H h G /4. To this end, we will repeatedly use Corollary 2.9, and we adopt the notation in the proof of (2.9). h G H = g(u, ) g(u,) d + g(u, ) g(u, ) d u u u u g(u, ) c 2d u d u, h G g(u, ) g d u d +( d u ) g g u, u g(u, ) g 2d u d + g c 2d u d u, u, h G g(u, ) g d u d + h H 2 2 ( d u ) g c d u, u g(u, ) g 2d u d + g c 2d u d u, u, h G 4. This completes the proof of (2.11). For the modified Cheeger constant h G, a similar isoperimetric inequality can be obtained: Corollary The modified Cheeger constant of the Cartesian product of G 1,G 2,...,G k satisfies min(h G 1,h G 2,...,h G k ) h G 12G 22 2G k 1 2 min(h G 1,h G 2,...,h G k ). Notes The proof is quite similar to that of (2.11) (also see [87]) and will be omitted. The characterization of the Cheeger constant in Theorem 2.8 is basically the Rayleigh quotient using the L 1 -norm both in the numerator and denominator. In
18 40 2. ISOPERIMETRIC PROBLEMS general, we can consider the so-called Sobole constants for all p, q > 0: ( ) 1/p f(u) f() p s p,q = inf f = inf f u ( ) 1/q f() q d f p f q where f ranges oer functions satisfying f() c q d f() q d for any c, or, equialently, f c q f q. The eigenalue λ 1 is associated with the case of p = q = 2, while the Cheeger constant corresponds to the case of p = q = 1. Some of the general cases will be considered later in Chapter 11 on Sobole inequalities. This chapter is mainly based on [63]. More general cases of the Cartesian products are discussed in [87]. Another reference for weighted Cheeger constants and related isoperimetric inequalities is [83].
Isoperimetric inequalities for cartesian products of graphs
Isoperimetric inequalities for cartesian products of graphs F. R. K. Chung University of Pennsylvania Philadelphia 19104 Prasad Tetali School of Mathematics Georgia Inst. of Technology Atlanta GA 3033-0160
More informationA spectral Turán theorem
A spectral Turán theorem Fan Chung Abstract If all nonzero eigenalues of the (normalized) Laplacian of a graph G are close to, then G is t-turán in the sense that any subgraph of G containing no K t+ contains
More informationLectures on Spectral Graph Theory. Fan R. K. Chung
Lectures on Spectral Graph Theory Fan R. K. Chung Author address: Uniersity of Pennsylania, Philadelphia, Pennsylania 19104 E-mail address: chung@math.upenn.edu Contents Chapter 1. Eigenalues and the Laplacian
More informationNetwork Flow Problems Luis Goddyn, Math 408
Network Flow Problems Luis Goddyn, Math 48 Let D = (V, A) be a directed graph, and let s, t V (D). For S V we write δ + (S) = {u A : u S, S} and δ (S) = {u A : u S, S} for the in-arcs and out-arcs of S
More informationLecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem.
Lecture J jacques@ucsd.edu Notation: Let [n] [n] := [n] 2. A weighted digraph is a function W : [n] 2 R. An arborescence is, loosely speaking, a digraph which consists in orienting eery edge of a rooted
More informationLecture 1. 1 Overview. 2 Maximum Flow. COMPSCI 532: Design and Analysis of Algorithms August 26, 2015
COMPSCI 532: Design and Analysis of Algorithms August 26, 205 Lecture Lecturer: Debmalya Panigrahi Scribe: Allen Xiao Oeriew In this lecture, we will define the maximum flow problem and discuss two algorithms
More informationAn Explicit Lower Bound of 5n o(n) for Boolean Circuits
An Eplicit Lower Bound of 5n o(n) for Boolean Circuits Kazuo Iwama, Oded Lachish, Hiroki Morizumi, and Ran Raz Graduate School of Informatics, Kyoto Uniersity, Kyoto, JAPAN {iwama, morizumi}@kuis.kyoto-u.ac.jp
More informationA Regularization Framework for Learning from Graph Data
A Regularization Framework for Learning from Graph Data Dengyong Zhou Max Planck Institute for Biological Cybernetics Spemannstr. 38, 7076 Tuebingen, Germany Bernhard Schölkopf Max Planck Institute for
More informationSection 6: PRISMATIC BEAMS. Beam Theory
Beam Theory There are two types of beam theory aailable to craft beam element formulations from. They are Bernoulli-Euler beam theory Timoshenko beam theory One learns the details of Bernoulli-Euler beam
More informationIntroduction to Thermodynamic Cycles Part 1 1 st Law of Thermodynamics and Gas Power Cycles
Introduction to Thermodynamic Cycles Part 1 1 st Law of Thermodynamics and Gas Power Cycles by James Doane, PhD, PE Contents 1.0 Course Oeriew... 4.0 Basic Concepts of Thermodynamics... 4.1 Temperature
More informationarxiv: v1 [math.pr] 25 Jun 2015
Random walks colliding before getting trapped Louigi Addario-Berry Roberto I. Olieira Yual Peres Perla Sousi ari:156.78451 math.pr 25 Jun 215 Abstract Let P be the transition matrix of a finite, irreducible
More informationReview of Matrices and Vectors 1/45
Reiew of Matrices and Vectors /45 /45 Definition of Vector: A collection of comple or real numbers, generally put in a column [ ] T "! Transpose + + + b a b a b b a a " " " b a b a Definition of Vector
More informationarxiv: v2 [math.co] 12 Jul 2009
A Proof of the Molecular Conjecture Naoki Katoh and Shin-ichi Tanigawa arxi:0902.02362 [math.co] 12 Jul 2009 Department of Architecture and Architectural Engineering, Kyoto Uniersity, Kyoto Daigaku Katsura,
More informationThe optimal pebbling number of the complete m-ary tree
Discrete Mathematics 222 (2000) 89 00 www.elseier.com/locate/disc The optimal pebbling number of the complete m-ary tree Hung-Lin Fu, Chin-Lin Shiue Department of Applied Mathematics, National Chiao Tung
More informationARE THERE BETTER WAYS TO UNDERSTAND THE SECOND LAW OF THERMODYNAMICS AND THE CARNOT EFFICIENCY OF HEAT ENGINES?
ARE THERE BETTER WAYS TO UNDERSTAND THE SECOND LAW OF THERMODYNAMICS AND THE CARNOT EFFICIENCY OF HEAT ENGINES? W. John Dartnall 979 reised Abstract The Second Law of Thermodynamics imposes the Carnot
More informationAlgorithms and Data Structures 2014 Exercises and Solutions Week 14
lgorithms and ata tructures 0 xercises and s Week Linear programming. onsider the following linear program. maximize x y 0 x + y 7 x x 0 y 0 x + 3y Plot the feasible region and identify the optimal solution.
More informationRapidly mixing Markov chains
Randomized and Approximation Algorithms Leonard Schulman Scribe: Rajneesh Hegde Georgia Tech, Fall 997 Dec., 997 Rapidly mixing Marko chains Goal: To sample from interesting probability distributions.
More informationSampling Binary Contingency Tables with a Greedy Start
Sampling Binary Contingency Tables with a Greedy Start Iona Bezákoá Nayantara Bhatnagar Eric Vigoda Abstract We study the problem of counting and randomly sampling binary contingency tables. For gien row
More informationSpectral Graph Theory and its Applications
Spectral Graph Theory and its Applications Yi-Hsuan Lin Abstract This notes were given in a series of lectures by Prof Fan Chung in National Taiwan University Introduction Basic notations Let G = (V, E)
More informationTheory of Network Communication
Theory of Network Communication Dr. Christian Scheideler Johns Hopkins Uniersity, Sept. 9 2002 Introduction The goal of this lecture is to gie an introduction to the state of the art in the theory of network
More informationarxiv: v1 [math.co] 10 Jun 2018
Some Mixed Graphs Determined by arxi:1806.036341 [math.co] 10 Jun 2018 Their Spectrum S. Akbari a, A. Ghafari a, M. Nahi b and M.A. Nematollahi a a Department of Mathematical Sciences, Sharif Uniersity
More informationPyramidal Sum Labeling In Graphs
ISSN : 48-96, Vol 8, Issue 4, ( Part -I) April 8, pp-9 RESEARCH ARTICLE Pyramidal Sum Labeling In Graphs OPEN ACCESS HVelet Getzimah, D S T Ramesh ( department Of Mathematics, Pope s College, Sayerpuram-68,Ms
More informationTopics in Probabilistic Combinatorics and Algorithms Winter, 2016
Topics in Probabilistic Combinatorics and Algorithms Winter, 06 4. Epander Graphs Review: verte boundary δ() = {v, v u }. edge boundary () = {{u, v} E, u, v / }. Remark. Of special interset are (, β) epander,
More informationOn the Linear Threshold Model for Diffusion of Innovations in Multiplex Social Networks
On the Linear Threshold Model for Diffusion of Innoations in Multiplex Social Networks Yaofeng Desmond Zhong 1, Vaibha Sriastaa 2 and Naomi Ehrich Leonard 1 Abstract Diffusion of innoations in social networks
More informationThe cover pebbling theorem
The coer pebbling theorem Jonas Sjöstrand Department of Mathematics KTH, SE-100 44 Stockholm, Sweden jonass@kth.se Submitted: Oct 21, 2004; Accepted: No 4, 2005; Published: No 15, 2005 Mathematics Subject
More informationPatterns of Non-Simple Continued Fractions
Patterns of Non-Simple Continued Fractions Jesse Schmieg A final report written for the Uniersity of Minnesota Undergraduate Research Opportunities Program Adisor: Professor John Greene March 01 Contents
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 11, November-2016 ISSN Nullity of Expanded Smith graphs
85 Nullity of Expanded Smith graphs Usha Sharma and Renu Naresh Department of Mathematics and Statistics, Banasthali Uniersity, Banasthali Rajasthan : usha.sharma94@yahoo.com, : renunaresh@gmail.com Abstract
More informationHölder-type inequalities and their applications to concentration and correlation bounds
Hölder-type inequalities and their applications to concentration and correlation bounds Christos Pelekis * Jan Ramon Yuyi Wang Noember 29, 2016 Abstract Let Y, V, be real-alued random ariables haing a
More informationLecture 8: Construction of Expanders
Spectral Graph Theory and Applications WS 0/0 Lecture 8: Construction of Expanders Lecturer: Thomas Sauerwald & He Sun In this lecture we study the explicit constructions of expander graphs. Although we
More informationDoppler shifts in astronomy
7.4 Doppler shift 253 Diide the transformation (3.4) by as follows: = g 1 bck. (Lorentz transformation) (7.43) Eliminate in the right-hand term with (41) and then inoke (42) to yield = g (1 b cos u). (7.44)
More informationarxiv: v1 [math.co] 25 Apr 2016
On the zone complexity of a ertex Shira Zerbib arxi:604.07268 [math.co] 25 Apr 206 April 26, 206 Abstract Let L be a set of n lines in the real projectie plane in general position. We show that there exists
More informationSpace Coordinates and Vectors in Space. Coordinates in Space
0_110.qd 11//0 : PM Page 77 SECTION 11. Space Coordinates and Vectors in Space 77 -plane Section 11. -plane -plane The three-dimensional coordinate sstem Figure 11.1 Space Coordinates and Vectors in Space
More informationDYNAMICS. Kinematics of Particles Engineering Dynamics Lecture Note VECTOR MECHANICS FOR ENGINEERS: Eighth Edition CHAPTER
27 The McGraw-Hill Companies, Inc. All rights resered. Eighth E CHAPTER 11 VECTOR MECHANICS FOR ENGINEERS: DYNAMICS Ferdinand P. Beer E. Russell Johnston, Jr. Kinematics of Particles Lecture Notes: J.
More informationMeasure and Conquer: A Simple O( n ) Independent Set Algorithm
Measure and Conquer: A Simple O(2 0.288n ) Independent Set Algorithm Fedor V. Fomin 1, Fabrizio Grandoni 2, and Dieter Kratsch 3 1 Department of Informatics, Uniersity of Bergen, N-5020 Bergen, Norway,
More informationTwo-sided bounds for L p -norms of combinations of products of independent random variables
Two-sided bounds for L p -norms of combinations of products of independent random ariables Ewa Damek (based on the joint work with Rafał Latała, Piotr Nayar and Tomasz Tkocz) Wrocław Uniersity, Uniersity
More informationarxiv: v1 [math.gt] 2 Nov 2010
CONSTRUCTING UNIVERSAL ABELIAN COVERS OF GRAPH MANIFOLDS HELGE MØLLER PEDERSEN arxi:101105551 [mathgt] 2 No 2010 Abstract To a rational homology sphere graph manifold one can associate a weighted tree
More informationImproved Bounds on the L(2, 1)-Number of Direct and Strong Products of Graphs
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR AERS VOL. ***, NO. ***, *** 2007 Improed Bounds on the L(2, )-Number of Direct and Strong roducts of Graphs Zhendong Shao, Sandi Klažar, Daid Zhang,
More informationTransmission lines using a distributed equivalent circuit
Cambridge Uniersity Press 978-1-107-02600-1 - Transmission Lines Equialent Circuits, Electromagnetic Theory, and Photons Part 1 Transmission lines using a distributed equialent circuit in this web serice
More informationMagnetic Fields Part 3: Electromagnetic Induction
Magnetic Fields Part 3: Electromagnetic Induction Last modified: 15/12/2017 Contents Links Electromagnetic Induction Induced EMF Induced Current Induction & Magnetic Flux Magnetic Flux Change in Flux Faraday
More informationAstrometric Errors Correlated Strongly Across Multiple SIRTF Images
Astrometric Errors Correlated Strongly Across Multiple SIRTF Images John Fowler 28 March 23 The possibility exists that after pointing transfer has been performed for each BCD (i.e. a calibrated image
More informationThe Riemann-Roch Theorem: a Proof, an Extension, and an Application MATH 780, Spring 2019
The Riemann-Roch Theorem: a Proof, an Extension, and an Application MATH 780, Spring 2019 This handout continues the notational conentions of the preious one on the Riemann-Roch Theorem, with one slight
More informationDynamic Vehicle Routing with Moving Demands Part II: High speed demands or low arrival rates
ACC 9, Submitted St. Louis, MO Dynamic Vehicle Routing with Moing Demands Part II: High speed demands or low arrial rates Stephen L. Smith Shaunak D. Bopardikar Francesco Bullo João P. Hespanha Abstract
More informationComputing Laboratory A GAME-BASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES
Computing Laboratory A GAME-BASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES Mark Kattenbelt Marta Kwiatkowska Gethin Norman Daid Parker CL-RR-08-06 Oxford Uniersity Computing Laboratory
More informationBalanced Partitions of Vector Sequences
Balanced Partitions of Vector Sequences Imre Bárány Benjamin Doerr December 20, 2004 Abstract Let d,r N and be any norm on R d. Let B denote the unit ball with respect to this norm. We show that any sequence
More informationMOTION OF FALLING OBJECTS WITH RESISTANCE
DOING PHYSICS WIH MALAB MECHANICS MOION OF FALLING OBJECS WIH RESISANCE Ian Cooper School of Physics, Uniersity of Sydney ian.cooper@sydney.edu.au DOWNLOAD DIRECORY FOR MALAB SCRIPS mec_fr_mg_b.m Computation
More informationG 2(X) X SOLVABILITY OF GRAPH INEQUALITIES. 1. A simple graph inequality. Consider the diagram in Figure 1.
SOLVABILITY OF GRAPH INEQUALITIES MARCUS SCHAEFER AND DANIEL ŠTEFANKOVIČ Abstract. We inestigate a new type of graph inequality (in the tradition of Cetkoić and Simić [Contributions to Graph Theory and
More information(x,y) 4. Calculus I: Differentiation
4. Calculus I: Differentiation 4. The eriatie of a function Suppose we are gien a cure with a point lying on it. If the cure is smooth at then we can fin a unique tangent to the cure at : If the tangent
More informationOptimization Problems in Multiple Subtree Graphs
Optimization Problems in Multiple Subtree Graphs Danny Hermelin Dror Rawitz February 28, 2010 Abstract We study arious optimization problems in t-subtree graphs, the intersection graphs of t- subtrees,
More informationOn diamond-free subposets of the Boolean lattice
On diamond-free subposets of the Boolean lattice Lucas Kramer, Ryan R Martin, Michael Young 2 Department of Mathematics, Iowa State Uniersity, Ames, Iowa 500 Abstract The Boolean lattice of dimension two,
More informationLinear Momentum and Collisions Conservation of linear momentum
Unit 4 Linear omentum and Collisions 4.. Conseration of linear momentum 4. Collisions 4.3 Impulse 4.4 Coefficient of restitution (e) 4.. Conseration of linear momentum m m u u m = u = u m Before Collision
More information4. A Physical Model for an Electron with Angular Momentum. An Electron in a Bohr Orbit. The Quantum Magnet Resulting from Orbital Motion.
4. A Physical Model for an Electron with Angular Momentum. An Electron in a Bohr Orbit. The Quantum Magnet Resulting from Orbital Motion. We now hae deeloped a ector model that allows the ready isualization
More informationInteger Parameter Synthesis for Real-time Systems
1 Integer Parameter Synthesis for Real-time Systems Aleksandra Joanoić, Didier Lime and Oliier H. Roux École Centrale de Nantes - IRCCyN UMR CNRS 6597 Nantes, France Abstract We proide a subclass of parametric
More informationMATHEMATICAL MODELLING AND IDENTIFICATION OF THE FLOW DYNAMICS IN
MATHEMATICAL MOELLING AN IENTIFICATION OF THE FLOW YNAMICS IN MOLTEN GLASS FURNACES Jan Studzinski Systems Research Institute of Polish Academy of Sciences Newelska 6-447 Warsaw, Poland E-mail: studzins@ibspan.waw.pl
More informationDECOMPOSING 4-REGULAR GRAPHS INTO TRIANGLE-FREE 2-FACTORS
SIAMJ.DISCRETE MATH. c 1997 Society for Industrial and Applied Mathematics Vol. 10, No. 2, pp. 309 317, May 1997 011 DECOMPOSING 4-REGULAR GRAPHS INTO TRIANGLE-FREE 2-FACTORS EDWARD BERTRAM AND PETER HORÁK
More informationTHE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 4, 2016 THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH HONG-HAI LI AND LI ZOU ABSTRACT. The matching energy of a graph was introduced
More informationLECTURE 3 3.1Rules of Vector Differentiation
LETURE 3 3.1Rules of Vector Differentiation We hae defined three kinds of deriaties inoling the operator grad( ) i j k, x y z 1 3 di(., x y z curl( i x 1 j y k z 3 d The good news is that you can apply
More informationDynamic Vehicle Routing with Heterogeneous Demands
Dynamic Vehicle Routing with Heterogeneous Demands Stephen L. Smith Marco Paone Francesco Bullo Emilio Frazzoli Abstract In this paper we study a ariation of the Dynamic Traeling Repairperson Problem DTRP
More informationThe Inverse Function Theorem
Inerse Function Theorem April, 3 The Inerse Function Theorem Suppose and Y are Banach spaces and f : Y is C (continuousl differentiable) Under what circumstances does a (local) inerse f exist? In the simplest
More informationThe Evolution of Grötzsch s Theorem
The Eolution of Grötzsch s Theorem Lauren DeDieu September 26, 2011 A thesis submitted in partial fulfillment of the requirements for MATH 490, in the department of Mathematics, Physics and Geology, Cape
More informationGeneral Lorentz Boost Transformations, Acting on Some Important Physical Quantities
General Lorentz Boost Transformations, Acting on Some Important Physical Quantities We are interested in transforming measurements made in a reference frame O into measurements of the same quantities as
More informationSimple Stochastic Games with Few Random Vertices Are Easy to Solve
Simple Stochastic Games with Few Random Vertices Are Easy to Sole Hugo Gimbert and Florian Horn LaBRI, Uniersité Bordeaux, France hugo.gimbert@labri.fr LIAFA, Uniersité Paris 7, France florian.horn@liafa.jussieu.fr
More informationScalar multiplication and algebraic direction of a vector
Roberto s Notes on Linear Algebra Chapter 1: Geometric ectors Section 5 Scalar multiplication and algebraic direction of a ector What you need to know already: of a geometric ectors. Length and geometric
More informationWeighted Graph Laplacians and Isoperimetric Inequalities
Weighted Graph Laplacians and Isoperimetric Inequalities Fan Chung University of California, San Diego La Jolla, California 92093-0112 Kevin Oden Harvard University Cambridge, Massachusetts 02138 Abstract
More informationChapter 4: Techniques of Circuit Analysis
Chapter 4: Techniques of Circuit Analysis This chapter gies us many useful tools for soling and simplifying circuits. We saw a few simple tools in the last chapter (reduction of circuits ia series and
More informationTopological Growth Rates and Fractal Dimensions
Chapter 5 Topological Growth Rates and Fractal Dimensions 5.1 Introduction Throughout this thesis, we obsere close correlations between alues of the topological growth rates and arious other fractal indices.
More information4 Fundamentals of Continuum Thermomechanics
4 Fundamentals of Continuum Thermomechanics In this Chapter, the laws of thermodynamics are reiewed and formulated for a continuum. The classical theory of thermodynamics, which is concerned with simple
More informationRelativistic Energy Derivation
Relatiistic Energy Deriation Flamenco Chuck Keyser //4 ass Deriation (The ass Creation Equation ρ, ρ as the initial condition, C the mass creation rate, T the time, ρ a density. Let V be a second mass
More informationThe Random Edge Rule on Three-Dimensional Linear Programs 1 (extended abstract)
arxi:math/03010761 [math.co] 9 Jan 2003 The Random Edge Rule on Three-Dimensional Linear Programs 1 (extended abstract) Volker Kaibel 2 Rafael Mechtel 2 Micha Sharir 3 Günter M. Ziegler 2 October 10, 2017
More informationChromatic characterization of biclique cover. Denis Cornaz. Jean Fonlupt. Equipe Combinatoire, UFR 921, Universite Pierre et Marie Curie, 4 place
Chromatic characterization of biclique coer Denis Cornaz France Telecom R&D, 38-40 rue du General Leclerc, Issy-les-Moulineaux 92794 Jean Fonlupt Equipe Combinatoire, UFR 921, Uniersite Pierre et Marie
More informationFu Yuhua 1. Beijing, China
85 An Example of Guiding Scientific Research with hilosophical rinciples Based on Uniqueness of Truth and Neutrosophy eriing Newton's Second Law and the like Fu Yuhua 1 1 CNOOC Research Institute Beijing,
More informationMath 144 Activity #9 Introduction to Vectors
144 p 1 Math 144 ctiity #9 Introduction to Vectors Often times you hear people use the words speed and elocity. Is there a difference between the two? If so, what is the difference? Discuss this with your
More informationResidual migration in VTI media using anisotropy continuation
Stanford Exploration Project, Report SERGEY, Noember 9, 2000, pages 671?? Residual migration in VTI media using anisotropy continuation Tariq Alkhalifah Sergey Fomel 1 ABSTRACT We introduce anisotropy
More informationarxiv: v3 [math.co] 20 Sep 2016
PLANAR GRAPHS ARE 9/-COLORABLE DANIEL W. CRANSTON AND LANDON RABERN arxi:0.7 [math.co] 0 Sep 06 Abstract. We show that eery planar graph G has a -fold 9-coloring. In particular, this implies that G has
More informationdifferent formulas, depending on whether or not the vector is in two dimensions or three dimensions.
ectors The word ector comes from the Latin word ectus which means carried. It is best to think of a ector as the displacement from an initial point P to a terminal point Q. Such a ector is expressed as
More information0 a 3 a 2 a 3 0 a 1 a 2 a 1 0
Chapter Flow kinematics Vector and tensor formulae This introductory section presents a brief account of different definitions of ector and tensor analysis that will be used in the following chapters.
More informationEconomics 205 Exercises
Economics 05 Eercises Prof. Watson, Fall 006 (Includes eaminations through Fall 003) Part 1: Basic Analysis 1. Using ε and δ, write in formal terms the meaning of lim a f() = c, where f : R R.. Write the
More informationNP and NP-Completeness
0/2/206 Algorithms NP-Completeness 7- Algorithms NP-Completeness 7-2 Efficient Certification NP and NP-Completeness By a solution of a decision problem X we understand a certificate witnessing that an
More informationOnline Companion to Pricing Services Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions?
Online Companion to Pricing Serices Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions? Gérard P. Cachon Pnina Feldman Operations and Information Management, The Wharton School, Uniersity
More informationACYCLIC WEAK CONVEX DOMINATION IN GRAPHS
International Journal of Mathematics & Engineering with Computers Vol 2, No -2, pp 65-72, January-December 20 ACYCLIC WEAK CONVEX DOMINATION IN GRAPHS TN Janakiraman, and PJA Alphonse ABSTRACT: In a graph
More informationv v Downloaded 01/11/16 to Redistribution subject to SEG license or copyright; see Terms of Use at
The pseudo-analytical method: application of pseudo-laplacians to acoustic and acoustic anisotropic wae propagation John T. Etgen* and Serre Brandsberg-Dahl Summary We generalize the pseudo-spectral method
More informationInelastic Collapse in One Dimensional Systems with Ordered Collisions
Lake Forest College Lake Forest College Publications Senior Theses Student Publications 4-4-05 Inelastic Collapse in One Dimensional Systems with Ordered Collisions Brandon R. Bauerly Lake Forest College,
More informationNotes on Linear Minimum Mean Square Error Estimators
Notes on Linear Minimum Mean Square Error Estimators Ça gatay Candan January, 0 Abstract Some connections between linear minimum mean square error estimators, maximum output SNR filters and the least square
More informationStable Network Flow with Piece-wise Linear Constraints
Stable Network Flow with Piece-wise Linear Constraints Young-San Lin Thành Nguyen Abstract We consider a general stable flow problem in a directed and capacitated network, where each ertex has a strict
More informationThe Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost
The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost Christina Büsing Sarah Kirchner Arie Koster Annika Thome October 6, 2015 Abstract The budgeted minimum cost flow problem (BMCF(K)) with unit
More informationAre the two relativistic theories compatible?
Are the two relatiistic theories compatible? F. Selleri Dipartimento di Fisica - Uniersità di Bari INFN - Sezione di Bari In a famous relatiistic argument ("clock paradox") a clock U 1 is at rest in an
More informationKinematics of Particles
nnouncements Recitation time is set to 8am eery Monday. Participation i credit will be gien to students t who uploads a good question or good answer to the Q& bulletin board. Suggestions? T s and I will
More informationUNDERSTAND MOTION IN ONE AND TWO DIMENSIONS
SUBAREA I. COMPETENCY 1.0 UNDERSTAND MOTION IN ONE AND TWO DIMENSIONS MECHANICS Skill 1.1 Calculating displacement, aerage elocity, instantaneous elocity, and acceleration in a gien frame of reference
More informationLaplacian Energy of Graphs
Laplacian Energy of Graphs Sigma Xi Research Exhibition Claire T. Carney Library Uniersity of Massachusetts Dartmouth April 28 th & 29 th, 2009 Leanne R. Silia & Gary E. Dais Department of Mathematics
More informationStanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013
Stanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013 Lecture 13 In which we construct a family of expander graphs. The problem of constructing expander graphs
More informationUnit 11: Vectors in the Plane
135 Unit 11: Vectors in the Plane Vectors in the Plane The term ector is used to indicate a quantity (such as force or elocity) that has both length and direction. For instance, suppose a particle moes
More informationThe number of marks is given in brackets [ ] at the end of each question or part question. The total number of marks for this paper is 72.
ADVANCED GCE UNIT 76/ MATHEMATICS (MEI Mechanics MONDAY MAY 7 Additional materials: Answer booklet (8 pages Graph paper MEI Examination Formulae and Tables (MF Morning Time: hour minutes INSTRUCTIONS TO
More informationLecture 4. Random graphs II. 4.1 Automorphisms. 4.2 The number of simple graphs
Lecture 4 Random graphs II 4.1 Automorphisms It turns out that a typical regular graph on a large number of vertices does not have any non-trivial symmetries. This is orginally due to Bollobás [Bol82]
More informationPhysics 2A Chapter 3 - Motion in Two Dimensions Fall 2017
These notes are seen pages. A quick summary: Projectile motion is simply horizontal motion at constant elocity with ertical motion at constant acceleration. An object moing in a circular path experiences
More informationarxiv: v1 [cs.dm] 21 Oct 2017
Eliminating Odd Cycles by Remoing a Matching Carlos V.G.C. Lima 1,, Dieter Rautenbach 2,, Uéerton S. Souza 3,, and Jayme L. Szwarcfiter 4 1 Departament of Coputer Science, Federal Uniersity of Minas Gerais,
More information4 pl. Jussieu, Paris Cedex 05, France (2) Department of Mathematics, Rutgers University. New Brunswick, New Jersey 08903, USA
SOME SIMPLE NONLINEAR PDE S WITHOUT SOLUTIONS Haïm Brezis (1( and Xaier Cabré (1 (1 Analyse Numérique, Uniersité Pierre et Marie Curie 4 pl. Jussieu, 755 Paris Cedex 05, France ( Department of Mathematics,
More informationQuadratic Equation. ax bx c =. = + + =. Example 2. = + = + = 3 or. The solutions are -7/3 and 1.
Quadratic Equation A quadratic equation is any equation that is equialent to the equation in fmat a c + + = 0 (1.1) where a,, and c are coefficients and a 0. The ariale name is ut the same fmat applies
More informationSmall BGK waves and nonlinear Landau damping
Small BGK waes and nonlinear Landau damping hiwu Lin and Chongchun eng School of Mathematics Georgia Institute of Technology Atlanta, GA 333, USA Abstract Consider D Vlaso-poisson system with a ed ion
More information(a) Taking the derivative of the position vector with respect to time, we have, in SI units (m/s),
Chapter 4 Student Solutions Manual. We apply Eq. 4- and Eq. 4-6. (a) Taking the deriatie of the position ector with respect to time, we hae, in SI units (m/s), d ˆ = (i + 4t ˆj + tk) ˆ = 8tˆj + k ˆ. dt
More informationGraphs and Networks Lecture 5. PageRank. Lecturer: Daniel A. Spielman September 20, 2007
Graphs and Networks Lectre 5 PageRank Lectrer: Daniel A. Spielman September 20, 2007 5.1 Intro to PageRank PageRank, the algorithm reportedly sed by Google, assigns a nmerical rank to eery web page. More
More informationСollisionless damping of electron waves in non-maxwellian plasma 1
http:/arxi.org/physics/78.748 Сollisionless damping of electron waes in non-mawellian plasma V. N. Soshnio Plasma Physics Dept., All-Russian Institute of Scientific and Technical Information of the Russian
More information