Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Julia 1.0 Programming Cookbook

You're reading from   Julia 1.0 Programming Cookbook Over 100 numerical and distributed computing recipes for your daily data science work?ow

Arrow left icon
Product type Paperback
Published in Nov 2018
Publisher Packt
ISBN-13 9781788998369
Length 460 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Authors (2):
Arrow left icon
Przemysław Szufel Przemysław Szufel
Author Profile Icon Przemysław Szufel
Przemysław Szufel
Bogumił Kamiński Bogumił Kamiński
Author Profile Icon Bogumił Kamiński
Bogumił Kamiński
Arrow right icon
View More author details
Toc

Table of Contents (12) Chapters Close

Preface 1. Installing and Setting Up Julia 2. Data Structures and Algorithms FREE CHAPTER 3. Data Engineering in Julia 4. Numerical Computing with Julia 5. Variables, Types, and Functions 6. Metaprogramming and Advanced Typing 7. Handling Analytical Data 8. Julia Workflow 9. Data Science 10. Distributed Computing 11. Other Books You May Enjoy

Running Monte Carlo simulations


The Monte Carlo simulation (see the example, http://news.mit.edu/2010/exp-monte-carlo-0517 or https://en.wikipedia.org/wiki/Monte_Carlo_method) is one of the elementary computational techniques. In this recipe, we will explain how it can be implemented efficiently in Julia.

Getting ready

Consider the following problem. Assume that on each day, a random volume of water leaks from a pipe to a container. The amount of water that leaks out is greater than zero, but less than one. How many days do we need to wait till a container having a volume equal to one is filled, if on each day the amount of water that leaks is a uniformly random value between zero and one?

Formally, we repeatedly draw independent random numbers from a uniform distribution on the 

interval. How many draws, on average, are required until the sum of drawn numbers is greater than or equal to 1? Let

 be a sequence of independent random variables. We want to find the following:

We will approximate...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image