RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

Size: px
Start display at page:

Download "RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES"

Transcription

1 RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete mathematics, secifically relating to modeling natural rocesses. We examine, summarize, and exlain the roofs related to the following natural rocesses: Percolation and Random Walks. We resent the main results of two aers and rovide the roofs to demonstrate how combinatorics, exected value, and generating functions, among other tools, can be used to model such natural rocesses using discrete mathematics.. Introduction Both aers resented in this revew were written by: Hochstadt, Padilla, and Zwiebach, students of Mathematics at the Massachusetts Institute of Technology. The research aers are of interest because they tackle the issues of modeling natural rocesses in nature via mathematics. The two main methods of analysis are combinatorial roofs and emirical analyses. The two random rocesses discussed in the aers are: Random Walks and Percolation. We rovide attachments containing the original aer with the comlete set of results, but for the uroses of this survey aer, we focus on the main results of each aer- those that deal with finding roof based models of the rocesses. More secifically the structure of the aer will be as such: () Introduction Descrition of Random Walks in Z Descrition of Percolation. () Proofs Main result from Analysis of Random Walks in Z Main Result from Percolation (3) Discussion/Conclusion.. Random Walks. In this articular verison of Random Walks, we examine a "walker" taking random stes in Z,thetwodimensionallattice. Our walker takes a ste at each discrete time interval t and must go in in one of the four cardinal directions (left, right, u, or down.) More recisely, if our walker finds themselves at location (x, y) at time t, thenattimet +, they will be at either (x, y ± ) or (x ±,y). Sincethisisarandomrocess we stiulate that the walker goes in any of the four cardinal directions with robability. Since the walker cannot stay in the same sot, they take a 4 ste at each time interval with robability.

