[go: up one dir, main page]

JP2009266184A - Markov risk calculation - Google Patents

Markov risk calculation Download PDF

Info

Publication number
JP2009266184A
JP2009266184A JP2008136035A JP2008136035A JP2009266184A JP 2009266184 A JP2009266184 A JP 2009266184A JP 2008136035 A JP2008136035 A JP 2008136035A JP 2008136035 A JP2008136035 A JP 2008136035A JP 2009266184 A JP2009266184 A JP 2009266184A
Authority
JP
Japan
Prior art keywords
interest
transition
order
state
calculation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP2008136035A
Other languages
Japanese (ja)
Inventor
Izumi Yamazaki
泉 山▲崎▼
Junichi Yamazaki
淳一 山▲崎▼
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to JP2008136035A priority Critical patent/JP2009266184A/en
Publication of JP2009266184A publication Critical patent/JP2009266184A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

<P>PROBLEM TO BE SOLVED: To obtain an effective calculation result within an appropriate amount of time when calculating the risk of an interest by obtaining the transition route of interest transition by a transition probability matrix in terms of a probability and a brute force. <P>SOLUTION: Each transition route is calculated by grouping using vectors in the order of a larger interest or a smaller interest indicated by a state included by each transition route, and each transition route is ordered by successively being changed from a state that an interest load is large to a state that it is small or from a state that the interest load is small to a state that it is large from the back of the vectors, and calculation is advanced according to the order. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

本発明は金利予測のリスク計算を推移確率マトリクスを用いてで総当り的に行うとき、膨大な計算量となって妥当な時間内に有効な計算結果を得ることが困難であることを解消するためのものであるThe present invention eliminates the difficulty of obtaining an effective calculation result within a reasonable amount of time when the risk calculation of interest rate prediction is performed brute-force using a transition probability matrix. Is for

従来は推移確率マトリクスで金利推移の推移ルートを確率的に且つ総当り的に求めて金利のリスク計算を行うと、全ルートについて計算を行わないと結果が得られないので計算時間がかかりすぎ、使用可能な結果を得ることが困難であった。Conventionally, if you calculate the interest rate transition route stochastically and brute-force with the transition probability matrix and calculate the risk of interest rate, the result will not be obtained unless you calculate for all routes, so it takes too much time, It was difficult to obtain usable results.

従来は推移確率マトリクスで金利推移の推移ルートを確率的に且つ総当り的に求めて金利のリスク計算を行うことは計算時間がかかりすぎ、使用可能な結果を得ることがて困難であった。Conventionally, it has been difficult to obtain a usable result because it takes too much calculation time to calculate the risk of interest rate by probabilistically and omnidirectionally determining the transition route of interest rate transition using the transition probability matrix.

各推移ルートをおのおのが含む状態が示す金利の大きいもの順にまたは小さいもの順に並べたベクトルによりグループ化して計算を行い、ベクトルの後ろから順次金利負担の大きい状態から小さいもの、又は小さいものから大きいものに変更することによって順序付けし、その順序に従って計算を進めていくこと。Grouped by vectors arranged in the order of increasing or decreasing interest rates indicated by the states that each transition route includes, and calculating from the back of the vector, the interest rate burden from the largest to the smallest, or from the smallest to the largest Order by changing to, and proceed with the calculation according to the order.

従来は推移確率マトリクスで推移ルートについて総当り的に金利負担額と確率を計算すると、妥当な時間内に全計算をやりつくすことが出来ず、リスクの把握計算として使用できなかったが、本発明を使用すると、与えられた時間内に一定の金利負担額を超える又は下回る確率はなんパーセントという具合に、使用していい時間に応じて使用可能な数値が得られるので、時間が多ければ高い精度で、少なければ少ない精度で、ともかく使用可能な結果が得られることとなる。Conventionally, if the interest rate burden and probability are calculated brute-force for the transition route with the transition probability matrix, all calculations could not be exchanged within a reasonable time and could not be used as a risk comprehension calculation. If you use, you can obtain a usable number according to the time you can use, such as what percentage the probability of exceeding or falling below a certain amount of interest burden in a given time, so if there is more time, higher accuracy If it is small, a usable result can be obtained with less accuracy.

本発明で行う計算のフローを例示する。The flow of the calculation performed by this invention is illustrated.

Claims (1)

