A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz

Size: px
Start display at page:

Download "A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz"

Transcription

1 A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae for single-commoity network flow problems with ranom inputs. The transportation linear programming problem (TLP) where N points lie in a region of R is one example. It is foun that the average istance travele by an item in the TLP increases with N / ; i.e., the unit cost is unboune when N an the length of the region are increase in a fixe ratio. Further, the optimum istance oes not converge in probability to the average value. These one-imensional results are a useful stepping stone towar a network theory for two an higher imensions. Key Wors: Transportation problem; istance approximations. Introuction Asymptotic formulae exist for the traveling salesman problem, TSP, (Eilon et al., 97, Karp, 977, Daganzo, 984a), an the vehicle routing problem, VRP, (Eilon et al., 97, Daganzo, 984b, Haimovich et al., 985, Newell an Daganzo, 986 an 986a). The results apply to problems where N points are ranomly an uniformly istribute on a region of a metric plane with area A, an ensity δ = N A. In all cases the istance travele per point for the TSP, or the etour istance per point for the VRP, tens to a fixe multiple of δ as N an A are increase in a fixe ratio. This limiting result hols for problems in K-imensional regions. This note presents relate but qualitatively ifferent results for single-commoity network flow problems with ranom inputs on unirecte paths. The transportation linear programming problem, TLP, with points in a region of R is an example of this class of problems. One imensional TLP s arise in connection with the earthwork minimization problem of highway esign.. Backgroun Institute of Transportation Stuies an Department of Civil an Environmental Engineering University of California, Berkeley CA 947; aganzo@ce.berkeley.eu. Department of Inustrial Engineering an Management Sciences, Northwestern University.