2 AARON ZWIEBACH In the aer that we are reviewing, we exlore the dynamic between our walker and a series of boundary oints. We define a boundary oint as a oint, (x 0,y 0 ),thatoncereachedendstherandomwalk.imagineourwalker finds themsemselves initialized at the center of a square boundary and begins the random walk, with what robability would they reach the boundary at any given time ste, t? What is the walker s exected time until "absorbtion"? What is the likelihood that our walker exits at one articular oints as oosed to the other? How could we use comuter simulations to answer the revious question? How do the revious results vary when we vary the shae of the boundary? These are all natural questions that arise when examining the question of the walker in a bounded area. In Analysis of Random Walks on Z, Hochstadt, Padilla, and Zwiebach examine all of these questions. Given our desire to examine methods of modeling natural rocesses using discrete math, we will resent the roof for one of the main results of the aer. Secifically we will look at the behavior of a walker intialized in a 5x5 square boundary, and exlore the question of the walker s robability of absortion at any given time ste and their exected time until absortion. We cite the following theorems: Theorem. Given a 5x5 array and an initial location (0, 0), therobability that our walker will be absorbed by the boundary at any time ste n is given by: P [Absorbtion] = k Where k is given by a function F (n) that mas the set of even numbers and the set of odd numbers to the set of natural numbers: k = F (n) = ( n if n is even n if n is odd Theorem. The exected time until absorbtion for a walker starting at the center of a 5x5 lattice is 9 time stes. The reader may now be asking themselves: why did we choose to resent aroofonsuchaarticularshaeasa5x5square boundary? As we shall see in the roof, the authors not only rovide us with the two theorems listed above, they also rovide us with a general yet owerful framework for how to answer this question for any shae or dimension of boundary. For that reason we may look at their method for this articular instance and extraolate this method to different instances with different dimensions... Percolation. The second natural rocess that we will examine in this summary aer is Percolation. In nature ercolation is the rocess by which aliquidmovesandisfilteredthroughaorousmaterial. Intheiraer, Hochstadt, Padilla, and Zwiebach, bring the examle of rain falling onto a atch of soil. As the rainwater lands on the surface, it sees through the naturally formed aths in the soil until it is stoed. This rocess is called ercolation and it is the way that the roots of lants are watered!

3 RANDOM WALKS AND PERCOLATION 3 So, how can we model ercolation using discrete mathematics? We do this by using grahs, secifically trees. We examine the aths accessible from a root vertex. We say that a node is accessible if there is a ath comrised of "oen edges" leading to it. At this oint we should define our terms more recisely. We imagine that we have a root vertex, v, of a tree. We also imagine that this tree has degree n, which means that there are n edges eminating from it leading to n nodes. Futhermore, each one of those n nodes has n edges emanating from it leading to n distinct nodes (in a tree there are no cycles.) If we assume this tree is infinite then this rocess goes on forever. For the uroses of ercolation we assume that we have this infinite tree, and we start at an arbitrarily chosen root vertex. We "oen" each adjacent edge with robability and "close" it with robability. Ifwecloseanedge, the we sto the rocess along that ath and consider all of its descendents unreachable. If we oen an edge then we reeat the rocess for all of its descendents. The rocess can either sto when we close all candidate edges or it can go on ad infinitum. We call a tree in which we oen edges with robability, aercolationgrah with edge robability. Wemeasurethe "cluster" sizeofourgrahby counting all the reachable nodes via oen edges. Figure gives an examle of this rocess: Figure. In this grah, blue edges are oen and red edges are closed. The vertex v is a member of a cluster of size In the aer we exlore the behaviors on a secific kind of tree, trees of valence d. Valence trees are those in which every edge is adjacent to exactly d other edges. Figure gives an examle of a tree of valence 3:

4 4 AARON ZWIEBACH Figure. The tree of of valence 3 We resent the main result from: Percolation. Namely, weshowhowto derive a closed form function for the size of a cluster formed in a ercolation tree given a valence d and an oen edge robability. Theorem 3:In the grah of valence d with oen edge robability, the exected size of a cluster containing an arbitrary vertex v is: + >< if [0, ) d+ d E[ cluster size ] = if [ d >:, ] 0 otherwise.3. Summary of Introduction. In this section we have resented two roblems that resemble natural rocesses. We have shown how they are relatable to discrete mathematics and by extension claimed that as such we can use combinatorics and robability to generate interesting results. In the next section we resent two roofs from recent aers that we feel reresent well this method of analysis and serve well as an examle for those looking to model their own natural rocesses through discrete mathematics.. Walker in a 5x5 Boundary In this section we cite one of the main results from Analysis of Random Walks in Z by Hochstadt, Padilla, and Zwiebach. The result shown is quoted exactly as it aears in their aer. We resent the result here as it aears in their aer because of the clarity with which they resent their concet would be difficult to relicate. In this roof they derive through induction the robability that the walker is absorbed at any time ste t in a 5x5 boundary. Additionally, they rove that the exected time until absortion is 9 times stes. As we stated in the introduction, the roofs are of articular interest because they are based on robabilistic and combinatorial arguments, rather than on simulations and analysis of the data. Proof as resented in Section 4 of the referred aer: We have a random walker moving in a two-dimensional lane. At any given time ste, the walker can move in any of the four cardinal directions (u,

5 RANDOM WALKS AND PERCOLATION 5 down, left, and right) each with robability 4. In order to calculate an exlicit formula for the exected time until the walker is absorbed, we first need to derive a formula for the robability that the walker is absorbed by the boundary at any time t. We lot for a few time stes t the robability that our walker will occuy a given location in the lattice. For our uroses we will consider a 5x5 array (Table.) We initialize our walker in the center of the lane, (0, 0) and consider the square boundary with corners: (, ),...(, ),...(, ),...(, ). Table. Position of the walker at t =0 X At first the walker is ositioned at the center of the array and the first ste it takes can either be u, down, left or right, each with robability 4 (Shown in Table.) Table. Possible ositions of walker at t = Given the initial location of the walker and the size of the array, it is imossible for the boundary to absorb the walker at t =.Attimet =,though, the walker can could be absorbed at four distinct oints on the boundary, arriving at each with robability (Seen in Table 3.) 6 Table 3. Possible ositions of walker at t = At this oint we encounter our first non-zero robability of the walker being absorbed by the boundary. We calculate the robability by summing the individual robabilities of our walker occuying some oint along the

6 6 AARON ZWIEBACH boundary. In this case the robability that the walker is absorbed at time t =is = Table 4. Possible ositions of the walker at t = We exressly lot out the ossible ositions that the walker can occuy at t =3in Table 4. We invite the reader to create their own lots for the next few time stes t =4, 5, 6, 7..., calculatingateachointtherobabilityof absortion. This will hel the reader see the attern that forms, and understand the basis for Theorem. Theorem 3. Given a 5x5 array and an initial location (0, 0), therobability that our walker will be absorbed by the boundary at any time ste n is given by: P [Absorbtion] = k Where k is given by a function F (n) that mas the set of even numbers and the set of odd numbers to the set of natural numbers: ( n if n is even k = F (n) = n if n is odd Proof. This will be a roof by induction. Inductive Hyothesis: Forn the board can have two configurations, one for even number stes and one for odd number stes. The configuration for an even time ste is given by Table 5. Table 5. Possible ositions of walker at even time ste t = n Even 3 k k k 3 k k 3 k k k 3 k The configuration for an odd time ste is given by Table 6. Base Cases: We have two base cases. The first case is the configuration of the board at time t =0(the configuration is given by Table.) The robability that the walker is absorbed by the boundary is 0, while the the robability that the walker remains on the lattice is. The second base case is the configuration of the board at time t =. The configuration of the board at t =is given by Table. The robability

7 RANDOM WALKS AND PERCOLATION 7 Table 6. Possible ositions of walker at odd time ste t = n Odd 4 k 4 k 4 k k 4 k k k 4 k k 4 k 4 k 4 k that the walker is absorbed by the boundary is 0 and the robability that the walker remains on the lattice is. Inductive Ste: We begin by considering an odd time ste t = n +, we note that k = F (n +) = F (n). By our inductive hyothesis board configuration at time n is given by Table 5. The general configuration of the board at time t = n +is given by Table 7.: Table 7. Possible ositions of walker at odd time ste t = n + A B H I C L J G K D F E The robability that the article occuies osition A, is given by P (A). We note that: P (A) =P (H) =P (G) =P (F )=P (E) =P (D) =P (C) =P (B) = 4 k = 4 k Additionally: P (L) =P (I) =P (J) =P (k) = 4 ( k + k + k )= 3 k = k We note that the individual robabilities of each square corresond to those in our inductive hyothesis. By summing all the ositions on the boundary, (A, B, C, D, E, F, G, H), wecancalculatetherobabilityofbeingabsorbed by the border at t = n +: P [Absorbtion] = ( 4 k )= k We now consider odd time ste t = n and even time ste t = n. Wenote that F (n ) = k and F (n) =k +. By our inductive hyothesis the board configuration at t = n is given by Table 6. The general configuration of the board at time t = n is given by Table.: We calculate: P (I) = 4 ( k + k + k + k )=4 4 k = k = (k+) P (E) =P (F )=P (G) =P (H) = 4 ( k + k )= 3 k = (k+) P (C) =P (B) =P (A) =P (D) = 4 ( k )= 4 k = 3 (k+)

8 AARON ZWIEBACH Table. Possible ositions of walker at even time ste t = n A E F D I B H G C We note that the individual robabilities of each square corresond to those in our inductive hyothesis. By summing all the ositions on the boundary, (A, B, C, D), wecancalculatetherobabilityofourwalkerbeingabsorbed by the border: P [Absorbtion] =4 4 k = (k+) Now that we have a well defined function for the robability of absortion at any even-odd time ste air, we can exressly calculate the exected time to absortion. Theorem 4. The exected time until absorbtion for a walker starting at the center of a 5x5 lattice is 9 time stes. Proof. Using our familiar formula for exectation, we know that the exected time to absortion is given by: X E[Time until absorbtion] = n P (Absorbed at time n) n Given that consecutive even-odd airs ma to the same k, wecansimlify: X = [(k)p (absorbed at time k)+(k +)P (absorbed at time k)] k= = X (4k +)P (absorbed at time k) k= = X (4k +) k k= We can break down our above sum into familiar comonents that we know how to calculate: = X [ k +4k k ] k= The first term, P k= k,isgivenby: X X k = ( )k = k= k= =

9 RANDOM WALKS AND PERCOLATION 9 And the second term, 4 P k= k k,isgivenby: X 4 k k = =4 = ) k= ( Multilying our two revious sums by,yieldsourdesiredvalueforexected time: ( + ) = 9 3. Exected Size of Tree of Valence d In this section we resent the main result from the aer by Hochstadt, Padilla, and Zwiebach titled: Percolation. This result rovided in Section 5 of the aforementioned aer is an exciting result because using robability and combinatorics in conjunction with generating functions we are able to derive a closed form formula for the exected size of a tree with valence d and oen edge robability. This is another great examle of how tools from the reertoire of discrete mathematics can be used to model and gain insights from natural rocesses. Note: For the uroses of this aer we have made minor edits to the original aer. The edits consist of eliminating all references to other sections in the orginal aer. This has been done for the ease of the reader. Proof as resented in the reffered to aer: 3.. Definitions. This section serves as a reference to rigorously define the symbols and terminology used throughout this aer. Definition 3.. V d, is a ercolation tree of valence d with oen edge robability. Definition 3.. C d, is a cluster within the tree V d,. C d, is the size of the cluster C d,. Definition 3.3. d, is a d-ary ercolation tree with oen edge robability. d, the size of the cluster within the tree d, which contains its root vertex. 3.. Trees of Valence d. We note, that a tree of valence d has a useful relation to (d )-ary trees. A tree of valence d is comrised of a root vertex v, where v has degree d, andeachedgeattachesv to an infinite (d )-ary tree. Again, we denote the size of a cluster in a V d, tree as C d,.similarly, the size of a cluster in a d-ary tree is d,. Assuch,theexectedsizeofa cluster in a V d, tree, E[ C d, ], isgivenby (3.) E[ C d, ]=+d E[ d, ].

10 0 AARON ZWIEBACH 3.3. Number of Clusters of Size n in a d-ary Tree. We define a recursive function t d (n) that oututs the number of ways to generate a cluster of size n in a d-ary tree. Intuitively, the number of ways to generate a cluster of size n in a d-ary tree is the number of ways of generating clusters in each one of the d subtrees such that the sum of the sizes of the clusters in the sub-trees equals n. More recisely, we can write this as X (3.) t d (n) = t d (a )... t d (a d ). 0alea,...,a d s.t. a +...+a d =n We utilize Equation 3. to define a generating function whose coefficient are the number of ways of generating a cluster of size n X F (x) = t d (n) x n. n=0 By inserting our exression for t d (n) into F (x) we get that X X F (x) d = t d (a )x a t d (a )x a t d (a n )x an = = a =0 X ( n=0 a d =0 X 0alea,...,a d s.t. a +...+a d =n X t d (n +) x n. n=0 t d (a )... t d (a d )) x a + +a n In order for the argument inside t d and the exonent of x to agree we must shift our function over by one: X X xf (x) d = t d (n +) x n+ = t d (n) x n = F (x) which imlies: n=0 n= (3.3) xf (x) d F (x)+=0. When d =, we were able to exlicitly solve for F (x) by alying the quadratic formula. Solving for F (x) in Equation 3.3 is more difficult. In the next section we use a relation between F (x) and G(y) to solve for the exected size of a cluster in a d-ary tree Exected Cluster Size of a d-ary Tree. In order to derive a function for the exected size of of the d-ary tree we do not need to exlicitly solve for F (x). Rather we can use roerties of a d-ary tree to derive a generating function for the robability of yielding a cluster of size n, thatis deendent on F (x). Agivenclusterofsizen is comrised of n oen edges (the edges that connect the n vertices) and n (d ) + closed edges. We can see this by considering what haens when we increase our cluster size by one vertex. When we add another vertex to our cluster we convert one closed-edge to an oen-edge. At the same time, by only adding one vertex, we are adding

11 RANDOM WALKS AND PERCOLATION d closed-edges. This is because each vertex has d otential children, who in this case are imossible to reach because their edges are closed. As such, each time we add a vertex we also add d closed edges. So a cluster of size n "sees" n (d ) + closed edges. (Where the "+" termaccounts for the n =case.) Utilizing this we can define a generating function G(y) where the coefficient of the y n term is the robability of having a cluster of size n in a d-ary tree: G(y) = X n ( ) n (d )+ t d (n) y n n= = (F ( ( )d y) ). By rearranging the terms of our equality we can avoid having to exlicitly derive F (x). Wedosobyrearrangingthetermssothat (3.4) F (x) = G( x ( ) d )+. At this oint we have a relational equation for F (x) and G(y), givenby Equation 3.4. We can insert our new exression for F (x) in terms of G(y) into Equation 3.3 and simlify by letting y = x : ( ) d ( ) d y ( G(y)+)d G(y) =0. Recall that if we take the derivative of a generating function for the robability of generating a cluster of size n and evaluate the derivative at the oint y =, we get the total exected size of our cluster. Thus we are again looking for G 0 (), which is obtained by taking the derivative of G(y) with resect to y and evaluate at the oint y =. Note that since G(y) is the generating function for the robability density function for cluster size, G() = by the Law of Total Probability. We begin by taking the derivative with resect to y: G0 (y)+( ) d (( G(y)+)d +y(d( G(y)+)d G0 (y))) = 0 We evaluate at y =: G0 () + ( ) d (( +)d +(d( +)d G0 ())) = 0 We simlify: G0 () + ( ) d ( +)d + ( ) d d( +)d G 0 (y) =0

12 AARON ZWIEBACH We can simlify further: ( +)= : G 0 ()(d ( ) d ( )d )=G0 ()( d G 0 () = d ) We assert that this is only true for values of such that G() =, asthe Law of Total Probability must still hold. This modifies our function G 0 () slightly to become: >< if [0, ) (5.5) G 0 d d () = E[ d, ] = if [ >:, ] d 0 otherwise 3.5. Conclusion. In the last section we derived an exression for the exected cluster size in a d-ary tree (Equation 3.5). At this oint we can tie our result back to Equation 3. and state that >< + d if [0, ) (d ) d E[ C d, ]= if [ d >:, ] 0 otherwise Slight simlification allows us to conclude that Theorem 3 In the grah V d, the exected size of the cluster C d, is: + >< if [0, ) d+ d E[ C d, ]= if [ d >:, ] 0 otherwise 4. Conclusion In this aer we have examined two different natural rocesses. The first comrised of a random walker interacting with a series of boundaries, and the second was the rocess of ercolation. There are a number of viable ways by which one could model a natural rocess mathematically. Given the robabilistic nature of these rocesses one natural inclination might have been to design a comutational simulation that abided by the arameters of the rocess and run it enough times to gather statistically significant data. The aforementioned method is articularly useful for more comlicated structures and boundaries (in the case of the random walker) and for three dimensional orous materials (for the case of ercolation.) While emerical analyses rovide very imortant intuition for more comlex scenarios, they lack the same mathematical definiteiveness that is rovided by a combinatorial or robabilistic roof. We chose these aer recisely because their main results are motivated by latter method of modeling and analysis. In the roblem of the random walker, our authors use attern tracking and induction to derive a function

13 RANDOM WALKS AND PERCOLATION 3 for the robability that the walker is absorbed at a given time ste. They use this result to further rove that an exected time until absortion for the same boundary. In the ercolation aer our authors use the recursive characteristics of trees and generating functions to count clusters of a given size and leverage those tools to derive a closed form function for the exected size of a valence tree. We invite the reader to exlore this toic further. The two aers: An Analysis of Random Walks in Z and Percolation are attached for the reader to ursue the toic in further detail. The reader will find not only the same method of analysis alied to different shaes of boundaries and instances of valence trees, but also further exloration into the method of emirical analysis, a toic not exlored in deth in this aer. Hay Learning! Massachusetts Institute of Technology, Deartment of Mathematics, Cambridge, Massachusetts, United States address: aaronz@mit.edu

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave

More information

arxiv:cond-mat/ v2 25 Sep 2002

arxiv:cond-mat/ v2 25 Sep 2002 Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,

More information

Averaging sums of powers of integers and Faulhaber polynomials

Averaging sums of powers of integers and Faulhaber polynomials Annales Mathematicae et Informaticae 42 (20. 0 htt://ami.ektf.hu Averaging sums of owers of integers and Faulhaber olynomials José Luis Cereceda a a Distrito Telefónica Madrid Sain jl.cereceda@movistar.es

More information

On the Toppling of a Sand Pile

On the Toppling of a Sand Pile Discrete Mathematics and Theoretical Comuter Science Proceedings AA (DM-CCG), 2001, 275 286 On the Toling of a Sand Pile Jean-Christohe Novelli 1 and Dominique Rossin 2 1 CNRS, LIFL, Bâtiment M3, Université

More information

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of

More information

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar 15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider

More information

Analysis of some entrance probabilities for killed birth-death processes

Analysis of some entrance probabilities for killed birth-death processes Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

A Social Welfare Optimal Sequential Allocation Procedure

A Social Welfare Optimal Sequential Allocation Procedure A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential

More information

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS #A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,

More information

Topic 7: Using identity types

Topic 7: Using identity types Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

Representing Integers as the Sum of Two Squares in the Ring Z n

Representing Integers as the Sum of Two Squares in the Ring Z n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment

More information

On Doob s Maximal Inequality for Brownian Motion

On Doob s Maximal Inequality for Brownian Motion Stochastic Process. Al. Vol. 69, No., 997, (-5) Research Reort No. 337, 995, Det. Theoret. Statist. Aarhus On Doob s Maximal Inequality for Brownian Motion S. E. GRAVERSEN and G. PESKIR If B = (B t ) t

More information

1 Gambler s Ruin Problem

1 Gambler s Ruin Problem Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins

More information

GRACEFUL NUMBERS. KIRAN R. BHUTANI and ALEXANDER B. LEVIN. Received 14 May 2001

GRACEFUL NUMBERS. KIRAN R. BHUTANI and ALEXANDER B. LEVIN. Received 14 May 2001 IJMMS 29:8 2002 495 499 PII S06720200765 htt://immshindawicom Hindawi Publishing Cor GRACEFUL NUMBERS KIRAN R BHUTANI and ALEXANDER B LEVIN Received 4 May 200 We construct a labeled grah Dn that reflects

More information

arxiv: v1 [physics.data-an] 26 Oct 2012

arxiv: v1 [physics.data-an] 26 Oct 2012 Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch

More information

Lilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3

Lilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3 Pesquisa Oeracional (2013) 33(1): 123-132 2013 Brazilian Oerations Research Society Printed version ISSN 0101-7438 / Online version ISSN 1678-5142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF

More information

Chapter 7 Rational and Irrational Numbers

Chapter 7 Rational and Irrational Numbers Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers

More information

Approximating min-max k-clustering

Approximating min-max k-clustering Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost

More information

On the Chvatál-Complexity of Knapsack Problems

On the Chvatál-Complexity of Knapsack Problems R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew

More information

Model checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]

Model checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle] Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear

More information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. Score normalization technical details We now discuss the technical details of the score normalization method. SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules

More information

1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th

1 1 c (a) 1 (b) 1 Figure 1: (a) First ath followed by salesman in the stris method. (b) Alternative ath. 4. D = distance travelled closing the loo. Th 18.415/6.854 Advanced Algorithms ovember 7, 1996 Euclidean TSP (art I) Lecturer: Michel X. Goemans MIT These notes are based on scribe notes by Marios Paaefthymiou and Mike Klugerman. 1 Euclidean TSP Consider

More information

arxiv:cond-mat/ v1 [cond-mat.stat-mech] 5 Jul 1998

arxiv:cond-mat/ v1 [cond-mat.stat-mech] 5 Jul 1998 arxiv:cond-mat/98773v1 [cond-mat.stat-mech] 5 Jul 1998 Floy modes and the free energy: Rigidity and connectivity ercolation on Bethe Lattices P.M. Duxbury, D.J. Jacobs, M.F. Thore Deartment of Physics

More information

COMMUNICATION BETWEEN SHAREHOLDERS 1

COMMUNICATION BETWEEN SHAREHOLDERS 1 COMMUNICATION BTWN SHARHOLDRS 1 A B. O A : A D Lemma B.1. U to µ Z r 2 σ2 Z + σ2 X 2r ω 2 an additive constant that does not deend on a or θ, the agents ayoffs can be written as: 2r rθa ω2 + θ µ Y rcov

More information

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in

More information

Brownian Motion and Random Prime Factorization

Brownian Motion and Random Prime Factorization Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

A M,ETHOD OF MEASURING THE RESISTIVITY AND HALL' COEFFICIENT ON LAMELLAE OF ARBITRARY SHAPE

A M,ETHOD OF MEASURING THE RESISTIVITY AND HALL' COEFFICIENT ON LAMELLAE OF ARBITRARY SHAPE '. ' 220 HILlS TECHNICAL REVIEW VOLUME 20 A M,ETHOD OF MEASURING THE RESISTIVITY AND HALL' COEFFICIENT ON LAMELLAE OF ARBITRARY SHAE 621.317.331:538.632.083 Resistivity and Hall-coefficient measurements

More information

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various

More information

A New Perspective on Learning Linear Separators with Large L q L p Margins

A New Perspective on Learning Linear Separators with Large L q L p Margins A New Persective on Learning Linear Searators with Large L q L Margins Maria-Florina Balcan Georgia Institute of Technology Christoher Berlind Georgia Institute of Technology Abstract We give theoretical

More information

On generalizing happy numbers to fractional base number systems

On generalizing happy numbers to fractional base number systems On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is

More information

Multiplicative group law on the folium of Descartes

Multiplicative group law on the folium of Descartes Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of

More information

Complex Analysis Homework 1

Complex Analysis Homework 1 Comlex Analysis Homework 1 Steve Clanton Sarah Crimi January 27, 2009 Problem Claim. If two integers can be exressed as the sum of two squares, then so can their roduct. Proof. Call the two squares that

More information

Notes on Instrumental Variables Methods

Notes on Instrumental Variables Methods Notes on Instrumental Variables Methods Michele Pellizzari IGIER-Bocconi, IZA and frdb 1 The Instrumental Variable Estimator Instrumental variable estimation is the classical solution to the roblem of

More information

RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO

RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO RESOLUTIONS OF THREE-ROWED SKEW- AND ALMOST SKEW-SHAPES IN CHARACTERISTIC ZERO MARIA ARTALE AND DAVID A. BUCHSBAUM Abstract. We find an exlicit descrition of the terms and boundary mas for the three-rowed

More information

arxiv: v2 [math.ac] 5 Jan 2018

arxiv: v2 [math.ac] 5 Jan 2018 Random Monomial Ideals Jesús A. De Loera, Sonja Petrović, Lily Silverstein, Desina Stasi, Dane Wilburne arxiv:70.070v [math.ac] Jan 8 Abstract: Insired by the study of random grahs and simlicial comlexes,

More information

An Analysis of Reliable Classifiers through ROC Isometrics

An Analysis of Reliable Classifiers through ROC Isometrics An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit

More information

DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES. To Alexandre Alexandrovich Kirillov on his 3 4 th anniversary

DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES. To Alexandre Alexandrovich Kirillov on his 3 4 th anniversary DUAL NUMBERS, WEIGHTED QUIVERS, AND EXTENDED SOMOS AND GALE-ROBINSON SEQUENCES VALENTIN OVSIENKO AND SERGE TABACHNIKOV Abstract. We investigate a general method that allows one to construct new integer

More information

Convex Optimization methods for Computing Channel Capacity

Convex Optimization methods for Computing Channel Capacity Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

MAS 4203 Number Theory. M. Yotov

MAS 4203 Number Theory. M. Yotov MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment

More information

Feedback-error control

Feedback-error control Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller

More information

Sets of Real Numbers

Sets of Real Numbers Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact

More information

0.6 Factoring 73. As always, the reader is encouraged to multiply out (3

0.6 Factoring 73. As always, the reader is encouraged to multiply out (3 0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial

More information

March 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011

March 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011 International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,

More information

Session 5: Review of Classical Astrodynamics

Session 5: Review of Classical Astrodynamics Session 5: Review of Classical Astrodynamics In revious lectures we described in detail the rocess to find the otimal secific imulse for a articular situation. Among the mission requirements that serve

More information

Solution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0

Solution sheet ξi ξ < ξ i+1 0 otherwise ξ ξ i N i,p 1 (ξ) + where 0 0 Advanced Finite Elements MA5337 - WS7/8 Solution sheet This exercise sheets deals with B-slines and NURBS, which are the basis of isogeometric analysis as they will later relace the olynomial ansatz-functions

More information

Characteristics of Fibonacci-type Sequences

Characteristics of Fibonacci-type Sequences Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and

More information

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2) Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths

More information

Supplementary Materials for Robust Estimation of the False Discovery Rate

Supplementary Materials for Robust Estimation of the False Discovery Rate Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides

More information

c 2007 Society for Industrial and Applied Mathematics

c 2007 Society for Industrial and Applied Mathematics SIAM J. COMPUT. Vol. 37, No. 1,. 83 111 c 2007 Society for Industrial and Alied Mathematics A PROBABILISTIC STUDY ON COMBINATORIAL EXPANDERS AND HASHING PHILLIP G. BRADFORD AND MICHAEL N. KATEHAKIS Abstract.

More information

Strong Matching of Points with Geometric Shapes

Strong Matching of Points with Geometric Shapes Strong Matching of Points with Geometric Shaes Ahmad Biniaz Anil Maheshwari Michiel Smid School of Comuter Science, Carleton University, Ottawa, Canada December 9, 05 In memory of Ferran Hurtado. Abstract

More information

Network Configuration Control Via Connectivity Graph Processes

Network Configuration Control Via Connectivity Graph Processes Network Configuration Control Via Connectivity Grah Processes Abubakr Muhammad Deartment of Electrical and Systems Engineering University of Pennsylvania Philadelhia, PA 90 abubakr@seas.uenn.edu Magnus

More information

State Estimation with ARMarkov Models

State Estimation with ARMarkov Models Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,

More information

Deriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.

Deriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &

More information

6 Stationary Distributions

6 Stationary Distributions 6 Stationary Distributions 6. Definition and Examles Definition 6.. Let {X n } be a Markov chain on S with transition robability matrix P. A distribution π on S is called stationary (or invariant) if π

More information

7.2 Inference for comparing means of two populations where the samples are independent

7.2 Inference for comparing means of two populations where the samples are independent Objectives 7.2 Inference for comaring means of two oulations where the samles are indeendent Two-samle t significance test (we give three examles) Two-samle t confidence interval htt://onlinestatbook.com/2/tests_of_means/difference_means.ht

More information

Maximum Entropy and the Stress Distribution in Soft Disk Packings Above Jamming

Maximum Entropy and the Stress Distribution in Soft Disk Packings Above Jamming Maximum Entroy and the Stress Distribution in Soft Disk Packings Above Jamming Yegang Wu and S. Teitel Deartment of Physics and Astronomy, University of ochester, ochester, New York 467, USA (Dated: August

More information

Meshless Methods for Scientific Computing Final Project

Meshless Methods for Scientific Computing Final Project Meshless Methods for Scientific Comuting Final Project D0051008 洪啟耀 Introduction Floating island becomes an imortant study in recent years, because the lands we can use are limit, so eole start thinking

More information

On the Rank of the Elliptic Curve y 2 = x(x p)(x 2)

On the Rank of the Elliptic Curve y 2 = x(x p)(x 2) On the Rank of the Ellitic Curve y = x(x )(x ) Jeffrey Hatley Aril 9, 009 Abstract An ellitic curve E defined over Q is an algebraic variety which forms a finitely generated abelian grou, and the structure

More information

1-way quantum finite automata: strengths, weaknesses and generalizations

1-way quantum finite automata: strengths, weaknesses and generalizations 1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum

More information

Distributed Rule-Based Inference in the Presence of Redundant Information

Distributed Rule-Based Inference in the Presence of Redundant Information istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced

More information

Maximum Cardinality Matchings on Trees by Randomized Local Search

Maximum Cardinality Matchings on Trees by Randomized Local Search Maximum Cardinality Matchings on Trees by Randomized Local Search ABSTRACT Oliver Giel Fachbereich Informatik, Lehrstuhl 2 Universität Dortmund 44221 Dortmund, Germany oliver.giel@cs.uni-dortmund.de To

More information

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca

More information

8 STOCHASTIC PROCESSES

8 STOCHASTIC PROCESSES 8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular

More information

Real Analysis 1 Fall Homework 3. a n.

Real Analysis 1 Fall Homework 3. a n. eal Analysis Fall 06 Homework 3. Let and consider the measure sace N, P, µ, where µ is counting measure. That is, if N, then µ equals the number of elements in if is finite; µ = otherwise. One usually

More information

Morten Frydenberg Section for Biostatistics Version :Friday, 05 September 2014

Morten Frydenberg Section for Biostatistics Version :Friday, 05 September 2014 Morten Frydenberg Section for Biostatistics Version :Friday, 05 Setember 204 All models are aroximations! The best model does not exist! Comlicated models needs a lot of data. lower your ambitions or get

More information

HARMONIC EXTENSION ON NETWORKS

HARMONIC EXTENSION ON NETWORKS HARMONIC EXTENSION ON NETWORKS MING X. LI Abstract. We study the imlication of geometric roerties of the grah of a network in the extendibility of all γ-harmonic germs at an interior node. We rove that

More information

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,

More information

Pretest (Optional) Use as an additional pacing tool to guide instruction. August 21

Pretest (Optional) Use as an additional pacing tool to guide instruction. August 21 Trimester 1 Pretest (Otional) Use as an additional acing tool to guide instruction. August 21 Beyond the Basic Facts In Trimester 1, Grade 8 focus on multilication. Daily Unit 1: Rational vs. Irrational

More information

On Wald-Type Optimal Stopping for Brownian Motion

On Wald-Type Optimal Stopping for Brownian Motion J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of

More information

Node-voltage method using virtual current sources technique for special cases

Node-voltage method using virtual current sources technique for special cases Node-oltage method using irtual current sources technique for secial cases George E. Chatzarakis and Marina D. Tortoreli Electrical and Electronics Engineering Deartments, School of Pedagogical and Technological

More information

HAUSDORFF MEASURE OF p-cantor SETS

HAUSDORFF MEASURE OF p-cantor SETS Real Analysis Exchange Vol. 302), 2004/2005,. 20 C. Cabrelli, U. Molter, Deartamento de Matemática, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires and CONICET, Pabellón I - Ciudad Universitaria,

More information

Outline. Markov Chains and Markov Models. Outline. Markov Chains. Markov Chains Definitions Huizhen Yu

Outline. Markov Chains and Markov Models. Outline. Markov Chains. Markov Chains Definitions Huizhen Yu and Markov Models Huizhen Yu janey.yu@cs.helsinki.fi Det. Comuter Science, Univ. of Helsinki Some Proerties of Probabilistic Models, Sring, 200 Huizhen Yu (U.H.) and Markov Models Jan. 2 / 32 Huizhen Yu

More information

whether a process will be spontaneous, it is necessary to know the entropy change in both the

whether a process will be spontaneous, it is necessary to know the entropy change in both the 93 Lecture 16 he entroy is a lovely function because it is all we need to know in order to redict whether a rocess will be sontaneous. However, it is often inconvenient to use, because to redict whether

More information

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS

#A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS #A37 INTEGERS 15 (2015) NOTE ON A RESULT OF CHUNG ON WEIL TYPE SUMS Norbert Hegyvári ELTE TTK, Eötvös University, Institute of Mathematics, Budaest, Hungary hegyvari@elte.hu François Hennecart Université

More information

ISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia

ISOSCELES TRIANGLES IN Q 3. Matt Noble Department of Mathematics, Middle Georgia State University, Macon, Georgia #A9 INTEGERS 18 (2018) ISOSCELES TRIANGLES IN Q Matt Noble Deartment of Mathematics, Middle Georgia State University, Macon, Georgia matthew.noble@mga.edu Received: 7/2/17, Acceted: 2//18, Published: 2/19/18

More information

Towards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK

Towards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)

More information

Estimation of the large covariance matrix with two-step monotone missing data

Estimation of the large covariance matrix with two-step monotone missing data Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo

More information

Equivalence of Wilson actions

Equivalence of Wilson actions Prog. Theor. Ex. Phys. 05, 03B0 7 ages DOI: 0.093/te/tv30 Equivalence of Wilson actions Physics Deartment, Kobe University, Kobe 657-850, Jaan E-mail: hsonoda@kobe-u.ac.j Received June 6, 05; Revised August

More information

Improvement on the Decay of Crossing Numbers

Improvement on the Decay of Crossing Numbers Grahs and Combinatorics 2013) 29:365 371 DOI 10.1007/s00373-012-1137-3 ORIGINAL PAPER Imrovement on the Decay of Crossing Numbers Jakub Černý Jan Kynčl Géza Tóth Received: 24 Aril 2007 / Revised: 1 November

