Symmetry, Sliding Windows and Transfer Matrices.
|
|
- Julius Montgomery
- 6 years ago
- Views:
Transcription
1 Symmetry, Sliding Windows and Transfer Matrices Alexander Shpunt Department of Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (Dated: May 16, 2008) In this paper we study 1D k-neighbor Ising model Variational approach using modified nearestneighbor interaction strength is developed, but the optimization of the coupling constant appears at least as hard as the exact solution in the general case For the exact solution two formulations of transfer matrix are studied: the block-spin approach yielding matrix T and the sliding window approach yielding matrix T s Equivalence between the two is established with Ts k = T holding univesally Matrix T s is sparse and possesses apparent symmetries, giving hope for analytical computation of eigenvalues Special cases are worked out explicitly Finally, in the appendix we compute the exact partition function for the 2D Ising model on an anisotropic triangular lattice, using graphical techniques as shown in [1] PACS numbers: I ITRODUCTIO Despite its seeming simplicity, Ising models hold many theoretical challenges, especially when it comes to exact analytical calculations The significance of the obtaining such results lies in their Universality (cf eg [1]), meaning that the insights obtained from Ising model will be applicable to a variety of real physical systems, too complicated to study in their full generality The 1D nearest-neighbor Ising model has been solved exactly with arbitrary magnetic field Following the work of Onsager ([2]), and consequent simplifications of the treatment, the exact solution for 2D lattices has been achieved, with zero magnetic field In this paper, we investigate analytic approaches to k-neigbor Ising model (kim) In Section II A we develop a variational formulation for kim Following the apparent difficulty of analytical optimization of the parameters of the variational anzats, we investigate the connections between two alternative formulations of transfer matrices In Section II B we show that the two approaches are indeed equivalent and explore some of the consequences of the new formulation In Appendix we discuss the general case and conclude with the exact partition function for the 2D anisotropic triangular lattice II K-EIGHBOR 1D ISIG MODEL The Hamiltonian, with indices taken modulo is: βh = K j S i S i+j = K j S i S i+j A Variational Estimates Here we give an estimate of the free energy of the radius-k model through the variational principle, with the exactly solvable single parameter nearest-neighbor model as the trial distribution The well-known variational principle states βf β F min J {βf 0 + βh βh 0 0 }, (1) where 0 refer to averages taken with respect to the trial distribution Our trial distribution is the nearest neighbor Ising model with the Hamiltonian: βh 0 = J S i S i+1,
2 2 where again all the indices are understood modulo For such a model, denoting t = tanh J Moreover, Using (2), βf 0 = ln Z 0 = ( ln [2 cosh J] + ln [ 1 + t ]) = ln ln(1 t2 ) ln [ 1 + t ] βh 0 0 = J S i S i+j 0 = tj + t j 1 + t (2) S i S i+1 0 = J t + t t, Consequently, β F = ln 2 + min t We need to minimize βh 0 = K j S i S i+j 0 = 2 ln(1 t2 ) ln [ 1 + t ] t Ψ = 2 ln(1 t2 ) ln [ 1 + t ] t K j t j + t j 1 + t K j (t j + t j ) J(t + t 1 ) K j (t j + t j ) J(t + t 1 ) dψ dt = t 1 t 2 t t 2 t 1 (1 + t ) t K j (t j + t j ) J(t + t 1 ) K j (jt j 1 + ( j)t j 1 ) J(1 + ( 1)t 2 ) t + t 2 1 t 2 Unfortunately, it is impossible to solve for dψ dt = 0 analytically, since it involves solving for general roots of polynomial of degree One conceivable approximation would be small-coupling, large (such that one could neglect terms of the order of t etc), but this is not much simpler than solving the exact model B Exact Partition Function for 1D Ising Model Here we compute the exact partition function for the ext-earest-eighbor Cyclic 1D Ising model We do it in two different ways, both by the method of transfer matrices, differing in the way the transfer matrix is defined The second way is somewhat less orthodox and the purpose of the exercise in this Section is to convince ourselves that these approaches are indeed equivalent The benefit of the less orthodox approach is that the transfer matrix is sparse and has symmetries that could potentially enable exact computations for arbitrary k The Hamiltonian for the case (again all indices are modulo ) is βh = The topology of the model is shown in Figure 1 S i (K 1 S i+1 + K 2 S i+2 )
3 3 FIG 1: 1D Ising model 1 The Conventional Transfer Matrix Let us employ the conventional transfer matrix approach, having 1 or e αk 1+βk 2 as its entries Z = {S i} P k e Si KjSi+j = tr[ S 1 S 2 e K1(S1S2+S2S3)+K2(S1S3+S2S4) S 3 S 4 S 3 S 4 e K1(S3S4+S4S5)+K2(S3S5+S4S6) S 5 S 6 S 1 S e K1(S 1S +S S 1)+K 2(S 1 S 1+S S 2) S 1 S 2 ] = tr [ T /2 ], where T is a 4x4 transfer matrix with elements S 1 S 2 T S 3 S 4 = e K1(S1S2+S2S3)+K2(S1S3+S2S4), explicitly e 2(k 1+k 2 ) e 2k 1 1 e 2k 2 T = e 2k1 e 2k1+2k2 e 2k2 1 1 e 2k2 e 2k1+2k2 e 2k1 e 2k2 1 e 2k1 e 2(k1+k2) 2 The Sliding Window Transfer Matrix Alternatively, Z = {S i } P k e Si KjSi+j = tr[ S 1 S 2 e S 1(K 1 S 2 +K 2 S 3 ) S 2 S 3 S 2 S 3 e S2(K1S3+K2S4) S 3 S 4 S i S i+1 e Si(K1Si+1+K2Si+2) S i+1 S i+2 S S 1 e S (K 1S 1+K 2S 2) S 1 S 2 ] = tr [ T s ],
4 4 where T s is a 4x4 transfer matrix with elements S 1 S 2 T S 2 S 3 = e S1(K1S2+K2S3), naively written as e k1+k2 e k1 k2 T s = e k1+k2 e (k1+k2) e (k1+k2) e k1+k2 e k1 k2 e k1+k2 It is really tempting to rearrange (relabeling) the rows of T s, toobtain a block-diagonal matrix e k 1 k 2 T s (b) = e (k 1+k 2 ) e k 1+k 2 e k 1+k 2 e (k 1+k 2 ) e k 1 k 2 However, unfortunately, in the general case, T s and T s (b) connected by similarity transformation will not have the same eigenvalues, since they are not 3 Comparison of the Two Approaches Examining the two formulations, it becomes obvious that they are completely equivalent provided T = Ts 2 and it indeed holds: holds, T 2 s = e k 1 k 2 e k 1+k 2 e (k 1+k 2 ) e (k 1+k 2 ) e k 1+k 2 e k 1 k 2 2 = e 2(k 1+k 2 ) e 2k 1 1 e 2k 2 e 2k 1 e 2k 1+2k 2 e 2k e 2k2 e 2k1+2k2 e 2k1 e 2k 2 1 e 2k 1 e 2(k 1+k 2 ) = T Since we have shown equivalence at the level of transfer matrices, it is cleat that all derived quantities will agree too Moreover, the derivations are by no means unique to the model and hold for a general k-neighbors also We thus have established the equivalence of the two approaches for transfer matrix computations To compute the exact partition function, lets use T s The eigenvalues of the matrix T s are: ) λ 1± = e (cosh K2 K 1 ± (sinh K 1 ) 2 + e 4K 2, Consequently, ) λ 2± = e (sinh K2 K 1 ± (cosh K 1 ) 2 e 4K 2 [ ( ( Z = e K 2 cosh K 1 + (sinh K 1 ) 2 + e 2) 4K + cosh K 1 (sinh K 1 ) 2 + e 2) 4K + + ( ( ) ] sinh K 1 + (cosh K 1 ) 2 e 2) 4K + sinh K 1 (cosh K 1 ) 2 e 4K 2 III DISCUSSIO AD FUTURE DIRECTIOS In this paper we considered analytical approaches to Ising models with long-range interactions The symmetry structure of the newly developed sliding window transfer matrix is promising and merits further research It is shown for instance, that partition function is computable exactly using these symmetries It would be interesting to continue the investigation of the symmetry properties and ways to use them to obtain non-trivial exact results
5 5 IV APPEDIX A Why the Exact Partition Function for the 1D Ising Model With K neighbors is Still ot Computed ow that we have convinced ourselves through simple example that the two alternative transfer matrix formulations are indeed equivalent, the treatment for the k-neighbor Ising model follows as a simple generalization of the k = 2 case Z = {S i} P k P k e Si KjSi+j = tr[ S 1 S 2 S k e S1 KjS1+j S 2 S 3 S k+1 S 2 S 3 S k+1 e S 2 P k K js 2+j S 3 S 4 S k+2 S i S i+1 S k+i 1 e S i P k K js i+j S i+1 S i+2 S k+i S S 1 S k 1 e S P k K js +j S 1 S 2 S k ] = tr [ T s(k) ], where T s(k) is a 2 k x2 k sliding window transfer matrix with entries { P S 1 S 2 S k T s(k) S 1S 2 S k = e S k 1 KjS j If (S 2, S 3,, S k ) = (S 1, S 2,, S k 1 ), 0 Otherwise (since mutually inconsistent) It is important to note that each row and column of T s(k) has exactly 2 entries S 1 S 2 S k T s(k) S 2 S 3 S k+1 = e S P k 1 K js 1+j, and the rest are zeros The matrix T s(k) is sparse, with the number of non-zero entries linear in matrix size For instance, for model, we have the following matrix (denote κ i = e K i ): κ 1 κ 2 κ 3 κ 1 κ 2 /κ κ 1 κ 3 /κ 2 κ 1 /(κ 2 κ 3 ) + + κ 2 κ 3 /κ 1 κ 2 /(κ 1 κ 3 ) + κ 3 /(κ 1 κ 2 ) 1/(κ 1 κ 2 κ 3 ) + + 1/(κ 1 κ 2 κ 3 ) κ 3 /(κ 1 κ 2 ) + κ 2 /κ 1 κ 3 (κ 2 κ 3 )/κ 1 + κ 1 /(κ 2 κ 3 ) κ 1 κ 3 /κ 2 κ 1 κ 2 /κ 3 κ 1 κ 2 κ 3 The matrix has a pronounced symmetry, which gives hope for an analytical solution for the eigenvalues Actually, the solution for is possible, since it involves quartic polynomials Due to a severe lack of time we have not been able to conclude our calculations for Unfortunately, tempting as it is, in spite of the fact that T s(k) can be cast into a block-diagonal term by the cyclic shift of one of it s coordinates, this will change the eigenvalues κ 1 κ 2 κ 3 κ 1 κ 2 /κ /(κ 1 κ 2 κ 3 ) κ 3 /(κ 1 κ 2 ) + + κ 1 κ 3 /κ 2 κ 1 /(κ 2 κ 3 ) + κ 2 /κ 1 κ 3 (κ 2 κ 3 )/κ κ 2 κ 3 /κ 1 κ 2 /(κ 1 κ 3 ) + κ 1 /(κ 2 κ 3 ) κ 1 κ 3 /κ 2 + κ 3 /(κ 1 κ 2 ) 1/(κ 1 κ 2 κ 3 ) κ 1 κ 2 /κ 3 κ 1 κ 2 κ 3 The determinant, i λ i is correct and can be computed easily Since we were not sure of the utility of the calculation, we did not pursue this explicitly
6 6 FIG 2: Direction labels for 2D triangular lattice B Exact Partition Function for the Ising Model on 2D Triangular Lattice Here we develop the exact partition function for the Ising model on 2D triangular lattice, using graphic techniques It is easy to see that the same approach that worked for the square lattice works also here Denoting t i = tanh(k i ), and repeating the steps in [1], we get ln Z 3 = ln(2 cosh(k i )) 1 3 tr ln(1 T (q)) = ln(2 cosh(k i )) q d 2 q (2π) 2 ln det(1 T (q)), where in the last equality we used the fact that tr ln(1 T (q)) = ln det(1 T (q)) The directions for building the T matrix are shown in Figure 2 Using these, we have the following directions map Consequently, t 1 e iqx t 1 e i(qx+π/3) t 1 e i(qx+2π/3) 0 t 1 e i(qx 2π/3) t 1 e i(qx π/3) t 2 e i(qx+qy π/3) t 2 e i(qx+qy) t 2 e i(qx+qy+π/3) t 2 e i(qx+qy+2π/3) 0 t 2 e i(qx+qy 2π/3) T (q) = t 3 e i(qy 2π/3) t 3 e i(qy π/3) t 3 e iqy t 3 e i(qy+π/3) t 3 e i(qy+2π/3) 0 0 t 1 e i(qx+2π/3) t 1 e i(qx+π/3) t 1 e iqx t 1 e i(qx π/3) t 1 e i(qx 2π/3) t 2 e i(qx+qy 2π/3) 0 t 2 e i(qx+qy+2π/3) t 2 e i(qx+qy+π/3) t 2 e i(qx+qy) t 2 e i(qx+qy π/3) t 3 e i(qy π/3) t 3 e i(qy 2π/3) 0 t 3 e i(qy+2π/3) t 3 e i(qy+π/3) t 3 e iqy Denoting X e iq x, Y e iq y, Ω e iπ/3, t 1 X 1 t 1 X 1 Ω 1 t 1 X 1 Ω 2 0 t 1 X 1 Ω 2 t 1 X 1 Ω t 2 (XY ) 1 Ω t 2 (XY ) 1 t 2 (XY ) 1 Ω 1 t 2 (XY ) 1 Ω 2 0 t 2 (XY ) 1 Ω 2 T (q) = t 3 Y 1 Ω 2 t 3 Y 1 Ω t 3 Y 1 t 3 Y 1 Ω 1 t 3 Y 1 Ω t 1 XΩ 2 t 1 XΩ t 1 X t 1 XΩ 1 t 1 XΩ 2 t 2 XY Ω 2 0 t 2 XY Ω 2 t 2 XY Ω t 2 XY t 2 XY Ω 1 t 3 Y Ω 1 t 3 Y Ω 2 0 t 3 Y Ω 2 t 3 Y Ω t 3 Y Using Mathematica, we arrive at the following expression 3 det(1 T (q)) = cosh(2k i) 3 sinh(2k i) sinh(2k 1 ) cos(q x ) sinh(2k 2 ) cos(q y ) sinh(2k 3 ) cos(q x + q y ) cosh 2 (K 1 ) cosh 2 (K 2 ) cosh 2 (K 3 )
7 Summarizing, ln Z 2 = 2 2π 0 dq 2 xdq 2 y (2π) 2 [ 3 ln cosh(2k i ) ] 3 sinh(2k i ) sinh(2k 1 ) cos(q x ) sinh(2k 2 ) cos(q y ) sinh(2k 3 ) cos(q x + q y ) 7 [1] M Kardar, Statistical Physics of Fields, Cambridge University Press, 2007 [2] L Onsager, Phys Rev 65, 117 (1944)
Martingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
More informationHandout 4: Deterministic Systems and the Shortest Path Problem
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 4: Deterministic Systems and the Shortest Path Problem Instructor: Shiqian Ma January 27, 2014 Suggested Reading: Bertsekas
More informationSquare-Root Measurement for Ternary Coherent State Signal
ISSN 86-657 Square-Root Measurement for Ternary Coherent State Signal Kentaro Kato Quantum ICT Research Institute, Tamagawa University 6-- Tamagawa-gakuen, Machida, Tokyo 9-86, Japan Tamagawa University
More informationTrust Region Methods for Unconstrained Optimisation
Trust Region Methods for Unconstrained Optimisation Lecture 9, Numerical Linear Algebra and Optimisation Oxford University Computing Laboratory, MT 2007 Dr Raphael Hauser (hauser@comlab.ox.ac.uk) The Trust
More informationChapter 1 Microeconomics of Consumer Theory
Chapter Microeconomics of Consumer Theory The two broad categories of decision-makers in an economy are consumers and firms. Each individual in each of these groups makes its decisions in order to achieve
More informationLecture 3: Factor models in modern portfolio choice
Lecture 3: Factor models in modern portfolio choice Prof. Massimo Guidolin Portfolio Management Spring 2016 Overview The inputs of portfolio problems Using the single index model Multi-index models Portfolio
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period
More information3.2 No-arbitrage theory and risk neutral probability measure
Mathematical Models in Economics and Finance Topic 3 Fundamental theorem of asset pricing 3.1 Law of one price and Arrow securities 3.2 No-arbitrage theory and risk neutral probability measure 3.3 Valuation
More informationChapter 4 Inflation and Interest Rates in the Consumption-Savings Model
Chapter 4 Inflation and Interest Rates in the Consumption-Savings Model The lifetime budget constraint (LBC) from the two-period consumption-savings model is a useful vehicle for introducing and analyzing
More informationMaximum Contiguous Subsequences
Chapter 8 Maximum Contiguous Subsequences In this chapter, we consider a well-know problem and apply the algorithm-design techniques that we have learned thus far to this problem. While applying these
More informationIEOR E4004: Introduction to OR: Deterministic Models
IEOR E4004: Introduction to OR: Deterministic Models 1 Dynamic Programming Following is a summary of the problems we discussed in class. (We do not include the discussion on the container problem or the
More information9.1 Principal Component Analysis for Portfolios
Chapter 9 Alpha Trading By the name of the strategies, an alpha trading strategy is to select and trade portfolios so the alpha is maximized. Two important mathematical objects are factor analysis and
More informationApplication of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem
Application of an Interval Backward Finite Difference Method for Solving the One-Dimensional Heat Conduction Problem Malgorzata A. Jankowska 1, Andrzej Marciniak 2 and Tomasz Hoffmann 2 1 Poznan University
More informationThe Optimization Process: An example of portfolio optimization
ISyE 6669: Deterministic Optimization The Optimization Process: An example of portfolio optimization Shabbir Ahmed Fall 2002 1 Introduction Optimization can be roughly defined as a quantitative approach
More informationDynamic Replication of Non-Maturing Assets and Liabilities
Dynamic Replication of Non-Maturing Assets and Liabilities Michael Schürle Institute for Operations Research and Computational Finance, University of St. Gallen, Bodanstr. 6, CH-9000 St. Gallen, Switzerland
More informationChapter 10 Inventory Theory
Chapter 10 Inventory Theory 10.1. (a) Find the smallest n such that g(n) 0. g(1) = 3 g(2) =2 n = 2 (b) Find the smallest n such that g(n) 0. g(1) = 1 25 1 64 g(2) = 1 4 1 25 g(3) =1 1 4 g(4) = 1 16 1
More informationSupplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4.
Supplementary Material for Combinatorial Partial Monitoring Game with Linear Feedback and Its Application. A. Full proof for Theorems 4.1 and 4. If the reader will recall, we have the following problem-specific
More informationMAT 4250: Lecture 1 Eric Chung
1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose
More informationHomework 1 Due February 10, 2009 Chapters 1-4, and 18-24
Homework Due February 0, 2009 Chapters -4, and 8-24 Make sure your graphs are scaled and labeled correctly. Note important points on the graphs and label them. Also be sure to label the axis on all of
More informationQuadrant marked mesh patterns in 123-avoiding permutations
Quadrant marked mesh patterns in 23-avoiding permutations Dun Qiu Department of Mathematics University of California, San Diego La Jolla, CA 92093-02. USA duqiu@math.ucsd.edu Jeffrey Remmel Department
More informationELEMENTS OF MATRIX MATHEMATICS
QRMC07 9/7/0 4:45 PM Page 5 CHAPTER SEVEN ELEMENTS OF MATRIX MATHEMATICS 7. AN INTRODUCTION TO MATRICES Investors frequently encounter situations involving numerous potential outcomes, many discrete periods
More informationBudget Setting Strategies for the Company s Divisions
Budget Setting Strategies for the Company s Divisions Menachem Berg Ruud Brekelmans Anja De Waegenaere November 14, 1997 Abstract The paper deals with the issue of budget setting to the divisions of a
More informationThe Assignment Problem
The Assignment Problem E.A Dinic, M.A Kronrod Moscow State University Soviet Math.Dokl. 1969 January 30, 2012 1 Introduction Motivation Problem Definition 2 Motivation Problem Definition Outline 1 Introduction
More informationChapter 6: Supply and Demand with Income in the Form of Endowments
Chapter 6: Supply and Demand with Income in the Form of Endowments 6.1: Introduction This chapter and the next contain almost identical analyses concerning the supply and demand implied by different kinds
More informationLecture 7: Bayesian approach to MAB - Gittins index
Advanced Topics in Machine Learning and Algorithmic Game Theory Lecture 7: Bayesian approach to MAB - Gittins index Lecturer: Yishay Mansour Scribe: Mariano Schain 7.1 Introduction In the Bayesian approach
More informationNotes on Estimating the Closed Form of the Hybrid New Phillips Curve
Notes on Estimating the Closed Form of the Hybrid New Phillips Curve Jordi Galí, Mark Gertler and J. David López-Salido Preliminary draft, June 2001 Abstract Galí and Gertler (1999) developed a hybrid
More informationPart 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)
Part 3: Trust-region methods for unconstrained optimization Nick Gould (RAL) minimize x IR n f(x) MSc course on nonlinear optimization UNCONSTRAINED MINIMIZATION minimize x IR n f(x) where the objective
More informationLog-linear Dynamics and Local Potential
Log-linear Dynamics and Local Potential Daijiro Okada and Olivier Tercieux [This version: November 28, 2008] Abstract We show that local potential maximizer ([15]) with constant weights is stochastically
More information(1) Get a job now and don t go to graduate school (2) Get a graduate degree and then get a higher paying job. > V J or, stated another way, if V G
An Example Working with the Time Value of Money GRAD SCHOOL? The problem with trying to solve time value of money (TVM) problems simply by memorizing formulas for zero-coupon discount securities and annuities
More informationSTOCK PRICE PREDICTION: KOHONEN VERSUS BACKPROPAGATION
STOCK PRICE PREDICTION: KOHONEN VERSUS BACKPROPAGATION Alexey Zorin Technical University of Riga Decision Support Systems Group 1 Kalkyu Street, Riga LV-1658, phone: 371-7089530, LATVIA E-mail: alex@rulv
More informationDirect Methods for linear systems Ax = b basic point: easy to solve triangular systems
NLA p.1/13 Direct Methods for linear systems Ax = b basic point: easy to solve triangular systems... 0 0 0 etc. a n 1,n 1 x n 1 = b n 1 a n 1,n x n solve a n,n x n = b n then back substitution: takes n
More informationInterpretive Structural Modeling of Interactive Risks
Interpretive Structural Modeling of Interactive isks ick Gorvett, FCAS, MAAA, FM, AM, Ph.D. Ningwei Liu, Ph.D. 2 Call Paper Program 26 Enterprise isk Management Symposium Chicago, IL Abstract The typical
More informationCourse notes for EE394V Restructured Electricity Markets: Locational Marginal Pricing
Course notes for EE394V Restructured Electricity Markets: Locational Marginal Pricing Ross Baldick Copyright c 2018 Ross Baldick www.ece.utexas.edu/ baldick/classes/394v/ee394v.html Title Page 1 of 160
More informationMATH 5510 Mathematical Models of Financial Derivatives. Topic 1 Risk neutral pricing principles under single-period securities models
MATH 5510 Mathematical Models of Financial Derivatives Topic 1 Risk neutral pricing principles under single-period securities models 1.1 Law of one price and Arrow securities 1.2 No-arbitrage theory and
More informationMATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS
MATH307/37 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS School of Mathematics and Statistics Semester, 04 Tutorial problems should be used to test your mathematical skills and understanding of the lecture material.
More informationIf Tom's utility function is given by U(F, S) = FS, graph the indifference curves that correspond to 1, 2, 3, and 4 utils, respectively.
CHAPTER 3 APPENDIX THE UTILITY FUNCTION APPROACH TO THE CONSUMER BUDGETING PROBLEM The Utility-Function Approach to Consumer Choice Finding the highest attainable indifference curve on a budget constraint
More informationFinancial Liberalization and Neighbor Coordination
Financial Liberalization and Neighbor Coordination Arvind Magesan and Jordi Mondria January 31, 2011 Abstract In this paper we study the economic and strategic incentives for a country to financially liberalize
More informationRadner Equilibrium: Definition and Equivalence with Arrow-Debreu Equilibrium
Radner Equilibrium: Definition and Equivalence with Arrow-Debreu Equilibrium Econ 2100 Fall 2017 Lecture 24, November 28 Outline 1 Sequential Trade and Arrow Securities 2 Radner Equilibrium 3 Equivalence
More informationBasic Procedure for Histograms
Basic Procedure for Histograms 1. Compute the range of observations (min. & max. value) 2. Choose an initial # of classes (most likely based on the range of values, try and find a number of classes that
More informationOptimizing Modular Expansions in an Industrial Setting Using Real Options
Optimizing Modular Expansions in an Industrial Setting Using Real Options Abstract Matt Davison Yuri Lawryshyn Biyun Zhang The optimization of a modular expansion strategy, while extremely relevant in
More informationLECTURE 2: MULTIPERIOD MODELS AND TREES
LECTURE 2: MULTIPERIOD MODELS AND TREES 1. Introduction One-period models, which were the subject of Lecture 1, are of limited usefulness in the pricing and hedging of derivative securities. In real-world
More information2D penalized spline (continuous-by-continuous interaction)
2D penalized spline (continuous-by-continuous interaction) Two examples (RWC, Section 13.1): Number of scallops caught off Long Island Counts are made at specific coordinates. Incidence of AIDS in Italian
More informationCarnegie Mellon University Graduate School of Industrial Administration
Carnegie Mellon University Graduate School of Industrial Administration Chris Telmer Winter 2005 Final Examination Seminar in Finance 1 (47 720) Due: Thursday 3/3 at 5pm if you don t go to the skating
More informationPortfolio Management and Optimal Execution via Convex Optimization
Portfolio Management and Optimal Execution via Convex Optimization Enzo Busseti Stanford University April 9th, 2018 Problems portfolio management choose trades with optimization minimize risk, maximize
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationa 13 Notes on Hidden Markov Models Michael I. Jordan University of California at Berkeley Hidden Markov Models The model
Notes on Hidden Markov Models Michael I. Jordan University of California at Berkeley Hidden Markov Models This is a lightly edited version of a chapter in a book being written by Jordan. Since this is
More informationA Formal Study of Distributed Resource Allocation Strategies in Multi-Agent Systems
A Formal Study of Distributed Resource Allocation Strategies in Multi-Agent Systems Jiaying Shen, Micah Adler, Victor Lesser Department of Computer Science University of Massachusetts Amherst, MA 13 Abstract
More informationMulti-armed bandits in dynamic pricing
Multi-armed bandits in dynamic pricing Arnoud den Boer University of Twente, Centrum Wiskunde & Informatica Amsterdam Lancaster, January 11, 2016 Dynamic pricing A firm sells a product, with abundant inventory,
More informationNon replication of options
Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial
More informationFrom Double Chain Ladder To Double GLM
University of Amsterdam MSc Stochastics and Financial Mathematics Master Thesis From Double Chain Ladder To Double GLM Author: Robert T. Steur Examiner: dr. A.J. Bert van Es Supervisors: drs. N.R. Valkenburg
More informationClassifying Solvency Capital Requirement Contribution of Collective Investments under Solvency II
Classifying Solvency Capital Requirement Contribution of Collective Investments under Solvency II Working Paper Series 2016-03 (01) SolvencyAnalytics.com March 2016 Classifying Solvency Capital Requirement
More informationA model reduction approach to numerical inversion for parabolic partial differential equations
A model reduction approach to numerical inversion for parabolic partial differential equations Liliana Borcea Alexander V. Mamonov 2, Vladimir Druskin 2, Mikhail Zaslavsky 2 University of Michigan, Ann
More informationSummary Sampling Techniques
Summary Sampling Techniques MS&E 348 Prof. Gerd Infanger 2005/2006 Using Monte Carlo sampling for solving the problem Monte Carlo sampling works very well for estimating multiple integrals or multiple
More informationOutline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.
Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization
More informationPhys. Lett. A, 372/17, (2008),
Phys. Lett. A, 372/17, (2008), 3064-3070. 1 Wave scattering by many small particles embedded in a medium. A. G. Ramm (Mathematics Department, Kansas State University, Manhattan, KS66506, USA and TU Darmstadt,
More informationLecture 5 Theory of Finance 1
Lecture 5 Theory of Finance 1 Simon Hubbert s.hubbert@bbk.ac.uk January 24, 2007 1 Introduction In the previous lecture we derived the famous Capital Asset Pricing Model (CAPM) for expected asset returns,
More informationExam in TFY4275/FY8907 CLASSICAL TRANSPORT THEORY Feb 14, 2014
NTNU Page 1 of 5 Institutt for fysikk Contact during the exam: Professor Ingve Simonsen Exam in TFY4275/FY8907 CLASSICAL TRANSPORT THEORY Feb 14, 2014 Allowed help: Alternativ D All written material This
More informationTwo-Dimensional Bayesian Persuasion
Two-Dimensional Bayesian Persuasion Davit Khantadze September 30, 017 Abstract We are interested in optimal signals for the sender when the decision maker (receiver) has to make two separate decisions.
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationMath1090 Midterm 2 Review Sections , Solve the system of linear equations using Gauss-Jordan elimination.
Math1090 Midterm 2 Review Sections 2.1-2.5, 3.1-3.3 1. Solve the system of linear equations using Gauss-Jordan elimination. 5x+20y 15z = 155 (a) 2x 7y+13z=85 3x+14y +6z= 43 x+z= 2 (b) x= 6 y+z=11 x y+
More information2.1 Mathematical Basis: Risk-Neutral Pricing
Chapter Monte-Carlo Simulation.1 Mathematical Basis: Risk-Neutral Pricing Suppose that F T is the payoff at T for a European-type derivative f. Then the price at times t before T is given by f t = e r(t
More informationProblem 1 / 20 Problem 2 / 30 Problem 3 / 25 Problem 4 / 25
Department of Applied Economics Johns Hopkins University Economics 60 Macroeconomic Theory and Policy Midterm Exam Suggested Solutions Professor Sanjay Chugh Fall 00 NAME: The Exam has a total of four
More informationfig 3.2 promissory note
Chapter 4. FIXED INCOME SECURITIES Objectives: To set the price of securities at the specified moment of time. To simulate mathematical and real content situations, where the values of securities need
More informationJournal of Computational and Applied Mathematics. The mean-absolute deviation portfolio selection problem with interval-valued returns
Journal of Computational and Applied Mathematics 235 (2011) 4149 4157 Contents lists available at ScienceDirect Journal of Computational and Applied Mathematics journal homepage: www.elsevier.com/locate/cam
More informationYEAR 12 Trial Exam Paper FURTHER MATHEMATICS. Written examination 1. Worked solutions
YEAR 12 Trial Exam Paper 2018 FURTHER MATHEMATICS Written examination 1 Worked solutions This book presents: worked solutions explanatory notes tips on how to approach the exam. This trial examination
More informationIDENTIFYING BROAD AND NARROW FINANCIAL RISK FACTORS VIA CONVEX OPTIMIZATION: PART II
1 IDENTIFYING BROAD AND NARROW FINANCIAL RISK FACTORS VIA CONVEX OPTIMIZATION: PART II Alexander D. Shkolnik ads2@berkeley.edu MMDS Workshop. June 22, 2016. joint with Jeffrey Bohn and Lisa Goldberg. Identifying
More informationA model reduction approach to numerical inversion for parabolic partial differential equations
A model reduction approach to numerical inversion for parabolic partial differential equations Liliana Borcea Alexander V. Mamonov 2, Vladimir Druskin 3, Mikhail Zaslavsky 3 University of Michigan, Ann
More informationDevelopmental Math An Open Program Unit 12 Factoring First Edition
Developmental Math An Open Program Unit 12 Factoring First Edition Lesson 1 Introduction to Factoring TOPICS 12.1.1 Greatest Common Factor 1 Find the greatest common factor (GCF) of monomials. 2 Factor
More informationHigh Volatility Medium Volatility /24/85 12/18/86
Estimating Model Limitation in Financial Markets Malik Magdon-Ismail 1, Alexander Nicholson 2 and Yaser Abu-Mostafa 3 1 malik@work.caltech.edu 2 zander@work.caltech.edu 3 yaser@caltech.edu Learning Systems
More informationON INTEREST RATE POLICY AND EQUILIBRIUM STABILITY UNDER INCREASING RETURNS: A NOTE
Macroeconomic Dynamics, (9), 55 55. Printed in the United States of America. doi:.7/s6559895 ON INTEREST RATE POLICY AND EQUILIBRIUM STABILITY UNDER INCREASING RETURNS: A NOTE KEVIN X.D. HUANG Vanderbilt
More informationEE/AA 578 Univ. of Washington, Fall Homework 8
EE/AA 578 Univ. of Washington, Fall 2016 Homework 8 1. Multi-label SVM. The basic Support Vector Machine (SVM) described in the lecture (and textbook) is used for classification of data with two labels.
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
More information1 The EOQ and Extensions
IEOR4000: Production Management Lecture 2 Professor Guillermo Gallego September 16, 2003 Lecture Plan 1. The EOQ and Extensions 2. Multi-Item EOQ Model 1 The EOQ and Extensions We have explored some of
More informationOnline Appendix: Extensions
B Online Appendix: Extensions In this online appendix we demonstrate that many important variations of the exact cost-basis LUL framework remain tractable. In particular, dual problem instances corresponding
More information2 Control variates. λe λti λe e λt i where R(t) = t Y 1 Y N(t) is the time from the last event to t. L t = e λr(t) e e λt(t) Exercises
96 ChapterVI. Variance Reduction Methods stochastic volatility ISExSoren5.9 Example.5 (compound poisson processes) Let X(t) = Y + + Y N(t) where {N(t)},Y, Y,... are independent, {N(t)} is Poisson(λ) with
More informationSolving Risk Conditions Optimization Problem in Portfolio Models
Australian Journal of Basic and Applied Sciences, 6(9): 669-673, 2012 ISSN 1991-8178 Solving Risk Conditions Optimization Problem in Portfolio Models Reza Nazari Department of Economics, Tabriz branch,
More informationPractical example of an Economic Scenario Generator
Practical example of an Economic Scenario Generator Martin Schenk Actuarial & Insurance Solutions SAV 7 March 2014 Agenda Introduction Deterministic vs. stochastic approach Mathematical model Application
More informationAppendix: Common Currencies vs. Monetary Independence
Appendix: Common Currencies vs. Monetary Independence A The infinite horizon model This section defines the equilibrium of the infinity horizon model described in Section III of the paper and characterizes
More informationSTATISTICAL ANALYSIS OF HIGH FREQUENCY FINANCIAL TIME SERIES: INDIVIDUAL AND COLLECTIVE STOCK DYNAMICS
Erasmus Mundus Master in Complex Systems STATISTICAL ANALYSIS OF HIGH FREQUENCY FINANCIAL TIME SERIES: INDIVIDUAL AND COLLECTIVE STOCK DYNAMICS June 25, 2012 Esteban Guevara Hidalgo esteban guevarah@yahoo.es
More informationMulti-state transition models with actuarial applications c
Multi-state transition models with actuarial applications c by James W. Daniel c Copyright 2004 by James W. Daniel Reprinted by the Casualty Actuarial Society and the Society of Actuaries by permission
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May 1, 2014
COS 5: heoretical Machine Learning Lecturer: Rob Schapire Lecture #24 Scribe: Jordan Ash May, 204 Review of Game heory: Let M be a matrix with all elements in [0, ]. Mindy (called the row player) chooses
More informationNumerical Methods in Option Pricing (Part III)
Numerical Methods in Option Pricing (Part III) E. Explicit Finite Differences. Use of the Forward, Central, and Symmetric Central a. In order to obtain an explicit solution for the price of the derivative,
More informationArrow Debreu Equilibrium. October 31, 2015
Arrow Debreu Equilibrium October 31, 2015 Θ 0 = {s 1,...s S } - the set of (unknown) states of the world assuming there are S unknown states. information is complete but imperfect n - number of consumers
More informationUtility Indifference Pricing and Dynamic Programming Algorithm
Chapter 8 Utility Indifference ricing and Dynamic rogramming Algorithm In the Black-Scholes framework, we can perfectly replicate an option s payoff. However, it may not be true beyond the Black-Scholes
More informationResource Allocation within Firms and Financial Market Dislocation: Evidence from Diversified Conglomerates
Resource Allocation within Firms and Financial Market Dislocation: Evidence from Diversified Conglomerates Gregor Matvos and Amit Seru (RFS, 2014) Corporate Finance - PhD Course 2017 Stefan Greppmair,
More informationA Harmonic Analysis Solution to the Basket Arbitrage Problem
A Harmonic Analysis Solution to the Basket Arbitrage Problem Alexandre d Aspremont ORFE, Princeton University. A. d Aspremont, INFORMS, San Francisco, Nov. 14 2005. 1 Introduction Classic Black & Scholes
More informationECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games
University of Illinois Fall 2018 ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games Due: Tuesday, Sept. 11, at beginning of class Reading: Course notes, Sections 1.1-1.4 1. [A random
More informationLattice Model of System Evolution. Outline
Lattice Model of System Evolution Richard de Neufville Professor of Engineering Systems and of Civil and Environmental Engineering MIT Massachusetts Institute of Technology Lattice Model Slide 1 of 48
More informationValue of Flexibility in Managing R&D Projects Revisited
Value of Flexibility in Managing R&D Projects Revisited Leonardo P. Santiago & Pirooz Vakili November 2004 Abstract In this paper we consider the question of whether an increase in uncertainty increases
More information1 The Solow Growth Model
1 The Solow Growth Model The Solow growth model is constructed around 3 building blocks: 1. The aggregate production function: = ( ()) which it is assumed to satisfy a series of technical conditions: (a)
More informationCollective Profitability and Welfare in Selling-Buying Intermediation Processes
Collective Profitability and Welfare in Selling-Buying Intermediation Processes Amelia Bădică 1, Costin Bădică 1(B), Mirjana Ivanović 2, and Ionuţ Buligiu 1 1 University of Craiova, A. I. Cuza 13, 200530
More informationFinite Potential Well
Finite Potential Well These notes are provided as a supplement to the text and a replacement for the lecture on 11/16/17. Make sure you fill in the steps outlined in red. The finite potential well problem
More informationShort-time-to-expiry expansion for a digital European put option under the CEV model. November 1, 2017
Short-time-to-expiry expansion for a digital European put option under the CEV model November 1, 2017 Abstract In this paper I present a short-time-to-expiry asymptotic series expansion for a digital European
More information(RP13) Efficient numerical methods on high-performance computing platforms for the underlying financial models: Series Solution and Option Pricing
(RP13) Efficient numerical methods on high-performance computing platforms for the underlying financial models: Series Solution and Option Pricing Jun Hu Tampere University of Technology Final conference
More informationMengdi Wang. July 3rd, Laboratory for Information and Decision Systems, M.I.T.
Practice July 3rd, 2012 Laboratory for Information and Decision Systems, M.I.T. 1 2 Infinite-Horizon DP Minimize over policies the objective cost function J π (x 0 ) = lim N E w k,k=0,1,... DP π = {µ 0,µ
More informationChapter 5 Finite Difference Methods. Math6911 W07, HM Zhu
Chapter 5 Finite Difference Methods Math69 W07, HM Zhu References. Chapters 5 and 9, Brandimarte. Section 7.8, Hull 3. Chapter 7, Numerical analysis, Burden and Faires Outline Finite difference (FD) approximation
More informationIs Greedy Coordinate Descent a Terrible Algorithm?
Is Greedy Coordinate Descent a Terrible Algorithm? Julie Nutini, Mark Schmidt, Issam Laradji, Michael Friedlander, Hoyt Koepke University of British Columbia Optimization and Big Data, 2015 Context: Random
More informationEco504 Spring 2010 C. Sims MID-TERM EXAM. (1) (45 minutes) Consider a model in which a representative agent has the objective. B t 1.
Eco504 Spring 2010 C. Sims MID-TERM EXAM (1) (45 minutes) Consider a model in which a representative agent has the objective function max C,K,B t=0 β t C1 γ t 1 γ and faces the constraints at each period
More information6.231 DYNAMIC PROGRAMMING LECTURE 8 LECTURE OUTLINE
6.231 DYNAMIC PROGRAMMING LECTURE 8 LECTURE OUTLINE Suboptimal control Cost approximation methods: Classification Certainty equivalent control: An example Limited lookahead policies Performance bounds
More informationGeneralized Dynamic Factor Models and Volatilities: Recovering the Market Volatility Shocks
Generalized Dynamic Factor Models and Volatilities: Recovering the Market Volatility Shocks Paper by: Matteo Barigozzi and Marc Hallin Discussion by: Ross Askanazi March 27, 2015 Paper by: Matteo Barigozzi
More information