2 Here the TLP is efine as follows. Given are N points, inter-point istances, { ij, i,j=..n; i j}, satisfying the triangle inequality, an net supplies, v i, at each point. Positive v i are interprete as supplies an negative v i as emans. The goal is to fin shipments, {v ij, i,j=..n; i j}, that minimize the total istance travele while satisfying flow balance constraints. (TLP) min z = ij v ij (a) i, j N s. t.: ( vij v ji ) vi i N (b) j N v i, j N. (c) ij Equations (b) specify flow-conservation at each point, ensuring that the net flow from a point i never excees the net supply at i. Because istances satisfy the triangle inequality, in an optimum solution origin noes only emit flow an estination noes only receive flow. A TLP is feasible only if v, as can be seen by summing (b) across i. For balance problems constraints (b) are iniviually satisfie as pure equalities; for unbalance problems, they are not. We efine an always-feasible problem, ATLP, that inclues a fictitious source, i =, with the least positive net supply to make the problem feasible, an istances, i, j = M >> sup( ij ). This net supply is v = v i, if the problem is infeasible, an v =, otherwise. The fictitious istances impose a penalty for items not shippe. Since M is large, the istances satisfy the triangle inequality, an the ATLP is a TLP. If the original TLP is infeasible then the ATLP is a balance TLP, an the outflow from the fictitious source is v. The penalty component of an optimum solution is v M, an the istance component is = z vm, with = N v v i. If the TLP i= is feasible, then = z; otherwise we take the istance component of the ATLP as its solution. In the TLP/ATLP it is assume that excess supplies are left at the origins. We consier a variant, calle epot-tlp, or DTLP, where excess supplies are carrie to the extra point, or epot. In the DTLP the epot istances o not have to be fixe or large but must be non-negative,, ), i, j, an satisfy the triangle inequality. The minimum of the DTLP objective function, z D N i= i N + ( j i i, is enote D. Due to the penalty epot istances, it shoul be clear that the following is true (a formal proof can be foun in Daganzo an Smilowitz, ). Proposition : (DTLP as an upper boun to TLP). For any TLP an any associate DTLP, Furthermore, if the TLP is balance then = D. D.

3 3 3. Formulae This section evelops formulae for the averages of an D over a set of solutions when conitions vary. Points are embee in the norme linear space R an ientifie by a single coorinate, x i. Distance is ij = x x. We examine balance an unbalance versions of the TLP an DTLP. We i j also consier gri problems where the net supplies change as ranom variables, but points are fixe on a - D gri, an ranom problems where points are locate ranomly. The moifiers G or R for gri or ranom, an U or B for unbalance or balance, ientify problem characteristics. 3. Balance TLP problems Cumulative supply v x p ) Cumulative supply l A B C D x p x epot v ( x Fig. a presents cumulative supply vs. position, v ( = v for a TLP(B) with ranom point locations. xi x Figure. Graphical solutions of -D problems (a) TLP(B); (b) DTLP(U) i Result. (Formula for TLP(B)). The minimum cost for TLP(B) is the absolute area between an the x-axis; i.e., + N = v x = xi ) xi+ i= ( x. () i Proof: It suffices to show that () is both an upper boun an a lower boun for. For any point, x p, such as the one in Fig. a, the net flow across x p in any feasible solution is x p ) because the aggregate supply an eman on both sies of x p must be satisfie. Thus, x p ) x is a lower boun to the optimal istance travele in any small interval, (x p, x p + where is constant. Therefore, the sum on the right

4 4 sie of () is a lower boun for. Conversely, a feasible solution can be constructe by consiering horizontal slices of v items an transporting the items from points where the slice intersects a rising portion of curve to ajoining points where it intersects a falling portion. In the figure, v items woul be carrie from A to B an from C to D. Thus, the summation of the slices for small v (still given by ()) is the istance of a feasible solution an an upper boun to. 3.. Gri problems If points are on a gri with lattice spacing l, then () reuces to = l N i= x i ). We examine the expecte value of for TLP(B,G) with ranom net supplies. For any homogeneous, balance problem the net supplies must have zero mean, v =, the same absolute mean v = µ, an the same variance, i v = σ. The (equal) covariances must be v i v i = σ /( N ) since this covariance ensures that the i variance of the sum of all the net supplies is zero. The general formulae for the mean, absolute mean, an variance of the sum of the first i net supplies, x i ), are then: i v ( xi ) =, xi ) = iµ, an xi ) = iσ (3) N Assume now that the v i have a joint multinormal istribution, an recall that if X is a normal ranom variable with zero-mean, X = [ ( X ) / π ] v ( i = ( ) x ) π i σ i N i. Thus, in the multinormal case, we have:. (4) Result. (Expecte optimal cost of TLP(B,G)). For the homogeneous, zero-mean TLP(B,G) with normal eman in R, ( ) N i BG = σl i =. (5a) π i N Furthermore, the limit of this expression for N is 3 π BG σln. (5b) 3

