1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)

Save this PDF as:

Size: px
Start display at page:

Download "1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)"

Transcription

1 Cycle times and xed points of min-max functions Jeremy Gunawardena, Department of Computer Science, Stanford University, Stanford, CA 94305, USA. October 11, 1993 to appear in the proceedings of the 11th International Conference on Analysis and Optimization of Systems, Sophia-Antipolis, France, June Abstract The dynamic behaviour of discrete event systems with only maximum timing constraints (or, dually, only minimum timing constraints) can be studied by linear methods based on max-plus algebra, as discussed in the recent book \Synchronization and Linearity" by Baccelli, Cohen, Quadrat and Olsder. Systems with both maximum and minimum constraints are non-linear from this perspective and only limited results about their behaviour have so far been obtained (Olsder 1991,1993; Gunawardena, 1993). In this paper we describe some new results and conjectures about such systems which generalize the initial earlier work and shed a new light on aspects of the linear theory. Our main result is a necessary and sucient condition for the existence of a xed point (eigenvector) for any min-max function. Keywords: Cycle time, discrete event system, xed point, max-plus algebra, min-max function. Visiting Scholar at the Department of Computer Science from Hewlett-Packard's Stanford Science Centre 0

2 1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound) respectively: ab = max (a; b) and ab = min (a; b). Note that addition distributes over both maximum and minimum: h + (a b) = h + a h + b; h + (a b) = h + a h + b: (1) Denition 1.1 A min-max expression, f, is a term in the grammar: where x 1 ; x 2 ; are variables and a 2 R. f := x 1 ; x 2 ; j f + a j f f j f f For example, x 1 + x 2 x and x 1 2 are forbidden but x 1? 1 x is allowed. (In expressions such as these + has higher binding than or.) Denition 1.2 A min-max function of dimension n is any function, F : R n! R n, each of whose components, F i : R n! R, is a min-max expression of n variables x 1 ; ; x n. The theory of min-max functions is concerned with studying F as a dynamical system: with studying the behaviour of the sequence ~x; F (~x); F 2 (~x);, for varying ~x 2 R n. For a discussion of the origins of this problem see [2, x1] and for information on applications see [3]. There are three existing sources of information about the behaviour of such functions. The earliest is the work on the linear theory of max-plus algebra, [1, Chapter 3]. This work applies to max-only functions: those in which does not appear in any F i. (Dually for min-plus algebra and min-only functions. Because?(a b) = (?a?b), dual results do not require a separate proof and we leave it to the reader to formulate them where necessary.) It is easy to see that any max-only function can be written in canonical form: F i (x 1 ; ; x n ) = (a i1 + x 1 a in + x n ); where a ij 2 R [ f?1g, and that this expression is unique, [2, Lemma 2.1]. If A = (a ij ) is the corresponding matrix in max-plus algebra then, using max-plus matrix notation, F (~x) = A~x (considering vectors as column vectors). Hence we can expect the theory of min-max functions to include the linear theory as a special case. Let ~c(h) = (h; h; ; h) denote the vector each of whose components has the same value h. Denition 1.3 F has a xed point, ~x 2 R n, if, and only if, F (~x) = ~x +~c(h), for some h 2 R. If F is a max-only function and A is the corresponding matrix then, for a xed point ~x of F, A~x = h~x. That is, ~x is an eigenvector of A with eigenvalue h. This number, h, will turn out to be part of the cycle time vector of F which we shall study in x2. The second source of work on min-max functions is due to Olsder, who undertook in [6] the rst investigation of a system with mixed constraints. He considered separated functions 1

3 F : R n! R n for which F i is max-only for 1 i k and F i is min-only for k + 1 i n. Olsder gave a necessary and sucient condition for the existence of a xed point, provided that F satised certain reasonable conditions, [6, Theorem 2.1], [1, Theorem 9.25]. A more recent analysis of the same class of functions, [7], is less relevant to our purposes here. The third and nal work is [2]. This paper has two main results: a proof of eventual periodicity for min-max functions of dimension 2, [2, Theorem 3.3], and a formula for the cycle time of an arbitrary min-max function with a xed point, [2, Theorem 5.1] (see (11) below). The purpose of the present paper is to describe some new results and conjectures which provide a coherent explanation of this previous work. We believe that they capture some of the essential properties of min-max functions and provide a foundation for a deeper study of some of the remaining unsolved problems. They also shed a new light on aspects of the linear theory. The author is very grateful to Professor Geert-Jan Olsder for his encouragement and hospitality during a visit to the University of Delft during which some of the ideas in this paper were developed. The work presented here was undertaken as part of project STETSON, a joint project between Hewlett-Packard Laboratories and Stanford University on asynchronous hardware design. 2 The cycle time vector We shall frequently use numerical operations and relations and apply them to vectors. These should always be assumed to be applied to each component separately. Hence ~u ~v means u i v i for each i. Similarly, ( V l ~a l) i = V l(~a l ) i. We begin by recalling some simple properties of a min-max function F. First, F is continuous. Second, F is monotone: Third, F is homogeneous, in the sense that, for any h 2 R, ~u ~v =) F (~u) F (~v); (2) F (~u + ~c(h)) = F (~u) + ~c(h); (3) This follows easily from (1), [2, Lemma 2.3]. The next property is not quite so obvious. Let j~uj denote the maximum norm on vectors in R n : j~uj = W 1in ju ij, where ju i j is the usual absolute value on real numbers. We require a simple preliminary observation. Lemma 2.1 For any real numbers a i ; b i 2 R with 1 i n, j( a i )? ( b i )j ja i? b i j; j( a i )? ( b i )j ja i? b i j: 1in 1in 1in 1in 1in 1in Proof: Suppose that a k = W 1in a i and b j = W 1in b i. If a k b j then ja k? b j j ja j? b j j. If b j a k then ja k? b j j ja k? b k j. Similarly for the second inequality. Lemma 2.2 (Non-expansive property.) Let F be a min-max function of dimension n. If ~u; ~v 2 R n then jf (~u)? F (~v)j j~u? ~vj. 2

