RB> A probability tree has a number of nodes and branches; along the
RB> branches one prints the probability (preferably rotated to match the
RB> branch). One also has labels for the nodes.
Here is an example of such a tree, using pstricks, from a recent paper of
mine.
\documentclass{article}
\usepackage{pst-all}
\makeatletter
\psset{xunit=10mm,yunit=10mm,arrows=->}
\psset{treemode=R,levelsep=2.75cm,treesep=1.5cm,framesep=1pt}
\def\unequal#1#2{\ncput*{$\neq$}\tbput*{$\frac{#1}{#2}$}}
\def\equal#1#2{\ncput*{$=$}\taput*{$\frac{#1}{#2}$}}
\def\ghost#1{=#1}% Indicator of a ghost set
\def\notriple{%
\begin{pspicture}(-6pt,-6pt)(6pt,6pt)%
\rput(0,0){$\emptyset$}
\end{pspicture}}
\def\firstchar#1{\@firstchar #1\@END}
\def\@firstchar #1#2\@END{#1}
\def\lastchars#1{\@lastchar #1\@END}
\def\@lastchar#1#2\@END{#2}
\makeatother
\def\labeledmonad#1#2#3{%
\begin{pspicture}(-0.25pt,-2pt)(0.25pt,6.25pt)%
\psset{linestyle=solid}
\if-\firstchar{#3}% Deficit set
\ovalnode[fillstyle=solid,fillcolor=lightgray]%
{#1}{\scriptsize $#3$}\hspace{2pt} #2%
\else\if=\firstchar{#3}% It's a ghost set
\circlenode[linecolor=gray]%
{#1}{\gray\scriptsize $\lastchars#3$}%
\hspace{2pt} #2%
\else%
\circlenode{#1}{\scriptsize $#3$}\hspace{2pt} #2%
\fi\fi%
\end{pspicture}}
\def\monad#1#2{\labeledmonad{#1}{}{#2}}
\def\labeleddyad#1#2#3#4#5{%
\begin{pspicture}(-0.5,-0.8)(0.5,0.8)%
\rput(-0.25,-0.5){\monad{#1a}{#3}}%
\uput{8pt}[180](-0.25,-0.5){#2}%
\rput(0.25,0.5){\monad{#1b}{#5}}%
\uput{8pt}[180](0.25,0.5){#4}%
\ncline{-}{#1a}{#1b}%
\end{pspicture}}
\def\dyad#1#2#3{\labeleddyad{#1}{}{#2}{}{#3}}
\begin{document}
\pstree{\Tr{\dyad{A}{m}{2m}\dyad{B}{m}{2m}}%
\ncline[linestyle=dashed]{-}{Aa}{Ba}}%
{\pstree{\Tr{\dyad{C}{2m}{2m}\monad{D}{2m}}\equal{1}{3}
\ncline{-}{Cb}{D}
\ncline[linestyle=dashed]{-}{Ca}{D}}%
{\Tr{\dyad{E}{2m}{4m}}\equal{1}{2}%
\Tr{\notriple}\unequal{1}{2}}
\pstree{\Tr{\dyad{F}{m}{2m}\dyad{G}{m}{2m}}\unequal{2}{3}
\ncline{-}{Fa}{Ga}
\ncline[linestyle=dashed]{-}{Fa}{Gb}}
{\pstree{\Tr{\dyad{H}{2m}{3m}\monad{I}{m}}\equal{1}{2}
\ncline{-}{Hb}{I}
\ncline[linestyle=dashed]{-}{Ha}{I}}
{\Tr{\dyad{J}{3m}{3m}}\equal{1}{2}
\Tr{\dyad{K}{m}{2m}}\unequal{1}{2}}
\pstree{\Tr{\dyad{L}{m}{2m}\dyad{M}{m}{2m}}\unequal{1}{2}
\ncline{-}{La}{Ma}
\ncline{-}{La}{Mb}
\ncline[linestyle=dashed]{-}{Lb}{Mb}}
{\Tr{\monad{N}{3m}}\equal{1}{2}
\Tr{\dyad{O}{m}{2m}}\unequal{1}{2}}}}
\end{document}
--
Professor Edward M. Reingold Email: ***@iit.edu
Department of Computer Science Voice: (312) 567-3309
Illinois Institute of Technology Assistant: (312) 567-5152
Stuart Building Fax: (312) 567-5067
10 West 31st Street, Suite 236
Chicago, IL 60616-3729 U.S.A.