RUSSIAN ROULETTE AND PARTICLE SPLITTING



Similar documents
Classic Problems at a Glance using the TVM Solver

CHAPTER 2. Time Value of Money 6-1

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1

6.7 Network analysis Introduction. References - Network analysis. Topological analysis

Average Price Ratios

SHAPIRO-WILK TEST FOR NORMALITY WITH KNOWN MEAN

The analysis of annuities relies on the formula for geometric sums: r k = rn+1 1 r 1. (2.1) k=0

Preprocess a planar map S. Given a query point p, report the face of S containing p. Goal: O(n)-size data structure that enables O(log n) query time.

Numerical Methods with MS Excel

APPENDIX III THE ENVELOPE PROPERTY

Statistical Pattern Recognition (CE-725) Department of Computer Engineering Sharif University of Technology

ANOVA Notes Page 1. Analysis of Variance for a One-Way Classification of Data

Chapter Eight. f : R R

10.5 Future Value and Present Value of a General Annuity Due

Chapter 3. AMORTIZATION OF LOAN. SINKING FUNDS R =

IDENTIFICATION OF THE DYNAMICS OF THE GOOGLE S RANKING ALGORITHM. A. Khaki Sedigh, Mehdi Roudaki

Numerical Comparisons of Quality Control Charts for Variables

The Gompertz-Makeham distribution. Fredrik Norström. Supervisor: Yuri Belyaev

ECONOMIC CHOICE OF OPTIMUM FEEDER CABLE CONSIDERING RISK ANALYSIS. University of Brasilia (UnB) and The Brazilian Regulatory Agency (ANEEL), Brazil

The Time Value of Money

Banking (Early Repayment of Housing Loans) Order,

Settlement Prediction by Spatial-temporal Random Process

Efficient Traceback of DoS Attacks using Small Worlds in MANET

Reinsurance and the distribution of term insurance claims

ADAPTATION OF SHAPIRO-WILK TEST TO THE CASE OF KNOWN MEAN

Mathematics of Finance

1. The Time Value of Money

ISyE 512 Chapter 7. Control Charts for Attributes. Instructor: Prof. Kaibo Liu. Department of Industrial and Systems Engineering UW-Madison

Dynamic Two-phase Truncated Rayleigh Model for Release Date Prediction of Software

Simple Linear Regression

How To Make A Supply Chain System Work

T = 1/freq, T = 2/freq, T = i/freq, T = n (number of cash flows = freq n) are :

A New Bayesian Network Method for Computing Bottom Event's Structural Importance Degree using Jointree

Chapter = 3000 ( ( 1 ) Present Value of an Annuity. Section 4 Present Value of an Annuity; Amortization

On Error Detection with Block Codes

Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT), January Edition, 2011

Elementary Theory of Russian Roulette

Abraham Zaks. Technion I.I.T. Haifa ISRAEL. and. University of Haifa, Haifa ISRAEL. Abstract

CIS603 - Artificial Intelligence. Logistic regression. (some material adopted from notes by M. Hauskrecht) CIS603 - AI. Supervised learning

10/19/2011. Financial Mathematics. Lecture 24 Annuities. Ana NoraEvans 403 Kerchof

FINANCIAL MATHEMATICS 12 MARCH 2014

MODELLING OF STOCK PRICES BY THE MARKOV CHAIN MONTE CARLO METHOD

Integrating Production Scheduling and Maintenance: Practical Implications

Load Balancing Algorithm based Virtual Machine Dynamic Migration Scheme for Datacenter Application with Optical Networks

ANALYTICAL MODEL FOR TCP FILE TRANSFERS OVER UMTS. Janne Peisa Ericsson Research Jorvas, Finland. Michael Meyer Ericsson Research, Germany

Fault Tree Analysis of Software Reliability Allocation

ANNEX 77 FINANCE MANAGEMENT. (Working material) Chief Actuary Prof. Gaida Pettere BTA INSURANCE COMPANY SE

Impact of Interference on the GPRS Multislot Link Level Performance

Credibility Premium Calculation in Motor Third-Party Liability Insurance

A particle swarm optimization to vehicle routing problem with fuzzy demands

AP Statistics 2006 Free-Response Questions Form B