5 5 Equation (5b) is true because the right han sie of (5a) is a Riemann sum that becomes a efinite integral for N, an such integral reuces to (5b). The etails are as follows: ( x ) N 3 σ l x x ( x ) π x x σln π N = N N N 3 π = σln. (6) 3 In terms of the point ensity, δ = /l, the average istance per point, p = N, is: BG BG / π 3 p BG σδ N. (7) This function increases without limit with the number of points, unlike in the TSP, where the average istance per point tens to a limit. The epenence with arising from the flow balancing requirements. N is cause by the long-range interactions 3.. Extensions: ranom problems an non-normal emans Equations (5b) an (7) are general an hol if the v i are not normal, but satisfy the regularity conitions of Cramér s version of the central limit theorem for large eviations. Let F be the c..f. of for a given N an let N with a fixe interval length, L. Then, is the sum of xn/l net supplies, an the central limit theorem applies. Recall L = x. Let Φ be the c..f. of the normal approximation to. Note that = F ( ) ( z) z + [ F ( z)] z Φ( z) z + [ Φ( z)] z. The central limit theorem v x for large eviations (see corollary on p.553 of Feller, 97) guarantees that the error in v ( can be mae smaller than any ε > for all v (. Thus, the error in is boune by ε L. QED Equations (5b) an (7) also hol if point locations vary in a segment of length L as a homogeneous Poisson process with rate δ an an average of N points (N = δ L). Since is a compoun Poisson ranom v ( ( ) / π variable, the central limit theorem applies an [ ]. It suffices to show x x σ N because then the expectation of (), = x, is (6). Let i( be L L the number of points in [, x], an note the conitional ranom variable ( ( i( ) ( ) + v has zero mean an variance ( ) = i( i( i( σ. For zero mean, the unconitional variance is the expectation of N

6 6 the conitional variance; i.e. i( N i( N x Nx x x = σ = σ + N N N L( N ) N L L L x x σ N. QED L L 3. Unbalance TLP problems (gri an ranom point locations) An exact expression for TLP(U) is more ifficult to obtain, yet it is shown in Daganzo an Smilowitz () that p = O(N / ), implying that p is also O(N / ) for unbalance problems. BG p UG Equation (7) hols for DTLP(B) since DTLP(B) TLP(B). The expression for DTLP(U) is ifferent, but qualitatively similar. To erive it, first efine the cumulative eman for the epot v '( as shown in Fig. b; i.e., v ( = v H ( x ), where H is the Heavisie unit step function an x is the epot location. ' x Since the DTLP(U) is a balance TLP with cumulative eman, Result applies with substitute for, an we have: UG Result 3. (Deterministic DTLP). For both gri an ranom problems, D + = x. (8) For the DTLP(U), the expectation of the integran of (8) is symmetric with respect to the location of the epot. Thus, for an integration region [, L] it can be simplifie as follows: L L / = x = x = x, which from (4) is L / L / / [( / ) ( Nx / L) ] / x L = x π σ = 4 9π σ LN /, i.e., we have Result 4. (Expecte optimal cost of DTLP(U)) σ ln, an p σ ln. (9) 9π 9π Note that in all cases, = O(N 3/ ) when one hols l constant as N is increase. However, = O(N / ) if one hols the total region size, L = ln, constant.

7 7 3.. Convergence for unbalance TLP cost approximations The form of convergence of is examine next. Unlike the TSP (9) because its coefficient of variation tens to a positive constant as N. oes not converge in probability to Result 5. (Asymptotic coefficient of variation of the optimal istance for DTLP(U)) The asymptotic coefficient of variation tens to a positive constant as N increases; i.e., / constant >. Proof: Recall is a Riemann sum of the istance in small intervals of [, L], with a secon moment, = xy = xy. By symmetry, LL = v xy L / L / LL L/ L ( + v x v y v y y x ( ( ) [ ( ) ' ( )]. For large N, curve has L / inepenent increments. Thus, the integran of the secon integral involves the prouct of inepenent quantities since the absolute net supplies being multiplie correspon to non-overlapping regions of [, L]. The expression can be rewritten using the prouct of the expectations as: L / L / L / L = xy + ( [ v' ( ] y x L / L / L / L / L / ) = xy + ( y xy. The secon inequality follows from symmetry. Note now that the first integran satisfies: v ( = v ( v ( + cov{ v (, }. Thus, L / L / ) = 4 ( y xy + co, ) xy L / L / The covariance integran is strictly positive for all x an y not equal to, because an share the net supplies from to min(x,. An expression for co v (, ) is of the form σ N ρ(x/l, y/l), an ρ is positive if both its arguments are positive. The secon moment is then: = 4 ( y xy L / L / ) + σ N L / L / ρ ( x / L, y / L) xy L / L / ) = 4 ( y xy σ L ( x', y' ) x ' y ' + N / / ρ

8 8 Note the secon ouble integral is a positive constant; the secon term is a positive multiple of σ N L an the first term is. The secon moment becomes = + ρ o σ NL, for some ρ o >, an the variance is = ρ o σ NL = ρ o σ l N 3. Since 4 σ 9π ln 3, the coefficient of variation is inepenent of σ, l an N, an it tens to a positive constant as state. 4. Conclusions an comparison with other TLP problems It is interesting to compare these results with those for other TLP versions (see Smilowitz an Daganzo, ). The result, p = / N = O( N ) when one hols δ constant, oes not exten to planar problems or problems in higher imensions. The epenence on N is ampe in higher imensions. In - D, the epenence is only of orer log(n). In 3-D, p is boune an the stanar eviation of the optimum istance per point eclines with N. This implies that in -D the optimum istance converges in probability to the expecte value. It is also possible to show that the asymptotic -D formulae epen on region shape, even for a constant region size. If one consiers a region consisting of two intervals of equal length, L/, separate by a greater istance, D, with the epot in the mile, then p epens on D asymptotically. To see that this is true, note that in the optimal solution the total istance travele by the epot flow increases linearly with DN /, since this flow is proportional to N /. This quantity cannot be neglecte because it is shown in Section 3 that the internal istances within each sub-zone are O(N / ) when region size is hel constant. Fortunately for practical applications, shape oes not have an asymptotic effect in -D. Thus, the -D TLP is quite similar to the TSP in that the optimum istance per point is shape-inepenent an appears to converge in probability to the asymptotic mean. Although the -D TLP istance per point is unboune when one hols ensity constant (unlike in the case of the TSP), sai istance increases with N so slowly that it may be treate as a constant for problems where N only varies by a factor of. 5. Acknowlegements Research supporte in part by the University of California Transportation Center. 6. References Daganzo, C.F. (984a) The length of tours in zones of ifferent shapes, Trans. Res. B 8B, Daganzo, C.F. (984b) The istance travele to visit N points with a maximum of C stops per vehicle: An analytic moel an an application, Transportation Science 8 (4),

9 9 Daganzo, C.F. an Smilowitz, K, () Asymptotic approximations for the transportation LP an other scalable network problems ITS Working Paper, University of California, Berkeley; revise as: Daganzo, C.F. an Smilowitz, K, () Bouns an approximations for the Transportation LP (uner revision, Transportation Science.) Eilon, S., Watson-Gany, C.D.T. an Christofies, N. (97) Distribution Management: Mathematical Moelling an Practical Analysis, Hafner, NY, NY. Feller, W. (97) An Introuction to Probability Theory an Applications, Vol. Wiley, NY,NY. Haimovich, M. A., A. H. G. Rinnooy-Kan an L. Stougie (985) Bouns an heuristics for capacitate routing problems, Math. Opns. Res., Karp, R.M. (977) "Probabilistic analysis of partitioning algorithms for the traveling salesman problem", Math. Opns. Res., 9-4. Newell, G.F. an Daganzo, C.F. (986) Design of multiple vehicle elivery tours--i: A ring-raial network, Trans. Res. B B(5), Newell, G.F. an Daganzo, C.F. (986a) Design of multiple vehicle elivery tours--ii: Other metrics, Trans. Res. B B(5),

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

arxiv: v4 [math.pr] 27 Jul 2016

arxiv: v4 [math.pr] 27 Jul 2016 The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

PDE Notes, Lecture #11

PDE Notes, Lecture #11 PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =

More information

3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes

3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we

More information

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments 2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor

More information

Topic 7: Convergence of Random Variables

Topic 7: Convergence of Random Variables Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Chromatic number for a generalization of Cartesian product graphs

Chromatic number for a generalization of Cartesian product graphs Chromatic number for a generalization of Cartesian prouct graphs Daniel Král Douglas B. West Abstract Let G be a class of graphs. The -fol gri over G, enote G, is the family of graphs obtaine from -imensional

More information

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number

More information

1. Aufgabenblatt zur Vorlesung Probability Theory

1. Aufgabenblatt zur Vorlesung Probability Theory 24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f

More information

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x) Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)

More information

Modeling of Dependence Structures in Risk Management and Solvency

Modeling of Dependence Structures in Risk Management and Solvency Moeling of Depenence Structures in Risk Management an Solvency University of California, Santa Barbara 0. August 007 Doreen Straßburger Structure. Risk Measurement uner Solvency II. Copulas 3. Depenent

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

Construction of the Electronic Radial Wave Functions and Probability Distributions of Hydrogen-like Systems

Construction of the Electronic Radial Wave Functions and Probability Distributions of Hydrogen-like Systems Construction of the Electronic Raial Wave Functions an Probability Distributions of Hyrogen-like Systems Thomas S. Kuntzleman, Department of Chemistry Spring Arbor University, Spring Arbor MI 498 tkuntzle@arbor.eu

More information

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

Lower bounds on Locality Sensitive Hashing

Lower bounds on Locality Sensitive Hashing Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,

More information

The total derivative. Chapter Lagrangian and Eulerian approaches

The total derivative. Chapter Lagrangian and Eulerian approaches Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function

More information

Physics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1

Physics 5153 Classical Mechanics. The Virial Theorem and The Poisson Bracket-1 Physics 5153 Classical Mechanics The Virial Theorem an The Poisson Bracket 1 Introuction In this lecture we will consier two applications of the Hamiltonian. The first, the Virial Theorem, applies to systems

More information

Number of wireless sensors needed to detect a wildfire

Number of wireless sensors needed to detect a wildfire Number of wireless sensors neee to etect a wilfire Pablo I. Fierens Instituto Tecnológico e Buenos Aires (ITBA) Physics an Mathematics Department Av. Maero 399, Buenos Aires, (C1106ACD) Argentina pfierens@itba.eu.ar

More information

Spring 2016 Network Science

Spring 2016 Network Science Spring 206 Network Science Sample Problems for Quiz I Problem [The Application of An one-imensional Poisson Process] Suppose that the number of typographical errors in a new text is Poisson istribute with

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

Iterated Point-Line Configurations Grow Doubly-Exponentially

Iterated Point-Line Configurations Grow Doubly-Exponentially Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection

More information

LECTURE NOTES ON DVORETZKY S THEOREM

LECTURE NOTES ON DVORETZKY S THEOREM LECTURE NOTES ON DVORETZKY S THEOREM STEVEN HEILMAN Abstract. We present the first half of the paper [S]. In particular, the results below, unless otherwise state, shoul be attribute to G. Schechtman.

More information

inflow outflow Part I. Regular tasks for MAE598/494 Task 1

inflow outflow Part I. Regular tasks for MAE598/494 Task 1 MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the

More information

Step 1. Analytic Properties of the Riemann zeta function [2 lectures]

Step 1. Analytic Properties of the Riemann zeta function [2 lectures] Step. Analytic Properties of the Riemann zeta function [2 lectures] The Riemann zeta function is the infinite sum of terms /, n. For each n, the / is a continuous function of s, i.e. lim s s 0 n = s n,

More information

Prep 1. Oregon State University PH 213 Spring Term Suggested finish date: Monday, April 9

Prep 1. Oregon State University PH 213 Spring Term Suggested finish date: Monday, April 9 Oregon State University PH 213 Spring Term 2018 Prep 1 Suggeste finish ate: Monay, April 9 The formats (type, length, scope) of these Prep problems have been purposely create to closely parallel those

More information

Section 7.1: Integration by Parts

Section 7.1: Integration by Parts Section 7.1: Integration by Parts 1. Introuction to Integration Techniques Unlike ifferentiation where there are a large number of rules which allow you (in principle) to ifferentiate any function, the

More information

Logarithmic spurious regressions

Logarithmic spurious regressions Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate

More information

WUCHEN LI AND STANLEY OSHER

WUCHEN LI AND STANLEY OSHER CONSTRAINED DYNAMICAL OPTIMAL TRANSPORT AND ITS LAGRANGIAN FORMULATION WUCHEN LI AND STANLEY OSHER Abstract. We propose ynamical optimal transport (OT) problems constraine in a parameterize probability

More information

On the Surprising Behavior of Distance Metrics in High Dimensional Space

On the Surprising Behavior of Distance Metrics in High Dimensional Space On the Surprising Behavior of Distance Metrics in High Dimensional Space Charu C. Aggarwal, Alexaner Hinneburg 2, an Daniel A. Keim 2 IBM T. J. Watson Research Center Yortown Heights, NY 0598, USA. charu@watson.ibm.com

More information

Separation of Variables

Separation of Variables Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical

More information

u!i = a T u = 0. Then S satisfies

u!i = a T u = 0. Then S satisfies Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace

More information

Least Distortion of Fixed-Rate Vector Quantizers. High-Resolution Analysis of. Best Inertial Profile. Zador's Formula Z-1 Z-2

Least Distortion of Fixed-Rate Vector Quantizers. High-Resolution Analysis of. Best Inertial Profile. Zador's Formula Z-1 Z-2 High-Resolution Analysis of Least Distortion of Fixe-Rate Vector Quantizers Begin with Bennett's Integral D 1 M 2/k Fin best inertial profile Zaor's Formula m(x) λ 2/k (x) f X(x) x Fin best point ensity

More information

Introduction to Markov Processes

Introduction to Markov Processes Introuction to Markov Processes Connexions moule m44014 Zzis law Gustav) Meglicki, Jr Office of the VP for Information Technology Iniana University RCS: Section-2.tex,v 1.24 2012/12/21 18:03:08 gustav

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische

More information

Qubit channels that achieve capacity with two states

Qubit channels that achieve capacity with two states Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March

More information

Schrödinger s equation.

Schrödinger s equation. Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of

More information

Center of Gravity and Center of Mass

Center of Gravity and Center of Mass Center of Gravity an Center of Mass 1 Introuction. Center of mass an center of gravity closely parallel each other: they both work the same way. Center of mass is the more important, but center of gravity

More information

6 General properties of an autonomous system of two first order ODE

6 General properties of an autonomous system of two first order ODE 6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x

More information

Monotonicity of facet numbers of random convex hulls

Monotonicity of facet numbers of random convex hulls Monotonicity of facet numbers of ranom convex hulls Gilles Bonnet, Julian Grote, Daniel Temesvari, Christoph Thäle, Nicola Turchi an Florian Wespi arxiv:173.31v1 [math.mg] 7 Mar 17 Abstract Let X 1,...,

More information

Chapter 4. Electrostatics of Macroscopic Media

Chapter 4. Electrostatics of Macroscopic Media Chapter 4. Electrostatics of Macroscopic Meia 4.1 Multipole Expansion Approximate potentials at large istances 3 x' x' (x') x x' x x Fig 4.1 We consier the potential in the far-fiel region (see Fig. 4.1

More information

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine

More information

Quantum Mechanics in Three Dimensions

Quantum Mechanics in Three Dimensions Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.

More information

Monotonicity for excited random walk in high dimensions

Monotonicity for excited random walk in high dimensions Monotonicity for excite ranom walk in high imensions Remco van er Hofsta Mark Holmes March, 2009 Abstract We prove that the rift θ, β) for excite ranom walk in imension is monotone in the excitement parameter

More information

arxiv: v1 [physics.flu-dyn] 8 May 2014

arxiv: v1 [physics.flu-dyn] 8 May 2014 Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa

More information

Lecture 6 : Dimensionality Reduction

Lecture 6 : Dimensionality Reduction CPS290: Algorithmic Founations of Data Science February 3, 207 Lecture 6 : Dimensionality Reuction Lecturer: Kamesh Munagala Scribe: Kamesh Munagala In this lecture, we will consier the roblem of maing

More information

arxiv: v2 [cond-mat.stat-mech] 11 Nov 2016

arxiv: v2 [cond-mat.stat-mech] 11 Nov 2016 Noname manuscript No. (will be inserte by the eitor) Scaling properties of the number of ranom sequential asorption iterations neee to generate saturate ranom packing arxiv:607.06668v2 [con-mat.stat-mech]

More information

CHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold

CHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the

More information

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945

More information

Tractability results for weighted Banach spaces of smooth functions

Tractability results for weighted Banach spaces of smooth functions Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March

More information

θ x = f ( x,t) could be written as

θ x = f ( x,t) could be written as 9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)

More information

Agmon Kolmogorov Inequalities on l 2 (Z d )

Agmon Kolmogorov Inequalities on l 2 (Z d ) Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,

More information

New Statistical Test for Quality Control in High Dimension Data Set

New Statistical Test for Quality Control in High Dimension Data Set International Journal of Applie Engineering Research ISSN 973-456 Volume, Number 6 (7) pp. 64-649 New Statistical Test for Quality Control in High Dimension Data Set Shamshuritawati Sharif, Suzilah Ismail

More information

NOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,

NOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy, NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

A study on ant colony systems with fuzzy pheromone dispersion

A study on ant colony systems with fuzzy pheromone dispersion A stuy on ant colony systems with fuzzy pheromone ispersion Louis Gacogne LIP6 104, Av. Kenney, 75016 Paris, France gacogne@lip6.fr Sanra Sanri IIIA/CSIC Campus UAB, 08193 Bellaterra, Spain sanri@iiia.csic.es

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory

More information

Math 115 Section 018 Course Note

Math 115 Section 018 Course Note Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of

More information

Math 1B, lecture 8: Integration by parts

Math 1B, lecture 8: Integration by parts Math B, lecture 8: Integration by parts Nathan Pflueger 23 September 2 Introuction Integration by parts, similarly to integration by substitution, reverses a well-known technique of ifferentiation an explores

More information

23 Implicit differentiation

23 Implicit differentiation 23 Implicit ifferentiation 23.1 Statement The equation y = x 2 + 3x + 1 expresses a relationship between the quantities x an y. If a value of x is given, then a corresponing value of y is etermine. For

More information

Chapter 6: Energy-Momentum Tensors

Chapter 6: Energy-Momentum Tensors 49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.

More information

A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d

A new proof of the sharpness of the phase transition for Bernoulli percolation on Z d A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition

More information

Summary: Differentiation

Summary: Differentiation Techniques of Differentiation. Inverse Trigonometric functions The basic formulas (available in MF5 are: Summary: Differentiation ( sin ( cos The basic formula can be generalize as follows: Note: ( sin

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

A Sketch of Menshikov s Theorem

A Sketch of Menshikov s Theorem A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p

More information

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,

More information

Math 1271 Solutions for Fall 2005 Final Exam

Math 1271 Solutions for Fall 2005 Final Exam Math 7 Solutions for Fall 5 Final Eam ) Since the equation + y = e y cannot be rearrange algebraically in orer to write y as an eplicit function of, we must instea ifferentiate this relation implicitly

More information

State-Space Model for a Multi-Machine System

State-Space Model for a Multi-Machine System State-Space Moel for a Multi-Machine System These notes parallel section.4 in the text. We are ealing with classically moele machines (IEEE Type.), constant impeance loas, an a network reuce to its internal

More information

Final Exam Study Guide and Practice Problems Solutions

Final Exam Study Guide and Practice Problems Solutions Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making

More information

Calculus and optimization

Calculus and optimization Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner

More information

Acute sets in Euclidean spaces

Acute sets in Euclidean spaces Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of

More information

Lecture 6: Calculus. In Song Kim. September 7, 2011

Lecture 6: Calculus. In Song Kim. September 7, 2011 Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear

More information

Ramsey numbers of some bipartite graphs versus complete graphs

Ramsey numbers of some bipartite graphs versus complete graphs Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer

More information

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control

19 Eigenvalues, Eigenvectors, Ordinary Differential Equations, and Control 19 Eigenvalues, Eigenvectors, Orinary Differential Equations, an Control This section introuces eigenvalues an eigenvectors of a matrix, an iscusses the role of the eigenvalues in etermining the behavior

More information

The Exact Form and General Integrating Factors

The Exact Form and General Integrating Factors 7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily

More information

3.6. Let s write out the sample space for this random experiment:

3.6. Let s write out the sample space for this random experiment: STAT 5 3 Let s write out the sample space for this ranom experiment: S = {(, 2), (, 3), (, 4), (, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)} This sample space assumes the orering of the balls

More information

Balancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling

Balancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January

More information

Lecture 5. Symmetric Shearer s Lemma

Lecture 5. Symmetric Shearer s Lemma Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here

More information

GLOBAL SOLUTIONS FOR 2D COUPLED BURGERS-COMPLEX-GINZBURG-LANDAU EQUATIONS

GLOBAL SOLUTIONS FOR 2D COUPLED BURGERS-COMPLEX-GINZBURG-LANDAU EQUATIONS Electronic Journal of Differential Equations, Vol. 015 015), No. 99, pp. 1 14. ISSN: 107-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu ftp eje.math.txstate.eu GLOBAL SOLUTIONS FOR D COUPLED

More information

FURTHER BOUNDS FOR THE ESTIMATION ERROR VARIANCE OF A CONTINUOUS STREAM WITH STATIONARY VARIOGRAM

FURTHER BOUNDS FOR THE ESTIMATION ERROR VARIANCE OF A CONTINUOUS STREAM WITH STATIONARY VARIOGRAM FURTHER BOUNDS FOR THE ESTIMATION ERROR VARIANCE OF A CONTINUOUS STREAM WITH STATIONARY VARIOGRAM N. S. BARNETT, S. S. DRAGOMIR, AND I. S. GOMM Abstract. In this paper we establish an upper boun for the

More information

Parameter estimation: A new approach to weighting a priori information

Parameter estimation: A new approach to weighting a priori information Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a

More information

Lagrangian and Hamiltonian Mechanics

Lagrangian and Hamiltonian Mechanics Lagrangian an Hamiltonian Mechanics.G. Simpson, Ph.. epartment of Physical Sciences an Engineering Prince George s Community College ecember 5, 007 Introuction In this course we have been stuying classical

More information

Calculus of Variations

Calculus of Variations 16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t

More information

UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics

UC Berkeley Department of Electrical Engineering and Computer Science Department of Statistics UC Berkeley Department of Electrical Engineering an Computer Science Department of Statistics EECS 8B / STAT 4B Avance Topics in Statistical Learning Theory Solutions 3 Spring 9 Solution 3. For parti,

More information

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM

More information

Energy behaviour of the Boris method for charged-particle dynamics

Energy behaviour of the Boris method for charged-particle dynamics Version of 25 April 218 Energy behaviour of the Boris metho for charge-particle ynamics Ernst Hairer 1, Christian Lubich 2 Abstract The Boris algorithm is a wiely use numerical integrator for the motion

More information

Designing of Acceptance Double Sampling Plan for Life Test Based on Percentiles of Exponentiated Rayleigh Distribution

Designing of Acceptance Double Sampling Plan for Life Test Based on Percentiles of Exponentiated Rayleigh Distribution International Journal of Statistics an Systems ISSN 973-675 Volume, Number 3 (7), pp. 475-484 Research Inia Publications http://www.ripublication.com Designing of Acceptance Double Sampling Plan for Life

More information

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises

More information

arxiv: v4 [cs.ds] 7 Mar 2014

arxiv: v4 [cs.ds] 7 Mar 2014 Analysis of Agglomerative Clustering Marcel R. Ackermann Johannes Blömer Daniel Kuntze Christian Sohler arxiv:101.697v [cs.ds] 7 Mar 01 Abstract The iameter k-clustering problem is the problem of partitioning

More information

A simple tranformation of copulas

A simple tranformation of copulas A simple tranformation of copulas V. Durrleman, A. Nikeghbali & T. Roncalli Groupe e Recherche Opérationnelle Créit Lyonnais France July 31, 2000 Abstract We stuy how copulas properties are moifie after

More information

Planar sheath and presheath

Planar sheath and presheath 5/11/1 Flui-Poisson System Planar sheath an presheath 1 Planar sheath an presheath A plasma between plane parallel walls evelops a positive potential which equalizes the rate of loss of electrons an ions.

More information

Assignment 1. g i (x 1,..., x n ) dx i = 0. i=1

Assignment 1. g i (x 1,..., x n ) dx i = 0. i=1 Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition

More information

Generalizing Kronecker Graphs in order to Model Searchable Networks

Generalizing Kronecker Graphs in order to Model Searchable Networks Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu

More information

Permanent vs. Determinant

Permanent vs. Determinant Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an

More information

Linear and quadratic approximation

Linear and quadratic approximation Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function

More information