A Bayesian methodology for systemic risk assessment in financial networks
|
|
- Calvin Horton
- 5 years ago
- Views:
Transcription
1 A Bayesan methodology for systemc rsk assessment n fnancal networks Lutgard A. M. Veraart London School of Economcs and Poltcal Scence September 2015 Jont work wth Axel Gandy (Imperal College London) 7th General AMaMeF and Swssquote Conference, EPFL Preprnt avalable at SSRN: Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
2 The problem Consder nterbank market as network: Nodes consst of n banks wth ndces n N = {1,..., n}. Edges L j represent nomnal nterbank lablty of bank to bank j. Stress tests: Suppose some banks default on ther labltes. How do losses spread along the edges? What f edges are not observable? A matrx L = (L j ) R n n s a labltes matrx f L j 0, L = 0, j Total nomnal nterbank labltes of bank : r (L) := m j=1 L j. Total nomnal nterbank assets of bank : c (L) := m j=1 L j. In practce, L j not fully observable, but r (L), c (L) are. How to fll n the mssng data? Implcatons for stress testng? Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
3 Man contrbutons Development of Bayesan framework (Gbbs sampler) for samplng from dstrbuton of labltes matrx condtonal on ts row and column sums. Applcaton to systemc rsk assessment: Can gve probabltes for outcomes of stress tests. Results show lmtatons of classcal approach. Show that general monotoncty arguments relatng severty of systemc rsk to number of edges do not hold n general. Code s avalable as R-package (systemcrsk) on CRAN. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
4 Admssble labltes matrx Exstence of admssble labltes matrx Theorem (Exstence of an admssble labltes matrx) Consder two vectors a, l [0, ) n satsfyng n =1 a = n =1 l. Then there exsts a matrx L [0, ) n n wth dag(l) = 0, c(l) = a, r(l) = l f and only f a n l j N. j=1 j Proof contans algorthm gvng explct constructon. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
5 The Bayesan framework The Bayesan framework Constructs adjacency matrx A = (A j ); attaches labltes L j. Model: Parameters: For, j N : A j Bernoull(p j ) L j {A j = 1} Exponental(λ j ) L j = 0 f A j = 0. p [0, 1] n n, dag(p) = 0; p j probablty of exstence of drected edge from to j, λ R n n, governs dstrbuton of weghts gven that edge exsts. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
6 The Bayesan framework The Bayesan framework Constructs adjacency matrx A = (A j ); attaches labltes L j. Model: Parameters: For, j N : A j Bernoull(p j ) L j {A j = 1} Exponental(λ j ) L j = 0 f A j = 0. p [0, 1] n n, dag(p) = 0; p j probablty of exstence of drected edge from to j, λ R n n, governs dstrbuton of weghts gven that edge exsts. Observatons: c(l) = a R n, r(l) = l R n. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
7 The Bayesan framework The Bayesan framework Constructs adjacency matrx A = (A j ); attaches labltes L j. Model: Parameters: For, j N : A j Bernoull(p j ) L j {A j = 1} Exponental(λ j ) L j = 0 f A j = 0. p [0, 1] n n, dag(p) = 0; p j probablty of exstence of drected edge from to j, λ R n n, governs dstrbuton of weghts gven that edge exsts. Observatons: c(l) = a R n, r(l) = l R n. Man nterest: Dstrbuton of h(l) a, l. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
8 The Bayesan framework Gbbs samplng for L a, l Markov Chan Monte Carlo (MCMC): Interested n samplng from a gven dstrbuton. Construct a Markov chan wth ths statonary dstrbuton. Run chan. Chan converges to statonary dstrbuton. Key dea of Gbbs sampler: a step of the chan updates one or several components of the entre parameter vector by samplng them from ther jont condtonal dstrbuton gven the remander of the parameter vector. Here parameter vector s matrx L: Intalse chan wth matrx L that satsfes r(l) = l, c(l) = a. MCMC sampler produce a sequence of matrces L 1, L 2,.... Quantty of nterest: E[h(L) l, a] 1 N N =1 h(lδ+b ), N number of samples, b burn-n perod, δ N thnnng parameter. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
9 The Bayesan framework Updatng components of L Need to decde whch elements of L need to be updated. Need to determne how the new values wll be chosen,.e., need to determne ther dstrbuton condtonal on remander of elements of L. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
10 The Bayesan framework Illustraton of updatng submatrces L 1 j 1 L 1 j 2 L 1 j 1 L 1 j 2 L 2 j 2 L 2 j 3 L 1 j 1 L 1 j 2 L 2 j 3 L 2 j 2 L 3 j 4 L 3 j 3 L 2 j 1 L 2 j 2 L 3 j 3 L 3 j 1 L 4 j 4 L 4 j 1 Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
11 The Bayesan framework Updatng - Illustraton Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
12 Applcatons to systemc rsk assessment Stress testng Balance sheets and fundamental defaults Balance sheet of bank : Assets Labltes external assets a (e) external labltes l (e) nterbank assets a := c (L) nterbank labltes l := r (L) net worth w := w (L, a (e), l (e) ) w := w (L, a (e), l (e) ) := a (e) + c (L) l (e) r (L). Stress tests: apply proportonal shock s [0, 1] n to external assets; shocked external assets are s a (e). Fundamental defaults: { w (L, s a (e), l (e) ) < 0} Fundamental defaults can be checked from balance sheet aggregates wthout needng to know the whole matrx L! To check for contagous defaults we need to know L. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
13 Applcatons to systemc rsk assessment Emprcal example Emprcal example - data Balance sheet data (n mllon Euros) from banks n the EBA 2011 stress test: Bank code Bank a (e) + a a w DE017 DEUTSCHE BANK AG 1,905,630 47,102 30,361 DE018 COMMERZBANK AG 771,201 49,871 26,728 DE019 LANDESBANK BADEN-WURTTEMBERG 374,413 91,201 9,838 DE020 DZ BANK AG 323, ,099 7,299 DE021 BAYERISCHE LANDESBANK 316,354 66,535 11,501 DE022 NORDDEUTSCHE LANDESBANK -GZ- 228,586 54,921 3,974 DE023 HYPO REAL ESTATE HOLDING AG 328,119 7,956 5,539 DE024 WESTLB AG, DUSSELDORF 191,523 24,007 4,218 DE025 HSH NORDBANK AG, HAMBURG 150,930 4,645 4,434 DE027 LANDESBANK BERLIN AG 133,861 27,707 5,162 DE028 DEKABANK DEUTSCHE GIROZENTRALE 130,304 30,937 3,359 Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
14 Applcatons to systemc rsk assessment Emprcal example Stress testng We apply a determnstc shock to external assets of all 11 banks n the network by consderng the shocked external assets s a (e) wth s = 0.97 N. Shock causes fundamental default of 4 banks: DE017, DE022, DE023, DE024. We apply the clearng approach by Esenberg & Noe (2001) and [Rogers & V. (2013)] to determne whch banks suffer contagous defaults. Gbbs sampler allows us to derve posteror default probabltes for remanng 7 banks. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
15 Applcatons to systemc rsk assessment Emprcal example Default probabltes of banks as a functon of p DE DE020 DE p Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
16 Applcatons to systemc rsk assessment Emprcal example Default probabltes for clearng wth default costs DE020 DE019 DE025 DE028 DE021 DE027 DE p Lutgard A. M. Veraart (LSE) (a) AClearng Bayesan approach wth α to= systemc 1, β = rsk0.7 September / 17
17 Applcatons to systemc rsk assessment Emprcal example Mean out-degree of banks,.e., E[ j A j a, l], for dfferent p ER n the Erdős-Rény network l DE DE DE DE DE DE DE DE DE DE DE Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
18 Summary Summary Development of Bayesan framework (Gbbs sampler) for samplng from dstrbuton of labltes matrx condtonal on ts row and column sums. Can be used for stress tests usng emprcal data. Can be used as a smulaton tool to analyse heterogeneous networks. Can ncorporate addtonal nformaton such as expert vews etc. on the network structure. R package (systemcrsk) avalable from CRAN. Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
19 Summary References I Esenberg, L. & Noe, T. H. (2001). Systemc rsk n fnancal systems. Management Scence 47, Gandy, A. & Veraart, L. A. M. (2015). A Bayesan methodology for systemc rsk assessment n fnancal networks. Avalable at SSRN: Rogers, L. C. G. & Veraart, L. A. M. (2013). Falure and rescue n an nterbank network. Management Scence 59, Lutgard A. M. Veraart (LSE) A Bayesan approach to systemc rsk September / 17
A Bayesian methodology for systemic risk assessment in financial networks
A Bayesian methodology for systemic risk assessment in financial networks Luitgard A. M. Veraart London School of Economics and Political Science March 2015 Joint work with Axel Gandy (Imperial College
More informationA Bayesian methodology for systemic risk assessment in financial networks
A Bayesian methodology for systemic risk assessment in financial networks Axel Gandy Imperial College London 9/12/2015 Joint work with Luitgard Veraart (London School of Economics) LUH-Kolloquium Versicherungs-
More informationHopfield networks and Boltzmann machines. Geoffrey Hinton et al. Presented by Tambet Matiisen
Hopfeld networks and Boltzmann machnes Geoffrey Hnton et al. Presented by Tambet Matsen 18.11.2014 Hopfeld network Bnary unts Symmetrcal connectons http://www.nnwj.de/hopfeld-net.html Energy functon The
More informationStat 543 Exam 2 Spring 2016
Stat 543 Exam 2 Sprng 2016 I have nether gven nor receved unauthorzed assstance on ths exam. Name Sgned Date Name Prnted Ths Exam conssts of 11 questons. Do at least 10 of the 11 parts of the man exam.
More informationStat 543 Exam 2 Spring 2016
Stat 543 Exam 2 Sprng 206 I have nether gven nor receved unauthorzed assstance on ths exam. Name Sgned Date Name Prnted Ths Exam conssts of questons. Do at least 0 of the parts of the man exam. I wll score
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationArtificial Intelligence Bayesian Networks
Artfcal Intellgence Bayesan Networks Adapted from sldes by Tm Fnn and Mare desjardns. Some materal borrowed from Lse Getoor. 1 Outlne Bayesan networks Network structure Condtonal probablty tables Condtonal
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationGaussian Mixture Models
Lab Gaussan Mxture Models Lab Objectve: Understand the formulaton of Gaussan Mxture Models (GMMs) and how to estmate GMM parameters. You ve already seen GMMs as the observaton dstrbuton n certan contnuous
More informationInternational Journal of Engineering Research and Modern Education (IJERME) Impact Factor: 7.018, ISSN (Online): (
CONSTRUCTION AND SELECTION OF CHAIN SAMPLING PLAN WITH ZERO INFLATED POISSON DISTRIBUTION A. Palansamy* & M. Latha** * Research Scholar, Department of Statstcs, Government Arts College, Udumalpet, Tamlnadu
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationOutline for today. Markov chain Monte Carlo. Example: spatial statistics (Christensen and Waagepetersen 2001)
Markov chan Monte Carlo Rasmus Waagepetersen Department of Mathematcs Aalborg Unversty Denmark November, / Outlne for today MCMC / Condtonal smulaton for hgh-dmensonal U: Markov chan Monte Carlo Consder
More informationInformation Geometry of Gibbs Sampler
Informaton Geometry of Gbbs Sampler Kazuya Takabatake Neuroscence Research Insttute AIST Central 2, Umezono 1-1-1, Tsukuba JAPAN 305-8568 k.takabatake@ast.go.jp Abstract: - Ths paper shows some nformaton
More informationLecture 10: May 6, 2013
TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationTarget tracking example Filtering: Xt. (main interest) Smoothing: X1: t. (also given with SIS)
Target trackng example Flterng: Xt Y1: t (man nterest) Smoothng: X1: t Y1: t (also gven wth SIS) However as we have seen, the estmate of ths dstrbuton breaks down when t gets large due to the weghts becomng
More informationOther NN Models. Reinforcement learning (RL) Probabilistic neural networks
Other NN Models Renforcement learnng (RL) Probablstc neural networks Support vector machne (SVM) Renforcement learnng g( (RL) Basc deas: Supervsed dlearnng: (delta rule, BP) Samples (x, f(x)) to learn
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationTesting for seasonal unit roots in heterogeneous panels
Testng for seasonal unt roots n heterogeneous panels Jesus Otero * Facultad de Economía Unversdad del Rosaro, Colomba Jeremy Smth Department of Economcs Unversty of arwck Monca Gulett Aston Busness School
More informationDynamic Programming. Lecture 13 (5/31/2017)
Dynamc Programmng Lecture 13 (5/31/2017) - A Forest Thnnng Example - Projected yeld (m3/ha) at age 20 as functon of acton taken at age 10 Age 10 Begnnng Volume Resdual Ten-year Volume volume thnned volume
More informationBayesian predictive Configural Frequency Analysis
Psychologcal Test and Assessment Modelng, Volume 54, 2012 (3), 285-292 Bayesan predctve Confgural Frequency Analyss Eduardo Gutérrez-Peña 1 Abstract Confgural Frequency Analyss s a method for cell-wse
More informationProbabilistic Graphical Models
School of Computer Scence robablstc Graphcal Models Appromate Inference: Markov Chan Monte Carlo 05 07 Erc Xng Lecture 7 March 9 04 X X 075 05 05 03 X 3 Erc Xng @ CMU 005-04 Recap of Monte Carlo Monte
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationMultiple Choice. Choose the one that best completes the statement or answers the question.
ECON 56 Homework Multple Choce Choose the one that best completes the statement or answers the queston ) The probablty of an event A or B (Pr(A or B)) to occur equals a Pr(A) Pr(B) b Pr(A) + Pr(B) f A
More informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationEquilibrium with Complete Markets. Instructor: Dmytro Hryshko
Equlbrum wth Complete Markets Instructor: Dmytro Hryshko 1 / 33 Readngs Ljungqvst and Sargent. Recursve Macroeconomc Theory. MIT Press. Chapter 8. 2 / 33 Equlbrum n pure exchange, nfnte horzon economes,
More informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationEngineering Risk Benefit Analysis
Engneerng Rsk Beneft Analyss.55, 2.943, 3.577, 6.938, 0.86, 3.62, 6.862, 22.82, ESD.72, ESD.72 RPRA 2. Elements of Probablty Theory George E. Apostolaks Massachusetts Insttute of Technology Sprng 2007
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationPitfalls in the use of systemic risk measures*
Ptfalls n the use of systemc rsk measures* Peter Raupach, Deutsche Bundesbank; jont work wth Gunter Löffler, Unversty of Ulm, Germany ESCB Research Cluster 3, 1st Workshop, Athens * To appear n the Journal
More informationChecking Pairwise Relationships. Lecture 19 Biostatistics 666
Checkng Parwse Relatonshps Lecture 19 Bostatstcs 666 Last Lecture: Markov Model for Multpont Analyss X X X 1 3 X M P X 1 I P X I P X 3 I P X M I 1 3 M I 1 I I 3 I M P I I P I 3 I P... 1 IBD states along
More informationHidden Markov Models
CM229S: Machne Learnng for Bonformatcs Lecture 12-05/05/2016 Hdden Markov Models Lecturer: Srram Sankararaman Scrbe: Akshay Dattatray Shnde Edted by: TBD 1 Introducton For a drected graph G we can wrte
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationA Dynamic Heterogeneous Beliefs CAPM
A Dynamc Heterogeneous Belefs CAPM Carl Charella School of Fnance and Economcs Unversty of Technology Sydney, Australa Roberto Dec Dpartmento d Matematca per le Scenze Economche e Socal Unversty of Bologna,
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationGoogle PageRank with Stochastic Matrix
Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationQuantifying Uncertainty
Partcle Flters Quantfyng Uncertanty Sa Ravela M. I. T Last Updated: Sprng 2013 1 Quantfyng Uncertanty Partcle Flters Partcle Flters Appled to Sequental flterng problems Can also be appled to smoothng problems
More information( ) ( ) ( ) ( ) STOCHASTIC SIMULATION FOR BLOCKED DATA. Monte Carlo simulation Rejection sampling Importance sampling Markov chain Monte Carlo
SOCHASIC SIMULAIO FOR BLOCKED DAA Stochastc System Analyss and Bayesan Model Updatng Monte Carlo smulaton Rejecton samplng Importance samplng Markov chan Monte Carlo Monte Carlo smulaton Introducton: If
More informationMarginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients
ECON 5 -- NOE 15 Margnal Effects n Probt Models: Interpretaton and estng hs note ntroduces you to the two types of margnal effects n probt models: margnal ndex effects, and margnal probablty effects. It
More informationContinuous Time Markov Chain
Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty
More informationDynamic Systems on Graphs
Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationSimulation and Probability Distribution
CHAPTER Probablty, Statstcs, and Relablty for Engneers and Scentsts Second Edton PROBABILIT DISTRIBUTION FOR CONTINUOUS RANDOM VARIABLES A. J. Clark School of Engneerng Department of Cvl and Envronmental
More informationEM and Structure Learning
EM and Structure Learnng Le Song Machne Learnng II: Advanced Topcs CSE 8803ML, Sprng 2012 Partally observed graphcal models Mxture Models N(μ 1, Σ 1 ) Z X N N(μ 2, Σ 2 ) 2 Gaussan mxture model Consder
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationOn complexity and randomness of Markov-chain prediction
On complexty and randomness of Markov-chan predcton Joel Ratsaby Department of Electrcal and Electroncs Engneerng Arel Unversty Arel, ISRAEL Emal: ratsaby@arelacl Abstract Let {X t : t Z} be a sequence
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationLow default modelling: a comparison of techniques based on a real Brazilian corporate portfolio
Low default modellng: a comparson of technques based on a real Brazlan corporate portfolo MSc Gulherme Fernandes and MSc Carlos Rocha Credt Scorng and Credt Control Conference XII August 2011 Analytcs
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationCSC321 Tutorial 9: Review of Boltzmann machines and simulated annealing
CSC321 Tutoral 9: Revew of Boltzmann machnes and smulated annealng (Sldes based on Lecture 16-18 and selected readngs) Yue L Emal: yuel@cs.toronto.edu Wed 11-12 March 19 Fr 10-11 March 21 Outlne Boltzmann
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationPROPERTIES I. INTRODUCTION. Finite element (FE) models are widely used to predict the dynamic characteristics of aerospace
FINITE ELEMENT MODEL UPDATING USING BAYESIAN FRAMEWORK AND MODAL PROPERTIES Tshldz Marwala 1 and Sbusso Sbs I. INTRODUCTION Fnte element (FE) models are wdely used to predct the dynamc characterstcs of
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationStatistical inference for generalized Pareto distribution based on progressive Type-II censored data with random removals
Internatonal Journal of Scentfc World, 2 1) 2014) 1-9 c Scence Publshng Corporaton www.scencepubco.com/ndex.php/ijsw do: 10.14419/jsw.v21.1780 Research Paper Statstcal nference for generalzed Pareto dstrbuton
More informationSmall Area Interval Estimation
.. Small Area Interval Estmaton Partha Lahr Jont Program n Survey Methodology Unversty of Maryland, College Park (Based on jont work wth Masayo Yoshmor, Former JPSM Vstng PhD Student and Research Fellow
More informationBayesian epistemology II: Arguments for Probabilism
Bayesan epstemology II: Arguments for Probablsm Rchard Pettgrew May 9, 2012 1 The model Represent an agent s credal state at a gven tme t by a credence functon c t : F [0, 1]. where F s the algebra of
More informationAn adaptive SMC scheme for ABC. Bayesian Computation (ABC)
An adaptve SMC scheme for Approxmate Bayesan Computaton (ABC) (ont work wth Prof. Mke West) Department of Statstcal Scence - Duke Unversty Aprl/2011 Approxmate Bayesan Computaton (ABC) Problems n whch
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationDegradation Data Analysis Using Wiener Process and MCMC Approach
Engneerng Letters 5:3 EL_5_3_0 Degradaton Data Analyss Usng Wener Process and MCMC Approach Chunpng L Hubng Hao Abstract Tradtonal relablty assessment methods are based on lfetme data. However the lfetme
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
More informationDeposit Insurance and Financial Development. Robert Cull (World Bank) Lemma W. Senbet (U. of Maryland) Marco Sorge (Stanford U.)
Depost Insurance and Fnancal Development Robert Cull (World Bank) Lemma W. Senbet (U. of Maryland) Marco Sorge (Stanford U.) 1 Motvaton Do depost nsurance programs contrbute to fnancal stablty and development?
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationTopics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions
Steven R. Dunbar Department of Mathematcs 203 Avery Hall Unversty of Nebraska-Lncoln Lncoln, NE 68588-0130 http://www.math.unl.edu Voce: 402-472-3731 Fax: 402-472-8466 Topcs n Probablty Theory and Stochastc
More informationCS 3750 Machine Learning Lecture 6. Monte Carlo methods. CS 3750 Advanced Machine Learning. Markov chain Monte Carlo
CS 3750 Machne Learnng Lectre 6 Monte Carlo methods Mlos Haskrecht mlos@cs.ptt.ed 5329 Sennott Sqare Markov chan Monte Carlo Importance samplng: samples are generated accordng to Q and every sample from
More informationCathy Walker March 5, 2010
Cathy Walker March 5, 010 Part : Problem Set 1. What s the level of measurement for the followng varables? a) SAT scores b) Number of tests or quzzes n statstcal course c) Acres of land devoted to corn
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationCS47300: Web Information Search and Management
CS47300: Web Informaton Search and Management Probablstc Retreval Models Prof. Chrs Clfton 7 September 2018 Materal adapted from course created by Dr. Luo S, now leadng Albaba research group 14 Why probabltes
More informationCourse 395: Machine Learning - Lectures
Course 395: Machne Learnng - Lectures Lecture 1-2: Concept Learnng (M. Pantc Lecture 3-4: Decson Trees & CC Intro (M. Pantc Lecture 5-6: Artfcal Neural Networks (S.Zaferou Lecture 7-8: Instance ased Learnng
More informationEnsemble Methods: Boosting
Ensemble Methods: Boostng Ncholas Ruozz Unversty of Texas at Dallas Based on the sldes of Vbhav Gogate and Rob Schapre Last Tme Varance reducton va baggng Generate new tranng data sets by samplng wth replacement
More informationCS286r Assign One. Answer Key
CS286r Assgn One Answer Key 1 Game theory 1.1 1.1.1 Let off-equlbrum strateges also be that people contnue to play n Nash equlbrum. Devatng from any Nash equlbrum s a weakly domnated strategy. That s,
More informationAn introduction to chaining, and applications to sublinear algorithms
An ntroducton to channg, and applcatons to sublnear algorthms Jelan Nelson Harvard August 28, 2015 What s ths talk about? What s ths talk about? Gven a collecton of random varables X 1, X 2,...,, we would
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More information