Regression Analysis. 1. Introduction

A DISTRIBUTED REPUTATION BROKER FRAMEWORK FOR WEB SERVICE APPLICATIONS

of the relationship between time and the value of money.

A Study of Unrelated Parallel-Machine Scheduling with Deteriorating Maintenance Activities to Minimize the Total Completion Time

Proceedings of the 2010 Winter Simulation Conference B. Johansson, S. Jain, J. Montoya-Torres, J. Hugan, and E. Yücesan, eds.

Bayesian Network Representation

Three Dimensional Interpolation of Video Signals

Best of security and convenience

MDM 4U PRACTICE EXAMINATION

Real-Time Scheduling Models: an Experimental Approach

Report 52 Fixed Maturity EUR Industrial Bond Funds

Discrete-Event Simulation of Network Systems Using Distributed Object Computing

Optimal replacement and overhaul decisions with imperfect maintenance and warranty contracts

Efficient Compensation for Regulatory Takings. and Oregon s Measure 37

Contention-Free Periodic Message Scheduler Medium Access Control in Wireless Sensor / Actuator Networks

Optimal Packetization Interval for VoIP Applications Over IEEE Networks

Capacitated Production Planning and Inventory Control when Demand is Unpredictable for Most Items: The No B/C Strategy

Speeding up k-means Clustering by Bootstrap Averaging

Sequences and Series

Performance Attribution. Methodology Overview

Green Master based on MapReduce Cluster

n. We know that the sum of squares of p independent standard normal variables has a chi square distribution with p degrees of freedom.

Loss Distribution Generation in Credit Portfolio Modeling

Dynamic Provisioning Modeling for Virtualized Multi-tier Applications in Cloud Data Center

Session 4: Descriptive statistics and exporting Stata results

A Parallel Transmission Remote Backup System

Statistical Techniques for Sampling and Monitoring Natural Resources

Maintenance Scheduling of Distribution System with Optimal Economy and Reliability

ROULETTE-TOURNAMENT SELECTION FOR SHRIMP DIET FORMULATION PROBLEM

On formula to compute primes and the n th prime

One way to organize workers that lies between traditional assembly lines, where workers are specialists,

Crosstalk Mitigation in DMT VDSL with Impulse Noise *

Approximation Algorithms for Scheduling with Rejection on Two Unrelated Parallel Machines

The paper presents Constant Rebalanced Portfolio first introduced by Thomas

CHAPTER 13. Simple Linear Regression LEARNING OBJECTIVES. USING Sunflowers Apparel

An Operating Precision Analysis Method Considering Multiple Error Sources of Serial Robots

