Skip to content

Commit d2672de

Browse files
committed
P3 and latex compiler test
1 parent 1fdf772 commit d2672de

File tree

2 files changed

+130
-1
lines changed

2 files changed

+130
-1
lines changed

.gitignore

Lines changed: 43 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,44 @@
1+
## --- MacOS ---
2+
3+
# Ignore DS_Store files
14
.DS_Store
2-
.vscode
5+
**/.DS_Store
6+
7+
## --- Latex ---
8+
9+
# LaTeX build files
10+
*.aux
11+
*.log
12+
*.out
13+
*.toc
14+
15+
# LaTeX intermediate files
16+
*.bbl
17+
*.blg
18+
*.synctex.gz
19+
20+
# LaTeX editor files
21+
*.synctex(busy)
22+
*.synctex.gz(busy)
23+
*.fdb_latexmk
24+
*.fls
25+
26+
## --- Jupyter ---
27+
28+
# Jupyter notebook checkpoints
29+
**/.ipynb_checkpoints/
30+
31+
## --- python ---
32+
33+
# Python cache files
34+
__pycache__/
35+
*.pyc
36+
37+
# Python environment files
38+
venv/
39+
40+
## --- MS Office ---
41+
~$*
42+
43+
## --- vscode ---
44+
.vscode/

ProblemSets_PartI/Math227C_P3.tex

Lines changed: 87 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,87 @@
1+
\documentclass[12pt,letterpaper]{article}
2+
\usepackage{amsmath,amsthm,amsfonts,amssymb,amscd}
3+
\usepackage{fullpage}
4+
\usepackage{lastpage}
5+
\usepackage{enumerate}
6+
\usepackage{fancyhdr}
7+
\usepackage{mathrsfs}
8+
\usepackage[margin=3cm,bottom=6cm]{geometry}
9+
\usepackage{wrapfig}
10+
\usepackage{graphicx}
11+
12+
\setlength{\parindent}{0.0in}
13+
\setlength{\parskip}{0.05in}
14+
15+
\renewcommand{\theenumi}{\bf\Alph{enumi}}
16+
17+
% Edit these as appropriate
18+
\newcommand\course{Math 227C}
19+
\newcommand\hwnum{2} % <-- homework number
20+
\newcommand\yourname{Jun Allard} % <-- your name
21+
%\newcommand\login{jcarberr} % <-- your CS login
22+
23+
\newenvironment{answer}[1]{
24+
\subsubsection*{Problem Set 3}
25+
}{\newpage}
26+
27+
\pagestyle{fancyplain}
28+
\headheight 35pt
29+
\lhead{ \course\ }
30+
\chead{\textbf{ Problem Set 3}}
31+
%\rhead{Due {\bf Friday, April 27th}}
32+
\headsep 20pt
33+
34+
\begin{document}
35+
36+
37+
\begin{enumerate}
38+
39+
%%%%%%%%%%%%%% PROBLEM %%%%%%%%%%%%%%%%%%
40+
\item
41+
42+
Suppose a biologist possesses $4$ umbrellas which he employs in going from his home to his lab and vice versa.
43+
If he is at home (lab) at the beginning (end) of his day and it is raining, then he will take an umbrella with him to the lab (home), provided there is one to be taken.
44+
If it is not raining, then he never takes an umbrella.
45+
Assume that, independent of the past, it rains at the beginning (end) of a day with probability $p=0.1$.
46+
47+
The biologist currently has 2 umbrellas at home and 2 at the lab.
48+
How long, on average, until he gets wet?
49+
50+
\vspace{3em}
51+
52+
Hint preamble: I suggest you think and discuss how you would approach this problem before looking at the hint. What are the states of the Markov chain you would define?
53+
54+
Hint: Define a Markov chain with $6$ states, where state $i$ is having $i-1$ umbrellas with him (i.e., it is the number of umbrellas at home if he is at home, and the number in the lab if he is at the lab). The sixth state is the one in which he had zero umbrellas with him, and it rained, and therefore he gets wet. Write down the Markov transition matrix for this Markov chain.
55+
56+
Bonus question: What is the value of $p$ (probability of rain on a given trip) that maximizes the time to get wet?
57+
58+
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
59+
60+
\vspace{3em}
61+
62+
63+
%%%%%%%%%%%%%% PROBLEM %%%%%%%%%%%%%%%%%%
64+
\item % HISTONE
65+
66+
A nucleosome is a structure in the nucleus in which DNA wraps around a histone.
67+
For simplicity, in this problem, we will assume that the wrapping DNA has 5 contact points that must form sequentially.
68+
Therefore, a histone can be in one of 6 states (5 wrapping states, plus the unwrapped state), and will stochastically transition from state $i$ to either state $i+1$ or state $i-1$ with probability $\mathbb{P}=0.5$.
69+
If it is completely unwrapped, it will transition to the first wrapping state with probability $\mathbb{P}=1$.
70+
71+
\begin{enumerate}[i.]
72+
\item Write down the transition matrix for this Markov chain.
73+
\item What is the expected number of steps until the histone reaches the wrapped state, given that it starts in the unwrapped state?
74+
\item If another DNA-binding molecule, like a transcription factor, binds the DNA at site $i$, then it will reduce the probability of the histone wrapping to that site.
75+
Suppose there is a transcription factor bound to site $3$, reducing transitions to state $3$ to be $\mathbb{P}=0.25$.
76+
Now, what is the expected number of steps until the histone reaches the wrapped state, given that it starts in the unwrapped state?
77+
\item \textbf{[OUT OF CLASS]} What affects the mean time to wrapping more, a transcription factor bound to site $1$ or site $4$?
78+
\end{enumerate}
79+
80+
The phenomenon of transcription factors interfering with histone wrapping has significant biological consequences [Kim, Hoffmann, Enciso, et al., \textit{Cell Reports} 2022].
81+
82+
\end{enumerate} % multi-problem homework
83+
84+
\end{document}
85+
86+
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
87+

0 commit comments

Comments
 (0)