Talk:Percolation/Mean run density: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary Tag: Manual revert |
||
Line 10: | Line 10: | ||
:I am no longer confused. Thanksgiving, 2013. |
:I am no longer confused. Thanksgiving, 2013. |
||
==== ==== |
|||
---- |
|||
From the task description: |
|||
:Any calculation of <math>R_n / n</math> for finite <math>n</math> is subject to randomness so should be computed as the average of <math>t</math> runs, where <math>t \ge 100</math>. |
|||
In my opinion, this does not really make sense. The result depends only on the product of of <math>t</math> and of <math>n</math>. Therefore you don't need <math>t</math> at all. You actually want to show that the simulation with a small <math>n</math> deviates from the theoretical value. With a large <math>t</math> it doesn't do that anymore. |
|||
[[User:Chkas|Chkas]] ([[User talk:Chkas|talk]]) 10:41, 13 June 2023 (UTC) |
Latest revision as of 14:22, 18 June 2023
The description confuses me considerably.
"...vector of length $ n $ be $ R_n $. The following vector has $ R_{10} = 3 $"
People who have written code interpret ${10}$ as a pattern. I blindly followed their lead. --LambertDW 23:22, 26 November 2013 (UTC)
- Hi Lambert, It is hard to read your statement as the formatting may be showing rather than the formatted result? --Paddy3118 (talk) 16:55, 27 November 2013 (UTC)
- I am no longer confused. Thanksgiving, 2013.