Fractal-Structured Karatsuba`s Algorithm for Binary Field Multiplication: FK

Statistical Intrusion Detector with Instance-Based Learning

Transcription:

RUSSAN ROULETTE AND PARTCLE SPLTTNG M. Ragheb 3/7/203 NTRODUCTON To stuatos are ecoutered partcle trasport smulatos:. a multplyg medum, a partcle such as a eutro a cosmc ray partcle or a photo may geerate a large umber of secodary partcles. 2. The folloed partcle remas th the cosdered rego thout escape, leadg to a excessvely log scatterg cha. ether case a method for termatg the partcle chas s eeded, hle matag the process ubased s eeded. Russa Roulette ad partcle splttg are to complemetary mportace-samplg methods hch ca acheve that goal. RUSSAN ROULETTE the sprt of Tolsto s War ad Peace, the Russa Roulette game s played amog people ho have cosumed a substatal amout of sprts, hstorcally vodka, ad are the ufortuate possesso of a sx-shooter. To dsplay ther courage the royal salos stead of o the battle-feld, or maybe to sho ther dsda for lfe, a sgle bullet s loaded to the gu, the barrel flpped, more drks are cosumed to completely loose touch th realty, the the players take turs amg the gu at ther temples ad pressg the trgger. At each tral, the probablty of the perso pullg the trgger provg hs stupdty beyod a reasoable doubt ad thus deservg to shorte hs lfe ad promptly meetg hs creator s /6. He eeds to repeat hs brave feat for oly sx tmes to face a probablty of oe of blog off hs bra ad rug the expesve carpet uder hs feet. Luckly Mote Carlo ths game s appled to fcttous partcles partcle trasport smulatos. Cosder a partcle hose statstcal eght s:. The Russa Roulette radom varable ca be descrbed as: p ( p) kll partcle keep partcle e = 0 e ( p) ()

That s, th probablty p, the partcle s klled ad th probablty (-p), the partcle survves, but ts statstcal eght s adjusted to the e value: e ( p) (2) The mportat cosderato s that the expected eght of the partcle s preserved at the same that t had before the collso. fact the expected value of the statstcal eght s: E ( e) = p.0 + ( p).. ( p ) (3) As a example, let us cosder a choce of the kll probablty as: p=0.5, hch klls the partcles 50 percet of the tme, ad lets them survve 50 percet of the tme. The partcles that are klled are elmated from the smulato ad e source partcles are sampled. Those that survve ll o be assged a statstcal eght gve by Eq, 2 as: e = 2 ( 0.5) (4) That s the survvg partcles ll have ther statstcal eght doubled. aother case f e choose: p=0.9, partcles ll be klled 90 percet of the tme hle those survvg the process ll be assged a e eght gve by: e = 0 ( 0.9) (5) The process s repeated th dfferet values of the kll probablty p utl the umber of partcles s reduced to a maageable sze. t may eve be ecessary to use t some smulatos to ed up the geerated otherse fte chas. Thus t provdes a

coveet ay to termate partcle hstores, hle preservg ther orgal statstcal eght. PARTCLE SPLTTNG Coversely to the Russa Roulette techque, the sample sze ca be creased, hle avodg a bas by usg the Splttg method hch. Cosder a partcle of statstcal eght:. t ca be splt to ay umber of e detcal partcles each th statstcal eght such that: =, =,2,..., (6) The expected value of the e partcles eghts s ther sum: E( ) = E ( + +... ) = =. 2 (7) hch preserves the tally splt partcle statstcal eght. By such a eghtg method, oe cotrols the total umber of tracks, ad the relatve umbers of tracks varous regos of phase space, hch s equvalet to a form of mportace Samplg. deally, the umber of paths ould be proportoal to ther cotrbuto to the fal result, th avodace of those paths that do ot cotrbute to the sought aser the sprt of ay ell thought mportace Samplg method. COUPLED RUSSAN ROULETTE AND PARTCLE SPLTTNG Whe Russa Roulette ad Partcle Splttg are combed, partcles ll ted to have early equal eghts, hch s advatageous reducg the varace the computed quatty of terest. Cosder a medum subdvded to boudares: r, r,..., r,... r 2 each of them assged a mportace:

,,...,,..., 2 as sho Fg.. Fgure. Regos assgmet of the mportace values. Whe a partcle eters a e rego (+) from rego, e defe the relatve mportace of the regos as: = (8) + ν s calculated. f the e rego that s etered has greater mportace tha the prevous oe: + ν = > the partcle s splt to ν detcal partcles, each carryg a statstcal eght: e (9) ν f o the other had:

= <, + ν ' Russa Roulette s played, th the partcle klled th a probablty: pkll = ν ' (0) The partcle survves th a probablty: psurvval = ν ' () The survvg partcle s kept the smulato th a e statstcal eght: e = p survval. ν ' (2) f the regos have equal mportace: = =, + ν " ether Russa Roulette or Splttg are played. Notce that lke the case of Russa Roulette, the expected value of the statstcal eght for the partcle s preserved: E ( ).. p + 0. p ν '.. ν ' + 0.( ν ') ν ' e survval kll (3) As a example of the applcato of the methodology, f the relatve mportace of a rego relatve to the prevous rego s: = = 2>, ν + the comg partcle s splt to: ν = 2 partcles,

each carryg a statstcal eght: e 2 e. 2. 2 f the relatve mportace of a rego s less tha the prevous rego: = = <, + ν ' 0.5 Russa Roulette s appled ad the partcle s klled th a probablty: the survval probablty beg: The survvg partcle eght s: EXERCSE p = 0.5 = 0.5, kll p survval = 0.5. = 2 0.5 e. For the example o the applcato of the combed Russa Roulette ad Partcle Splttg techques, prove that the expected value of the partcle statstcal eght s preserved.