| To: | <s-news@lists.biostat.wustl.edu> |
|---|---|
| Subject: | Simulation of a Network |
| From: | "Paul Lasky" <phlasky@earthlink.net> |
| Date: | Fri, 30 Jun 2006 07:46:10 -0700 |
| Domainkey-signature: | a=rsa-sha1; q=dns; c=nofws; s=dk20050327; d=earthlink.net; b=KeWXonHC+KVwFCOZH2E/uf9AU+eRXM3UhXfTMCNqa5bfyJg3aoSjt13pWY9s5Id8; h=Received:From:To:Subject:Date:MIME-Version:Content-Type:X-Mailer:X-MimeOLE:Thread-Index:Message-ID:X-ELNK-Trace:X-Originating-IP; |
| Thread-index: | AcacU+1OyUksonFdSPi66q9yQHdOxw== |
|
I have a
complicated network ( there are 165 allowed different paths through the network)
with each node containing a binomial distributed outcome, with an associated
score. I wish to find the PDF or CDF of the score.
What is the best way
with S-Plus, 6.1 or 7.0 to accomplish this task ? The thought
of coding the network with a series of if - else statements is
frightening.
Paul H.
Lasky
P & B
Investments
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: bootstrapping of multiple datasets, Tim Hesterberg |
|---|---|
| Next by Date: | practical ergodicity, Kamil Toth |
| Previous by Thread: | Data manipulation and big data problem, Chen,Sichong |
| Next by Thread: | practical ergodicity, Kamil Toth |
| Indexes: | [Date] [Thread] [Top] [All Lists] |