電算機で将来の金利推移は推移確率によるマルコフ推移確率マトリクスに従って推移すると考え、一定の期間内の金利負担が一定の金額以上又は以下となる確率を全推移ルートごとの確率と金利負担を求めながら行う計算処理において、各推移ルートをおのおのが含む状態が示す金利の大きいもの順に並べたベクトルによりグループ化して計算を行い、ベクトルの後ろから順次大きい状態から小さいものに,または小さいものから大きいものに変更していくことによって順序付けし、その順序に従って計算を進めていくこと。Considering that the future interest rate trend will change according to the Markov transition probability matrix by the transition probability on the computer, the probability that the interest rate burden within a certain period will be more than or less than a certain amount, while determining the probability and interest rate burden for every transition route In the calculation process to be performed, each transition route is grouped by vectors arranged in descending order of the interest rates indicated by the states included, and calculation is performed from the rear of the vector in order from the largest to the smallest, or from the smallest to the largest. Order by changing and proceed with the calculation according to the order.
JP2008136035A 2008-04-23 2008-04-23 Markov risk calculation Pending JP2009266184A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2008136035A JP2009266184A (en) 2008-04-23 2008-04-23 Markov risk calculation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2008136035A JP2009266184A (en) 2008-04-23 2008-04-23 Markov risk calculation

Publications (1)

Publication Number Publication Date
JP2009266184A true JP2009266184A (en) 2009-11-12

Family

ID=41391903

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2008136035A Pending JP2009266184A (en) 2008-04-23 2008-04-23 Markov risk calculation

Country Status (1)

Country Link
JP (1) JP2009266184A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8972331B2 (en) 2011-02-15 2015-03-03 International Business Machines Corporation Deciding an optimal action in consideration of risk
JP2016194765A (en) * 2015-03-31 2016-11-17 山▲崎▼システム・コンサルティング株式会社 Program, method, and information processing apparatus
CN106651196A (en) * 2016-12-29 2017-05-10 清华大学 Alarming method and system based on risk evaluation

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8972331B2 (en) 2011-02-15 2015-03-03 International Business Machines Corporation Deciding an optimal action in consideration of risk
US9430740B2 (en) 2011-02-15 2016-08-30 International Business Machines Corporation Deciding an optimal action in consideration of risk
JP2016194765A (en) * 2015-03-31 2016-11-17 山▲崎▼システム・コンサルティング株式会社 Program, method, and information processing apparatus
CN106651196A (en) * 2016-12-29 2017-05-10 清华大学 Alarming method and system based on risk evaluation
CN106651196B (en) * 2016-12-29 2020-08-04 清华大学 An alarm method and system based on risk assessment

Similar Documents

Publication Publication Date Title
Takeuchi et al. Mixing enthalpy of liquid phase calculated by miedema’s scheme and approximated with sub-regular solution model for assessing forming ability of amorphous and glassy alloys
Castro et al. Solvers for the high-order Riemann problem for hyperbolic balance laws
Zhang et al. Dynamics of the deterministic and stochastic SIQS epidemic model with non-linear incidence
Artalejo et al. The stochastic SEIR model before extinction: Computational approaches
Mirrahimi et al. Dynamics of sexual populations structured by a space variable and a phenotypical trait
WO2013003165A3 (en) Historical alarm analysis apparatus and method
WO2014093525A8 (en) Wearable multi-modal input device for augmented reality
MY164743A (en) Method and system for collecting and analyzing operational information from a network of components associated with a liquid energy commodity
JP2012521591A5 (en)
Lleo et al. Some historical perspectives on the bond-stock earnings yield model for crash prediction around the world
JP2009266184A (en) Markov risk calculation
Carrillo et al. Adaptive dynamics via Hamilton–Jacobi approach and entropy methods for a juvenile-adult model
Sepehri Cosmology from quantum potential in brane–anti-brane system
JP2014214566A5 (en) Excavator processing apparatus and work content determination method
Rao Population stability and momentum
Fernández et al. Static and dynamic SABR stochastic volatility models: Calibration and option pricing using GPUs
Boyarchenko et al. Exit problems in regime-switching models
Freedman et al. Mixed quantum–classical Liouville simulation of vibrational energy transfer in a model α-helix at 300 K
Brodsky et al. Two-boson truncation of Pauli–Villars-regulated Yukawa theory
Sobel An archaeological test of the “Exchange Expansion Model” of contact era change on the Northwest Coast
Tabata et al. Existence and computation of solutions to the initial value problem for the replicator equation of evolutionary game defined by the Dixit–Stiglitz–Krugman model in an urban setting: Concentration of workers motivated by disparity in real wages
BRPI0407465A (en) mathematical model for a metallurgical plant and method for optimizing the operation of a metallurgical plant using the model
Fomin et al. Computing branchwidth via efficient triangulations and blocks
Sun et al. Spatial reasoning combining topological and cardinal directional relation information.
Szalay et al. Kinetic Monte Carlo simulation of DNMR spectra