4 Proof: Assume that ~u and ~v are xed and let h = j~u? ~vj. It is sucient to show that if f is any min-max expression of n variables, then jf(~u)? f(~v)j h. The proof of this is by induction on the structure of f. If f x k, then jf(~u)? f(~v)j = ju k? v k j h as required. Now suppose as an inductive hypothesis that the required result holds for f and g. It is obvious that it must then hold for f + a. By the preceding Lemma for n = 2 and the inductive hypothesis, j(f g)(~u)? (f g)(~v)j jf(~u)? f(~v)j jg(~u)? g(~v)j h: Similarly for f g. The result follows by structural induction. F is not contractive. If it were, the Contraction Mapping Theorem, [4, Theorem 3.1.2], would imply that the dynamic behaviour of F was trivial. But suppose that at some point ~x 2 R n F s (~x) lim s!1 s exists. (Note that this is a vector quantity in R n.) It then follows from Lemma 2.2 that this limit must exist at all points of R n and must have the same value. In the applications of min-max functions, the state vector ~x is often interpreted as a vector of occurrence times of certain events and the vector F (~x) as the times of next occurrence. Hence the limit in (4) can be thought of as the vector of asymptotic average times to the next occurrence of the events: F s (~x)? F s?1 (~x) + + F (~x)? ~x s = F s (~x)? ~x ; s which tends to (4) as s! 1, [2, x1]. This motivates the following denition. (4) Denition 2.1 Let F be a min-max function. If the limit (4) exists somewhere, it is called the cycle time vector of F and denoted by ~(F ) 2 R n. This brings us to our rst problem. When does the cycle time vector exist? Suppose rst that F is a max-only function of dimension n and that A is the associated n n matrix in max-plus algebra. We recall that the precedence graph of A, [1, Denition 2.8], denoted G(A), is the directed graph with annotated edges which has nodes f1; 2; ; ng and an edge from j to i if, and only if, A ij 6=?1. The annotation on this edge is then the real number A ij. A path in this graph has the usual meaning of a sequence of directed edges and a circuit is a path which starts and ends at the same node, [1, x2.2]. The weight of a path p, jpjw, is the sum of the annotations on the edges in the path. The length of a path, jpj`, is the number of edges in the path. If g is a circuit, the ratio jgjw=jgj` is the cycle mean of the circuit, [1, Denition 2.18]. Denition 2.2 If A is an n n matrix in max-plus algebra, let ~(A) 2 (R [ f?1g) n be the vector such that i (A) = W f jgjw=jgj` j g a circuit in G(A) upstream from node ig. Dually, if B is a matrix in min-plus algebra, then ~(B) will denote the vector of minimum cycle means. A circuit is upstream from node i if there is a path in G(A) from some node on the circuit to node i. Because of the conventions of canonical form, [2, x2], if A is a matrix associated to a max-only function then any node in G(A) has at least one upstream circuit and so ~(A) 2 R n. 3

5 Proposition 2.1 Let F be a max-only function and A the associated matrix in max-plus algebra. The limit (4) always exists and the cycle time vector is given by ~(F ) = ~(A). Proof: Let 1 (A) = h. Suppose initially that h = 0 and consider the sequence of numbers (s) = (A s ) 1 (0; ; 0). We can interpret (s) as the maximum weight among paths in G(A) which are of length s and which terminate at node 1, [1, x2.3.1]. If we consider any path terminating at node 1 then the only positive contribution to the weight of the path can come from those edges which are not repeated on the path: a repeated edge would be contained in a circuit, whose contribution to the path weight is at most 0. Since there are only nitely many edges, the weight of any path must be bounded above by P A Aij >0 ij. Hence (s) is bounded above. We also know that there is some circuit upstream from node 1 whose weight is 0. Call this circuit g. For s suciently large, we can construct a path, p(s), leading to node 1 whose starting point cycles round the circuit g. The weight of this path can only assume a nite set of values because jgjw = 0. Since (s) is the path of maximum weight of length s, it follows that (s) jp(s)jw and so (s) is also bounded below. We have shown that there exist m; M 2 R such that, for all s 0, m (s) M. It follows immediately that lim s!1 (s)=s = 0. Hence, (F s (0; ; 0)) 1 (A s ) 1 (0; ; 0) (s) lim = lim = lim = 0 = 1 (A): s!1 s s!1 s s!1 s If h 6= 0 then replace F by G(~x) = F (~x)? ~c(h). G is also a min-max function and it follows from (3) that B, the associated matrix, satises B ij = A ij? h. Hence 1 (B) = 0 and we can apply the argument above to show that lim s!1 (G s (0; ; 0)) 1 =s = 0. But since F = G +~c(h), it follows from (3) that lim s!1 F s (0; ; 0)) 1 =s = h = 1 (A). The same argument can be applied to any component of F and the result follows. This result associates certain real numbers to any max-only function. Examples show that these are not the same as the eigenvalues of A and the relationship between cycle times and eigenvalues has yet to be determined. In x3 we shall see that when F has a xed point, ~v, then there is a unique cycle time which coincides with the eigenvalue of the eigenvector ~v. We now return to the case of an arbitrary min-max function of dimension n. Each component of F can be placed in conjunctive normal form: F k (~x) = (A k 11 + x 1 A k 1n + x n ) (A k`(k)1 + x 1 A k`(k)n + x n); (5) where A k ij 2 R [ f?1g, [2, x2]. Here `(k) is the number of conjunctions in the component F k. It is an important property of min-max functions that conjunctive normal form is unique up to re-ordering of the conjunctions, [2, Theorem 2.1]. We can now associate a max-plus matrix A to F by choosing, for the k-th row of the matrix, one of the `(k) conjunctions in (5): A kj = A k where 1 i ikj k `(k) species which conjunction is chosen in row k. Denition 2.3 The matrix A constructed in this way is called a max-only projection of F. The set of all max-only projections is denoted P(F ). Dually, the set of min-only projections of F, Q(F ), is constructed from the disjunctive normal form of F. If A is any max-only projection of F, it is clear from the construction above that F (~x) A~x for any ~x 2 R n. It follows from (2) that F s (~x) A s ~x for all s 0. Now choose > 0. 4

6 It then follows from Proposition 2.1 that, for all suciently large s, F s (~x)=s ~(A) + ~c(). Since this holds for any max-only projection, and there are only nitely many such, we see that F s (~x)=s ( V ~(A)) + ~c() for all suciently large s. By a dual argument applied to the min-only projections of F, we can conclude that ( for all suciently large s. ~(B))? ~c() F s (~x) s ( ~(A)) + ~c(): (6) Conjecture 2.1 (The Duality Conjecture.) Let F be any min-max function. Then, ~(B) = ~(A): The signicance of this should be clear. It implies that any min-max function has a cycle time and gives us a formula for computing it. Of course (4) could still exist without the Conjecture being true. We should note in passing that since was arbitrary, (6) already tells us that ~(B) ~(A): (7) What evidence is there to support the Duality Conjecture? It is easy to show that it holds for any max-only (dually, any min-only) function. In dimension 2 it follows from the geometric methods of [2] that (4) always exists. It can also be shown that the Duality Conjecture holds but this requires a complicated combinatorial argument (unpublished). Finally, we shall see in the next section that the Conjecture holds for any function with a xed point. 3 The existence of xed points Lemma 3.1 Let F be any min-max function of dimension n and let P(F ) = fa 1 ; ; A N g. The function f1; ; ng f1; ; Ng! R taking (i; j)! i (A j ) has a saddle point: i (A j ) = i (A j ): 1in 1jN 1jN 1in Proof: Let V 1jN i(a j ) = h i and suppose that the h i are ordered so that h i1 h i2 h in where fi1; ; ing = f1; ; ng. We shall exhibit a matrix X 2 P(F ) such that W 1in i(x) = h i1. It then follows that i (A j ) h i1 = i (A j ) 1jN 1in 1in 1jN and since the reverse inequality always holds, [5, Lemma 1.3.1], the result will be established. We shall need some extra notation for sets A and B: AnB = fi 2 A j i 62 Bg. 5

7 By construction, there is some matrix A 2 P(F ) such that i1 (A) = h i1. Let S 1 f1; ; ng be those nodes in G(A) for which some path exists to i1. Note that fi1g S 1. For each index i 2 S, let X i = A i. Note that if X i is dened and X ij 6=?1, the X j is also dened. Hence, no matter how we ll in the remaining rows of X, there can be no path in G(X) which starts at some node j 62 S 1 and terminates at some node i 2 S 1. Furthermore any circuit in G(X) which lies entirely in S 1 must have cycle mean at most h i1. Now consider h i2. As before, there is some matrix A 0 2 P(F ) such that i2 (A 0 ) = h i2. Let S 0 f1; ; ng be those nodes in G(A 0 ) for which some path exists to i2. Let X i = (A 0 ) i for any index i 2 S 0 ns 1 and let S 2 = S 0 [ S be those indices for which X i is now dened. Note that fi1; i2g S 2. S 2 has the same properties as S 1. If i 2 S 2 and X ij 6=?1 then j 2 S 2. Furthermore, because of this same property for S 1, if we complete the remaining rows of X in any manner whatsoever, then any circuit in G(X) whose nodes lie entirely in S 2 must in fact lie entirely in S 1 or entirely in S 0 ns 1. If the former, then the cycle mean is at most h i1 ; if the latter, then the cycle mean is at most h i2. In either case the cycle mean is at most h i1. We can proceed in this way to inductively build up a complete matrix X 2 P(F ). By construction, W 1in i(x) = h i1. This completes the proof. If A is an n n matrix in max-plus algebra let (A) denote the maximum cycle mean of A: (A) = W 1in i(a). Similarly, let (B) denote the minimum cycle mean of a min-plus matrix B. It follows from Lemma 3.1 and (7) that ~c( (B)) ~(B) ~(A) ~c( (A)): (8) Now let F be any min-max function and suppose that ~x is a xed point of F : F (~x) = ~x +~c(h). It follows from (3) that F s (~x) = ~x + s~c(h). Hence the cycle time vector exists and is given by ~(F ) = ~c(h). All the components of the cycle time vector are equal. What can we say about the cycle means? It was shown in [2, Theorem 5.1] that when F has a xed point, W (B) = V (A) and if h denotes this common value then ~(F ) = ~c(h). This should be considered as a generalization to min-max functions of the classical \Perron-Frobenius" theorem on the eigenvalues of an irreducible max-plus matrix, [1, Theorem 3.23]. It follows from (8) that in this case the Duality Conjecture is true for F. In fact we can distinguish three conditions which are implied by the existence of a xed point: ~(A) = ~c(h); (9) ~(B) = ~c(h); (10) (B) = h = (A): (11) Because of (8), (11) implies both (9) and (10). If the Duality Conjecture holds then Lemma 3.1 shows that either (9) or (10) separately imply (11) and all the conditions are equivalent. The remainder of this section is concerned with determining when the necessary conditions above are also sucient. As usual, we rst consider the simple case. 6

8 Proposition 3.1 Let F be a max-only function and A the associated matrix in max-plus algebra. F has a xed point if, and only if, ~(A) = ~c(h), for some h 2 R. Proof: If F has a xed point then the result is just (9). So suppose that ~(A) = ~c(h). By using the same trick as in Proposition 2.1 we may assume that h = 0. Let i be any node in G(A). There is some circuit upstream from i which has the maximum weight of 0. Let k be a node on this circuit. The vector v(i) = A + = W k s1 As k can be shown to be an eigenvector of A with eigenvalue 0, [2, Lemma 4.3] (see also [1, x3.7.2]). However, v(i) 62 R n in general. For instance, if there is no path from k to j, then A + =?1. But note that jk A+ 6=?1 ik since, by construction, there is a path from k to i. We can carry out this construction for each node i because i (A) = 0 by hypothesis. Hence we can nd vectors v(1); ; v(n) such that v(i) i 6=?1 and Av(i) = v(i). But then, by max-plus linearity, v = W i v(i) is clearly an eigenvector: Av = v. Moreover, v i 6=?1 for any i. Hence v is a xed point of F. This completes the proof. This result has not appeared before in the max-plus literature, to the best of our knowledge. Theorem 3.1 Let F be any min-max function. F has a xed point if, and only if, (B) = (A): Proof: If F has a xed point then the result is just (11) above. So suppose that (11) holds. As usual, we may assume that h = 0. Let X 2 P(F ) be any max-only projection for which (X) = h. Then, by (8), ~c(h) ~(X) ~(A) = ~c(h): It follows that ~(X) = ~c(h). Hence, by Proposition 3.1, X has a real eigenvector ~v. By construction of the max-only projections, it follows that F (~v) X~v = ~v. (Recall that h was assumed to be 0.) Hence, by (2), F s (~v) is a decreasing sequence. We can apply a similar argument to the min-only projections of B and nd a vector ~u such that ~u F (~u). Again using (2), F s (~u) is an increasing sequence. However, neither sequence can respectively decrease or increase too far because F is non-expansive. It is easy to see from Lemma 2.2 that F s (~v) must be bounded below and F s (~u) must be bounded above. But a bounded monotonic sequence must converge. Hence there exist vectors ~u 1 and ~v 1, not necessarily distinct, such that lim s!1 F s (~v) = ~v 1 and lim s!1 F s (~u) = ~u 1. Since F is continuous it follows that F (~v 1 ) = ~v 1 and F (~u 1 ) = ~u 1. This completes the proof. Theorem 3.1 is relatively weaker than Proposition 3.1 because the former uses (11) while the latter uses (9). (11) is inconvenient in practice because it requires information on both P(F ) and Q(F ). For example, if the Duality Conjecture were true then it could be shown that the conditions of Olsder's xed point theorem for separated functions, [6, Theorem 2.1], imply (9) 7

9 and we could deduce Olsder's theorem as a corollary of Theorem 3.1. In the absence of the Conjecture, this appears dicult. As another example suppose that F has a periodic point, ~x, where F k (~x) = ~x + ~c(h), [2, Denition 2.3]. It follows easily from (3) that the cycle time vector exists and ~(F ) = ~c(h=k). If the Duality Conjecture were true we could deduce the strong result that a min-max function has a periodic point if, and only if, it has a xed point. This, and stronger results, are already known to hold in dimension 2, [2, Theorem 3.3]. 4 Conclusion The main contribution of this paper is the identication of the Duality Conjecture and the demonstration of its signicance for the deeper study of min-max functions. References [1] F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity. Wiley Series in Probability and Mathematical Statistics. John Wiley and Sons, [2] J. Gunawardena. Min-max functions, Part I. Technical Report STAN-CS , Department of Computer Science, Stanford University, May [3] J. Gunawardena. Timing analysis of digital circuits and the theory of min-max functions. In TAU'93, ACM International Workshop on Timing Issues in the Specication and Synthesis of Digital Systems, September [4] V. I. Istratescu. Fixed Point Theory, volume 7 of Mathematics and its Applications. D. Reidel Publishing Company, [5] S. Karlin. Mathematical Methods and Theory in Games, Programming and Economics, Volume I. Addison-Wesley, [6] G. J. Olsder. Eigenvalues of dynamic max-min systems. Journal on Discrete Event Dynamical Systems, 1:177{207, [7] G. J. Olsder. Analysis of min-max systems. Rapports de Recherche 1904, INRIA, May Note to the reader Copies of [2, 3] are available by ftp from hplose.hpl.hp.com, IP address Use \anonymous" as user name and refer to \/pub/jhcg/readme" for more information. 8

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim

arxiv: v2 [cs.dm] 29 Mar 2013

arxiv:1302.6346v2 [cs.dm] 29 Mar 2013 Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard Laboratoire I3S, CNRS & Université de Nice-Sophia Antipolis, France.

Erdös-Ko-Rado theorems for chordal and bipartite graphs

Erdös-Ko-Rado theorems for chordal and bipartite graphs arxiv:0903.4203v2 [math.co] 15 Jul 2009 Glenn Hurlbert and Vikram Kamat School of Mathematical and Statistical Sciences Arizona State University,

Markov 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,

Boolean Inner-Product Spaces and Boolean Matrices

Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver

How to Pop a Deep PDA Matters

How to Pop a Deep PDA Matters Peter Leupold Department of Mathematics, Faculty of Science Kyoto Sangyo University Kyoto 603-8555, Japan email:leupold@cc.kyoto-su.ac.jp Abstract Deep PDA are push-down automata

Back circulant Latin squares and the inuence of a set. L F Fitina, Jennifer Seberry and Ghulam R Chaudhry. Centre for Computer Security Research

Back circulant Latin squares and the inuence of a set L F Fitina, Jennifer Seberry and Ghulam R Chaudhry Centre for Computer Security Research School of Information Technology and Computer Science University

1 Introduction This work follows a paper by P. Shields [1] concerned with a problem of a relation between the entropy rate of a nite-valued stationary

Prexes and the Entropy Rate for Long-Range Sources Ioannis Kontoyiannis Information Systems Laboratory, Electrical Engineering, Stanford University. Yurii M. Suhov Statistical Laboratory, Pure Math. &

Min-Rank Conjecture for Log-Depth Circuits

Min-Rank Conjecture for Log-Depth Circuits Stasys Jukna a,,1, Georg Schnitger b,1 a Institute of Mathematics and Computer Science, Akademijos 4, LT-80663 Vilnius, Lithuania b University of Frankfurt, Institut

Lower Bounds for Shellsort. April 20, Abstract. We show lower bounds on the worst-case complexity of Shellsort.

Lower Bounds for Shellsort C. Greg Plaxton 1 Torsten Suel 2 April 20, 1996 Abstract We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an (n

Logic Part I: Classical Logic and Its Semantics

Logic Part I: Classical Logic and Its Semantics Max Schäfer Formosan Summer School on Logic, Language, and Computation 2007 July 2, 2007 1 / 51 Principles of Classical Logic classical logic seeks to model

Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures

2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon

MARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES. Contents

MARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES JAMES READY Abstract. In this paper, we rst introduce the concepts of Markov Chains and their stationary distributions. We then discuss

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

Primitive Matrices with Combinatorial Properties

Southern Illinois University Carbondale OpenSIUC Research Papers Graduate School Fall 11-6-2012 Primitive Matrices with Combinatorial Properties Abdulkarem Alhuraiji al_rqai@yahoo.com Follow this and additional

P = 1 F m(p ) = IP = P I = f(i) = QI = IQ = 1 F m(p ) = Q, so we are done.

Section 1.6: Invertible Matrices One can show (exercise) that the composition of finitely many invertible functions is invertible. As a result, we have the following: Theorem 6.1: Any admissible row operation

10.4 The Kruskal Katona theorem

104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian

LECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]

LECTURE VII: THE JORDAN CANONICAL FORM MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue

1.3 Convergence of Regular Markov Chains

Markov Chains and Random Walks on Graphs 3 Applying the same argument to A T, which has the same λ 0 as A, yields the row sum bounds Corollary 0 Let P 0 be the transition matrix of a regular Markov chain

A version of for which ZFC can not predict a single bit Robert M. Solovay May 16, Introduction In [2], Chaitin introd

CDMTCS Research Report Series A Version of for which ZFC can not Predict a Single Bit Robert M. Solovay University of California at Berkeley CDMTCS-104 May 1999 Centre for Discrete Mathematics and Theoretical

University of Missouri. In Partial Fulllment LINDSEY M. WOODLAND MAY 2015

Frames and applications: Distribution of frame coecients, integer frames and phase retrieval A Dissertation presented to the Faculty of the Graduate School University of Missouri In Partial Fulllment of

On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers

On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers Ger Koole INRIA Sophia Antipolis B.P. 93, 06902 Sophia Antipolis Cedex France Mathematics of Operations Research 21:469

Multiplicative Conjunction and an Algebraic. Meaning of Contraction and Weakening. A. Avron. School of Mathematical Sciences

Multiplicative Conjunction and an Algebraic Meaning of Contraction and Weakening A. Avron School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv 69978, Israel Abstract

Introduction Finding the explicit form of Killing spinors on curved spaces can be an involved task. Often, one merely uses integrability conditions to

CTP TAMU-22/98 LPTENS-98/22 SU-ITP-98/3 hep-th/98055 May 998 A Construction of Killing Spinors on S n H. Lu y, C.N. Pope z and J. Rahmfeld 2 y Laboratoire de Physique Theorique de l' Ecole Normale Superieure

290 J.M. Carnicer, J.M. Pe~na basis (u 1 ; : : : ; u n ) consisting of minimally supported elements, yet also has a basis (v 1 ; : : : ; v n ) which f

Numer. Math. 67: 289{301 (1994) Numerische Mathematik c Springer-Verlag 1994 Electronic Edition Least supported bases and local linear independence J.M. Carnicer, J.M. Pe~na? Departamento de Matematica

Analysis on Graphs. Alexander Grigoryan Lecture Notes. University of Bielefeld, WS 2011/12

Analysis on Graphs Alexander Grigoryan Lecture Notes University of Bielefeld, WS 0/ Contents The Laplace operator on graphs 5. The notion of a graph............................. 5. Cayley graphs..................................

Congurations of periodic orbits for equations with delayed positive feedback

Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics

Sergey Fomin* and. Minneapolis, MN We consider the partial order on partitions of integers dened by removal of

Rim Hook Lattices Sergey Fomin* Department of Mathematics, Massachusetts Institute of Technology Cambridge, MA 02139 Theory of Algorithms Laboratory St. Petersburg Institute of Informatics Russian Academy

BERNARD RUSSO. University of California, Irvine

A HOLOMORPHIC CHARACTERIZATION OF OPERATOR ALGEBRAS (JOINT WORK WITH MATT NEAL) BERNARD RUSSO University of California, Irvine UNIVERSITY OF CALIFORNIA, IRVINE ANALYSIS SEMINAR OCTOBER 16, 2012 KEYWORDS

Linear Algebra: Characteristic Value Problem

Linear Algebra: Characteristic Value Problem . The Characteristic Value Problem Let < be the set of real numbers and { be the set of complex numbers. Given an n n real matrix A; does there exist a number

Proof. We indicate by α, β (finite or not) the end-points of I and call

C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending

2 optimal prices the link is either underloaded or critically loaded; it is never overloaded. For the social welfare maximization problem we show that

1 Pricing in a Large Single Link Loss System Costas A. Courcoubetis a and Martin I. Reiman b a ICS-FORTH and University of Crete Heraklion, Crete, Greece courcou@csi.forth.gr b Bell Labs, Lucent Technologies

Some Combinatorial Aspects of Time-Stamp Systems. Unite associee C.N.R.S , cours de la Liberation F TALENCE.

Some Combinatorial spects of Time-Stamp Systems Robert Cori Eric Sopena Laboratoire Bordelais de Recherche en Informatique Unite associee C.N.R.S. 1304 351, cours de la Liberation F-33405 TLENCE bstract

On Locating-Dominating Codes in Binary Hamming Spaces

Discrete Mathematics and Theoretical Computer Science 6, 2004, 265 282 On Locating-Dominating Codes in Binary Hamming Spaces Iiro Honkala and Tero Laihonen and Sanna Ranto Department of Mathematics and

2 PAVEL PUDLAK AND JIRI SGALL may lead to a monotone model of computation, which makes it possible to use available lower bounds for monotone models o

Algebraic models of computation and interpolation for algebraic proof systems Pavel Pudlak and Jir Sgall 1. Introduction We consider some algebraic models used in circuit complexity theory and in the study

A Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract

A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin

An Alternative To The Iteration Operator Of. Propositional Dynamic Logic. Marcos Alexandre Castilho 1. IRIT - Universite Paul Sabatier and

An Alternative To The Iteration Operator Of Propositional Dynamic Logic Marcos Alexandre Castilho 1 IRIT - Universite Paul abatier and UFPR - Universidade Federal do Parana (Brazil) Andreas Herzig IRIT

Calculating determinants for larger matrices

Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det

IE 5531: Engineering Optimization I

IE 5531: Engineering Optimization I Lecture 7: Duality and applications Prof. John Gunnar Carlsson September 29, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 29, 2010 1

2 RODNEY G. DOWNEY STEFFEN LEMPP Theorem. For any incomplete r.e. degree w, there is an incomplete r.e. degree a > w such that there is no r.e. degree

THERE IS NO PLUS-CAPPING DEGREE Rodney G. Downey Steffen Lempp Department of Mathematics, Victoria University of Wellington, Wellington, New Zealand downey@math.vuw.ac.nz Department of Mathematics, University

Example Bases and Basic Feasible Solutions 63 Let q = >: ; > and M = >: ;2 > and consider the LCP (q M). The class of ; ;2 complementary cones

Chapter 2 THE COMPLEMENTARY PIVOT ALGORITHM AND ITS EXTENSION TO FIXED POINT COMPUTING LCPs of order 2 can be solved by drawing all the complementary cones in the q q 2 - plane as discussed in Chapter.

of acceptance conditions (nite, looping and repeating) for the automata. It turns out,

Reasoning about Innite Computations Moshe Y. Vardi y IBM Almaden Research Center Pierre Wolper z Universite de Liege Abstract We investigate extensions of temporal logic by connectives dened by nite automata

Eigenvalues and Eigenvectors

LECTURE 3 Eigenvalues and Eigenvectors Definition 3.. Let A be an n n matrix. The eigenvalue-eigenvector problem for A is the problem of finding numbers λ and vectors v R 3 such that Av = λv. If λ, v are

4 Sums of Independent Random Variables

4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables

Fundamental gaps in numerical semigroups

Journal of Pure and Applied Algebra 189 (2004) 301 313 www.elsevier.com/locate/jpaa Fundamental gaps in numerical semigroups J.C. Rosales a;, P.A. Garca-Sanchez a, J.I. Garca-Garca a, J.A. Jimenez Madrid

Standard forms for writing numbers

Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,

Language Acquisition and Parameters: Part II

Language Acquisition and Parameters: Part II Matilde Marcolli CS0: Mathematical and Computational Linguistics Winter 205 Transition Matrices in the Markov Chain Model absorbing states correspond to local

Some generalizations of Abhyankar lemma. K.N.Ponomaryov. Abstract. ramied extensions of discretely valued elds for an arbitrary (not

Some generalizations of Abhyankar lemma. K.N.Ponomaryov Abstract We prove some generalizations of Abhyankar lemma about tamely ramied extensions of discretely valued elds for an arbitrary (not nite, not

A Solution of a Tropical Linear Vector Equation

A Solution of a Tropical Linear Vector Equation NIKOLAI KRIVULIN Faculty of Mathematics and Mechanics St. Petersburg State University 28 Universitetsky Ave., St. Petersburg, 198504 RUSSIA nkk@math.spbu.ru

Upper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139

Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT FALL 2006 PRINCETON UNIVERSITY

LECTURE VI: SELF-ADJOINT AND UNITARY OPERATORS MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO 1 Adjoint of a linear operator Note: In these notes, V will denote a n-dimensional euclidean vector

Decision Problems Concerning. Prime Words and Languages of the

Decision Problems Concerning Prime Words and Languages of the PCP Marjo Lipponen Turku Centre for Computer Science TUCS Technical Report No 27 June 1996 ISBN 951-650-783-2 ISSN 1239-1891 Abstract This

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with

Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient

Cutting Plane Methods I

6.859/15.083 Integer Programming and Combinatorial Optimization Fall 2009 Cutting Planes Consider max{wx : Ax b, x integer}. Cutting Plane Methods I Establishing the optimality of a solution is equivalent

AN ITERATION. In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b

AN ITERATION In part as motivation, we consider an iteration method for solving a system of linear equations which has the form x Ax = b In this, A is an n n matrix and b R n.systemsof this form arise

Semi-strongly asymptotically non-expansive mappings and their applications on xed point theory

Hacettepe Journal of Mathematics and Statistics Volume 46 (4) (2017), 613 620 Semi-strongly asymptotically non-expansive mappings and their applications on xed point theory Chris Lennard and Veysel Nezir

4.1 Notation and probability review

Directed and undirected graphical models Fall 2015 Lecture 4 October 21st Lecturer: Simon Lacoste-Julien Scribe: Jaime Roquero, JieYing Wu 4.1 Notation and probability review 4.1.1 Notations Let us recall

LEBESGUE INTEGRATION. Introduction

LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,

NUMERICAL MACAULIFICATION

NUMERICAL MACAULIFICATION JUAN MIGLIORE AND UWE NAGEL Abstract. An unpublished example due to Joe Harris from 1983 (or earlier) gave two smooth space curves with the same Hilbert function, but one of the

U.C. Berkeley CS294: Beyond Worst-Case Analysis Handout 12 Luca Trevisan October 3, 2017

U.C. Berkeley CS94: Beyond Worst-Case Analysis Handout 1 Luca Trevisan October 3, 017 Scribed by Maxim Rabinovich Lecture 1 In which we begin to prove that the SDP relaxation exactly recovers communities

The Skorokhod reflection problem for functions with discontinuities (contractive case)

The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function

Behavioural theories and the proof of. LIENS, C.N.R.S. U.R.A & Ecole Normale Superieure, 45 Rue d'ulm, F{75230 Paris Cedex 05, France

Behavioural theories and the proof of behavioural properties Michel Bidoit a and Rolf Hennicker b b a LIENS, C.N.R.S. U.R.A. 1327 & Ecole Normale Superieure, 45 Rue d'ulm, F{75230 Paris Cedex 05, France

Lecture 5. 1 Chung-Fuchs Theorem. Tel Aviv University Spring 2011

Random Walks and Brownian Motion Tel Aviv University Spring 20 Instructor: Ron Peled Lecture 5 Lecture date: Feb 28, 20 Scribe: Yishai Kohn In today's lecture we return to the Chung-Fuchs theorem regarding

On the reconstruction of the degree sequence

Discrete Mathematics 259 (2002) 293 300 www.elsevier.com/locate/disc Note On the reconstruction of the degree sequence Charles Delorme a, Odile Favaron a, Dieter Rautenbach b;c; ;1 a LRI, Bât. 490, Universite

The Matrix-Tree Theorem

The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also

Spectral radius, symmetric and positive matrices

Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an

Chapter 3. Loop and Cut-set Analysis

Chapter 3. Loop and Cut-set Analysis By: FARHAD FARADJI, Ph.D. Assistant Professor, Electrical Engineering, K.N. Toosi University of Technology http://wp.kntu.ac.ir/faradji/electriccircuits2.htm References:

Extracted from a working draft of Goldreich s FOUNDATIONS OF CRYPTOGRAPHY. See copyright notice.

106 CHAPTER 3. PSEUDORANDOM GENERATORS Using the ideas presented in the proofs of Propositions 3.5.3 and 3.5.9, one can show that if the n 3 -bit to l(n 3 ) + 1-bit function used in Construction 3.5.2

University of California. Berkeley, CA fzhangjun johans lygeros Abstract

Dynamical Systems Revisited: Hybrid Systems with Zeno Executions Jun Zhang, Karl Henrik Johansson y, John Lygeros, and Shankar Sastry Department of Electrical Engineering and Computer Sciences University

using the Hamiltonian constellations from the packing theory, i.e., the optimal sphere packing points. However, in [11] it is shown that the upper bou

Some 2 2 Unitary Space-Time Codes from Sphere Packing Theory with Optimal Diversity Product of Code Size 6 Haiquan Wang Genyuan Wang Xiang-Gen Xia Abstract In this correspondence, we propose some new designs

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

Three-dimensional Stable Matching Problems. Cheng Ng and Daniel S. Hirschberg. Department of Information and Computer Science

Three-dimensional Stable Matching Problems Cheng Ng and Daniel S Hirschberg Department of Information and Computer Science University of California, Irvine Irvine, CA 92717 Abstract The stable marriage

2 C. A. Gunter ackground asic Domain Theory. A poset is a set D together with a binary relation v which is reexive, transitive and anti-symmetric. A s

1 THE LARGEST FIRST-ORDER-AXIOMATIZALE CARTESIAN CLOSED CATEGORY OF DOMAINS 1 June 1986 Carl A. Gunter Cambridge University Computer Laboratory, Cambridge C2 3QG, England Introduction The inspiration for

CS168: The Modern Algorithmic Toolbox Lecture #8: How PCA Works

CS68: The Modern Algorithmic Toolbox Lecture #8: How PCA Works Tim Roughgarden & Gregory Valiant April 20, 206 Introduction Last lecture introduced the idea of principal components analysis (PCA). The

Note An example of a computable absolutely normal number

Theoretical Computer Science 270 (2002) 947 958 www.elsevier.com/locate/tcs Note An example of a computable absolutely normal number Veronica Becher ; 1, Santiago Figueira Departamento de Computation,

Fixed Point Theorems

Fixed Point Theorems Definition: Let X be a set and let f : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den

University of Groningen System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF)

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)

8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant

Some Examples of Lexicographic Order Algorithms and some Open Combinatorial Problems

Some Examples of Lexicographic Order Algorithms and some Open Combinatorial Problems Dimitar Vandev A general reasoning based on the lexicographic order is studied. It helps to create algorithms for generation

Problem Description The problem we consider is stabilization of a single-input multiple-state system with simultaneous magnitude and rate saturations,

SEMI-GLOBAL RESULTS ON STABILIZATION OF LINEAR SYSTEMS WITH INPUT RATE AND MAGNITUDE SATURATIONS Trygve Lauvdal and Thor I. Fossen y Norwegian University of Science and Technology, N-7 Trondheim, NORWAY.

Welsh s problem on the number of bases of matroids

Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University

FIXED POINT ITERATIONS

FIXED POINT ITERATIONS MARKUS GRASMAIR 1. Fixed Point Iteration for Non-linear Equations Our goal is the solution of an equation (1) F (x) = 0, where F : R n R n is a continuous vector valued mapping in

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field

balls, Edalat and Heckmann [4] provided a simple explicit construction of a computational model for a Polish space. They also gave domain theoretic pr

Electronic Notes in Theoretical Computer Science 6 (1997) URL: http://www.elsevier.nl/locate/entcs/volume6.html 9 pages Computational Models for Ultrametric Spaces Bob Flagg Department of Mathematics and

2 Interval-valued Probability Measures

Interval-Valued Probability Measures K. David Jamison 1, Weldon A. Lodwick 2 1. Watson Wyatt & Company, 950 17th Street,Suite 1400, Denver, CO 80202, U.S.A 2. Department of Mathematics, Campus Box 170,

Putzer s Algorithm. Norman Lebovitz. September 8, 2016

Putzer s Algorithm Norman Lebovitz September 8, 2016 1 Putzer s algorithm The differential equation dx = Ax, (1) dt where A is an n n matrix of constants, possesses the fundamental matrix solution exp(at),

For example, if M = where A,,, D are n n matrices over F which all commute with each other, then Theorem 1says det F M = det F (AD, ): (2) Theorem 1 w

Determinants of lock Matrices John R. Silvester 1 Introduction Let us rst consider the 2 2 matrices M = a b c d and product are given by M + N = a + e b + f c + g d + h and MN = and N = e f g h ae + bg

Lecture 5. Theorems of Alternatives and Self-Dual Embedding

IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c

Upper and Lower Bounds for Tree-like. Cutting Planes Proofs. Abstract. In this paper we study the complexity of Cutting Planes (CP) refutations, and

Upper and Lower Bounds for Tree-like Cutting Planes Proofs Russell Impagliazzo Toniann Pitassi y Alasdair Urquhart z UCSD UCSD and U. of Pittsburgh University of Toronto Abstract In this paper we study

Topics in linear algebra

Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over

WARDROP EQUILIBRIA IN AN INFINITE NETWORK

LE MATEMATICHE Vol. LV (2000) Fasc. I, pp. 1728 WARDROP EQUILIBRIA IN AN INFINITE NETWORK BRUCE CALVERT In a nite network, there is a classical theory of trafc ow, which gives existence of a Wardrop equilibrium

4. Ergodicity and mixing

4. Ergodicity and mixing 4. Introduction In the previous lecture we defined what is meant by an invariant measure. In this lecture, we define what is meant by an ergodic measure. The primary motivation

On reaching head-to-tail ratios for balanced and unbalanced coins

Journal of Statistical Planning and Inference 0 (00) 0 0 www.elsevier.com/locate/jspi On reaching head-to-tail ratios for balanced and unbalanced coins Tamas Lengyel Department of Mathematics, Occidental

The matrix approach for abstract argumentation frameworks

The matrix approach for abstract argumentation frameworks Claudette CAYROL, Yuming XU IRIT Report RR- -2015-01- -FR February 2015 Abstract The matrices and the operation of dual interchange are introduced

A Characterization of (3+1)-Free Posets

Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of

Calculating Web Page Authority Using the PageRank Algorithm

Jacob Miles Prystowsky and Levi Gill Math 45, Fall 2005 1 Introduction 1.1 Abstract In this document, we examine how the Google Internet search engine uses the PageRank algorithm to assign quantitatively