Note | Black-Scholes Formula

$$ C(S_t,t) = N(d_+) S_t - N(d_{-})Ke^{-r(T-t)} $$ Where N is the c.d.f of the normal distribution. B.S. formula services as an accurate mathmatical model to price the option, and enbale the people to hedge the risk against almost any underlying assets. The Greeks for Black–Scholes are given in closed form below. They can be obtained by differentiation of the Black–Scholes formula. Great Introduction: ...

September 16, 2024 · 1 min · 68 words · Wenbo

Note | Quick Notes on SQL

Concept What is a database? A structured set of computerized data with accessible interface SQL: Structure Query Language (SQL), A standard language used in all relational database management system Install the database Two components: MySQL SQL workbench Add the mysql to the environment variable open ~/.zshrc ## add the mysql bin ## no spaces around the = export PATH=${PATH}:/usr/local/mysql/bin ## The save the file source ./zshrc Hierachy: Server -> Multiple database -> Multiple sheets Basic Select, Create, Delete ...

June 26, 2023 · 14 min · 2817 words · Wenbo

Note | Common Terminologies in Graph Thoery

Common Terminologies in Graph Thoery Define an undirected graph with the natrual order as $G = (V,E,\sigma)$ where $V$ is the set of the vertices, $E$ is the set of edges and $\sigma$ is the natrual ordering. Chordal graph A chordal is a path of undirected graph between two non-conescutive vertices. (“shortcut”" between two vertices") A chordal graph referes to every cycle of length four or greater of a simple graph has a chord. (triangulated graph) Chordal Completion ...

June 1, 2023 · 3 min · 473 words · Wenbo

Note | Clique seperator

Clique seperator Decomposition by clique seperator (Tarjan, 1985) Main Idea: Based on the idea of ‘divide and conquer’, this paper proposed an graph decomposition algorithm by finding the clique seperator recursively. The decomposition results in a binary decomposition tree. The author suggested some general ideas to tackle 4 NP-hard problems by ultlizing the binary decomposition tree. Preliminaries Perfect elimination ordering, Clique, Minimal and Minimum ordering, Seperator Algorithms Text description ...

June 1, 2023 · 1 min · 156 words · Wenbo

Note | Reverse Cuthill-McKee Algorithm

Overview Revisitting the sparse matrix technology. ...

April 24, 2023 · 3 min · 553 words · Wenbo

Note | Monte Carlo Tree Search Summary

Monte Carlo Tree Search Summary...

January 11, 2023 · 3 min · 601 words · Wenbo

Note | Reinforcement Learning Algorithms Summary

Reinforcement Learning Algorithms Summary...

July 8, 2021 · 7 min · 1413 words · Wenbo

Note | Markov Decision Processes

Markov Property (MP)...

June 1, 2021 · 3 min · 439 words · Wenbo

Note | Normal Equation

Overview Normal Equation is a method in parallel with gradient descent algorithm to minimize the cost function J. ...

April 1, 2021 · 2 min · 233 words · Wenbo

Note | Polynomial Regression and Feature Scaling

Linear Regression with multiple variables It is common to consider more than one features when making a prediction. For example when predicting the price of a house: ...

April 1, 2021 · 2 min · 314 words · Wenbo