More information

An Estimate For Heilbronn s Exponential Sum

An Estimate For Heilbronn s Exponential Sum An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined

More information

Classical gas (molecules) Phonon gas Number fixed Population depends on frequency of mode and temperature: 1. For each particle. For an N-particle gas

Classical gas (molecules) Phonon gas Number fixed Population depends on frequency of mode and temperature: 1. For each particle. For an N-particle gas Lecture 14: Thermal conductivity Review: honons as articles In chater 5, we have been considering quantized waves in solids to be articles and this becomes very imortant when we discuss thermal conductivity.

More information

Universal Finite Memory Coding of Binary Sequences

Universal Finite Memory Coding of Binary Sequences Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv

More information

A Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression

A Comparison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Journal of Modern Alied Statistical Methods Volume Issue Article 7 --03 A Comarison between Biased and Unbiased Estimators in Ordinary Least Squares Regression Ghadban Khalaf King Khalid University, Saudi

More information

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning

Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment

More information

Improved Bounds on Bell Numbers and on Moments of Sums of Random Variables

Improved Bounds on Bell Numbers and on Moments of Sums of Random Variables Imroved Bounds on Bell Numbers and on Moments of Sums of Random Variables Daniel Berend Tamir Tassa Abstract We rovide bounds for moments of sums of sequences of indeendent random variables. Concentrating

More information

POINTS ON CONICS MODULO p

POINTS ON CONICS MODULO p POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics

More information

MODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL

MODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management

More information

where x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H:

where x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H: Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 2 October 25, 2017 Due: November 08, 2017 A. Growth function Growth function of stum functions.

More information

ON MINKOWSKI MEASURABILITY

ON MINKOWSKI MEASURABILITY ON MINKOWSKI MEASURABILITY F. MENDIVIL AND J. C. SAUNDERS DEPARTMENT OF MATHEMATICS AND STATISTICS ACADIA UNIVERSITY WOLFVILLE, NS CANADA B4P 2R6 Abstract. Two athological roerties of Minkowski content

More information

Participation Factors. However, it does not give the influence of each state on the mode.

Participation Factors. However, it does not give the influence of each state on the mode. Particiation Factors he mode shae, as indicated by the right eigenvector, gives the relative hase of each state in a articular mode. However, it does not give the influence of each state on the mode. We

More information

Chapter 1 Fundamentals

Chapter 1 Fundamentals Chater Fundamentals. Overview of Thermodynamics Industrial Revolution brought in large scale automation of many tedious tasks which were earlier being erformed through manual or animal labour. Inventors

More information

Plotting the Wilson distribution

Plotting the Wilson distribution , Survey of English Usage, University College London Setember 018 1 1. Introduction We have discussed the Wilson score interval at length elsewhere (Wallis 013a, b). Given an observed Binomial roortion

More information

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.

Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points. Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the

More information

Section 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative

Section 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.

More information