# Partition Perms Distrib

### 2 collaborators

Uri Wilensky (Author)
Dor Abrahamson (Author)

### Tags

(This model has yet to be categorized with any tags)
Model group CCL | Visible to everyone | Changeable by group members (CCL)
Model was written in NetLogo 5.0.4 • Viewed 167 times • Downloaded 15 times • Run 0 times

## WHAT IS IT?

Partition Permutation Distribution is a model built around the idea of a partition function. This function relates between an integer, e.g., 4, and the number of different ways you can break this integer up into groups of integers, where order does not matter. For instance, 4 can be broken up in 5 ways:

(1) 4; (2) 3 + 1; (3) 2 + 2; (4) 2 + 1 + 1; and (5) 1 + 1 + 1 + 1.

Notice that in the above example, the number '1' appeared more often than the number '4.' Why is that? To address this question, this model allows you to repeatedly find partitions of a number and look at the distribution of integers in the partitions.

This model is a part of the ProbLab curriculum. The ProbLab Curriculum is currently under development at the CCL. For more information about the ProbLab Curriculum please refer to http://ccl.northwestern.edu/curriculum/ProbLab/.

## HOW IT WORKS

In this model, you choose a target-total, for instance 20, and the code randomly generates addends of the total and adds them to the running-total. These addends are represented in the view, too, as colorful lines that each are as long as the addend it represents. For instance, an addend of 13 will be 13 "patches" long ("patches" are the NetLogo square areas that make up the grid of the view). When the running-total reaches the total, there's been a 'success.' Unlike the actual partition function, this model will not return a value. Moreover, in this model, there is no explicit attempt to exhaust all the partitions. Instead, the randomized procedure keeps adding up the totals randomly. Over many such brute-force addings, a graph shape emerges, and the same shape emerges both for constant totals over many runs and for different totals. The question is why this shape emerges and what this shape means in terms of partitions. So this model uses partitions as an engaging riddle to explore the idea of distribution.

Note: The shape of the graph does not correspond to a simple distribution of all possible permutations, nor to a simple scaling up of such a distribution, such as we would expect the model to create through repetition of previously created partitions. That is, it is not the case that the model chooses randomly from the set of all possible partition permutations of some total. There are two conditions for running this model, depending on the setting of the slider 'diminishing-sample-space?' The following comment refers to the case that the switch is set to 'On.'

The model chooses a first addend out of a space of the whole total, a second addend out of the space of the remainder of the total, and so on. So, the greater addends are "over represented." For instance, for a total of '5,' there is only a single partition with a single addend - the partition "[5]" that includes only '5' as an addend, whereas there are numerous partitions that do not include '5.' So you might expect that '5' would occur very rarely as compared to, say, '1.' However, due to the rationale of the model, '5' actually occurs much more often. Involved here are some subtleties and possible confusions as to what we mean by 'often' -- what our unit of analysis is: Are we counting per addend or per total? Each time a total has been obtained and the model begins creating a new total, there is a 1-out-of-5 chance that the first addend will be '5.' Another way to think of this is that you might expect the partition [5] to occur as often as the partition [1 1 1 1 1], but actually the partition [1 1 1 1 1] occurs 1/ 3125 as often as the partition [5], because we have to get a '1' AND a '1' AND a '1' AND a '1' AND a '1,' whereas for [5], all we have to get is a '5.' Understanding these subtleties may help you develop a more nuanced understanding of statistics experiments.

## HOW TO USE IT

Switches: WAIT-AT-FULL? If it is set to 'On,' the experiment will wait briefly each time the target-total has been achieved. DIMINISHING-SAMPLE-SPACE? -- if 'On,' addends will be selected from a sample space that is the size of the remaining difference to the target-total. For example, if the running total of the current adding-up is at 16 and our target-total is 20, then the next addend will be selected from the range 1-thru-4. However, if the switch is set to 'Off,' then the range will always be the target-total, 20.

Sliders: TARGET-TOTAL -- sets the total towards which the program will be adding up the randomly generated values NUM-SUCCESSES -- sets how many times the program will sum up to the target-total you have set

Monitors: RUNNING-TOTAL -- shows how far towards the target-total the adding has gone ADDEND -- shows the current value that has just been generated and added to the running-total SUCCESSES-SO-FAR -- shows how many times the total has been reached. Once this is equal to the NUM-SUCCESSES slider value, the program stops. MEAN #ADDENDS PER TOTAL -- shows how many acceptable addends it took, on average, to fill the target-total that you set, over all the trials PREVIOUS LIST OF INCLUDED ADDENDS -- shows the last completed series of addends up to the target total

Buttons: SETUP -- initialize variables GO -- run the model under your chosen settings. It will run through as many 'num-successes' as you have set. ADD-ONCE -- A single addend is added to the running-total and the histogram is updated. Use this to run the program step by step.

Plots: ADDENDS -- plots the addends as they are randomly selected #ADDENDS PER TOTAL -- plots the number of addends it takes to complete each target-total

## THINGS TO NOTICE

When 'diminishing-sample-space?' is set to 'Off,' the addends get smaller as you get closer to the total.

The histogram columns get smaller as you move from left to right.

When 'diminishing-sample-space?' is set to 'Off,' the 'mean addends per total' value converges to the value of 'target-total.' Why is this so? Also, the 'Addends Per Total' distribution slopes down to the right. What can you say of that?

When 'diminishing-sample-space?' is set to 'On,' the 'mean addends per total' value converges to some value. Can you say anything about this value in relation to other settings in the model? Also, the 'Addends Per Total' distribution is normal. Why is that?

## THINGS TO TRY

Set the target-total to .5. Run the model over many num-successes, 'diminishing-sample-space?' set to 'On,' and with a high target-total. The 2-column will be 1/2 the height of the 1-column. The 3-column will be 1/3 the height of the 1-column. The 4-column will be 1/4 the height of the 1-column. The 5-column will be 1/5 the height of the 1-column. etc. So we get a '1/n' function. Why is this? Does is work for other target-total values?

Another way to express this relation between the columns is as follows. Say we look at Column 'i.' The relation between the height of Column i and the column immediately to its left (Column 'i - 1') is (i - 1) / i . For instance, the relation between the heights of Column 9 and Column 8 is that Column 9 is 8/9 as tall as Column 8.

Set target-total to 2 and 'diminishing-sample-space?' to 'On.' Set 'num-successes' to 10,000 and run the model until it stops. Compare the value of 'Successes So Far' to the y-value of the 1-Column in the "Addends" plot. You will see that these values are very similar. So over many runs, we expect that the '1' will occur as many times as we have had runs. (See ProbLab model 'Expected Value' for an explanation of how to make predictions of expected values.) This is true for other target-totals -- we chose 2 so as to make this work fast.

Now look at the 'mean #addends per total' you received. It should be very near to 1.5. This is related to our finding, above, that the 2-Column is 1/2 (.5) as tall as the 1-Column and to our expectation to get as many '1's as we have had successes. These ideas combined suggest that we should get .5 as many '2's as we have had successes. So the 1-Column and the 2-Column together are 1.5 as large as the number of successes. This means that there are about 1.5 addends in each total. For the case of a target-total of '3,' we'd need to add '1 + 1/2 + 1/3.' So we'd expect a mean of 1.833 addends per toal. Try this, too!

## EXTENDING THE MODEL

Add a monitor that shows the minimum, average, and maximum number of partitions in every run (the number of items is the length of the-short-list). Add plots for these values. What shape do you expect this distribution to have? Will the values change per target-total?

Note that currently we are using this logic:

``````     set addend ( 1 + random temp-sample-space )
``````

This means that the model chooses addends with an eye to how much space is left up to the total (temp-sample-space is the difference between the running total and the target total). If we removed this, and only asked for "random total", how would the model change, if at all? How would the above extensions change, if at all?

## NETLOGO FEATURES

Note that in the above line of code, we set the addend to "1 +...etc." This is due to the nature of the 'random' reporter. The command 'random 3' returns numbers between 0 and 2, and will never return the number 3. So by adding 1, we get the values we actually want. You will come across this often in NetLogo, such as when working with lists. For example, if we had a list named "friends" ["pat" "bob" "joe" "kate"], the 3th value, 'joe,' is called "item 2 friends."

## PEDAGOGICAL NOTE

This model is related to other models in the ProbLab suite. Like other models, it looks at the evolution of a distribution that reflects procedures that have random elements. However, unlike other models, the distribution here is never bell-shaped. The greatest learning gain expected to come from working with this model is in comparing it to other models in ProbLab. This comparison should in particular revolve around an articulation, possibly in general terms, of what precisely about this model makes a bell-shaped distribution unlikely.

This model is related in an interesting way to 9-Block Stalagmite. In that model, the distribution of permutations reflects the sample space of all possible permutations. But in this model, the distribution does not reflect the sample space directly (see introduction, above).

Also, the model is related to the Attempts-Until-Success histogram in Prob Graph Basic and to the Distances to Whites histogram in Shuffle Board. Actually, those two histograms behave similar, whereas the histogram in this model behaves differently. Understanding this difference may sensitize you to "graph families." Just because all these graphs decrease monotonously, it does not necessarily mean that they describe the same or related functions.

## CREDITS AND REFERENCES

This model is a part of the ProbLab curriculum. The ProbLab Curriculum is currently under development at Northwestern's Center for Connected Learning and Computer-Based Modeling. . For more information about the ProbLab Curriculum please refer to http://ccl.northwestern.edu/curriculum/ProbLab/.

## HOW TO CITE

If you mention this model in a publication, we ask that you include these citations for the model itself and for the NetLogo software:

• Abrahamson, D. and Wilensky, U. (2004). NetLogo Partition Perms Distrib model. http://ccl.northwestern.edu/netlogo/models/PartitionPermsDistrib. Center for Connected Learning and Computer-Based Modeling, Northwestern Institute on Complex Systems, Northwestern University, Evanston, IL.
• Wilensky, U. (1999). NetLogo. http://ccl.northwestern.edu/netlogo/. Center for Connected Learning and Computer-Based Modeling, Northwestern Institute on Complex Systems, Northwestern University, Evanston, IL.

This model was created as part of the projects: PARTICIPATORY SIMULATIONS: NETWORK-BASED DESIGN FOR SYSTEMS LEARNING IN CLASSROOMS and/or INTEGRATED SIMULATION AND MODELING ENVIRONMENT. The project gratefully acknowledges the support of the National Science Foundation (REPP & ROLE programs) -- grant numbers REC #9814682 and REC-0126227.

Click to Run Model

```globals [
;; the-short-list is a list of the addends for the current total
;; it is used to display the addends in the command center, and it is initialized for each new search
;; also, the "sum the-short-list" gives us the running total and is used to check if we're at the target yet
the-short-list

;; used to display in a monitor the previous list of addends
previous-short-list

;; the-long-list is a list of all the-short-lists, and it is used for the histogram
the-long-list

;; addend is the number randomly generated by the model at each trial. Note that in this version of the model,
;; addends are drawn randomly from a sample space of addends that can still fit into the target total,
;; given the running total. So if the target-total slider is set to 20, and the running total is at 16,
;; then the addends are drawn randomly from a sample space between 1 and 4.
;; Thus, the active sample space decreases as the running total grows.

;; successes-so-far counts up how many times the-short-list has summed up to the total since last setup
;; it should be periodically equal to the quotient of "sum the-long-list / target-total"
successes-so-far

;; counter of how many addends each series is taking

;; list of how many addends it took to complete each total
partition-series-list
]

to startup
setup
end

to setup
ca
;; during setup, both the-short-list and the-long-list are initialized,
;; but during the run, the-short-list keeps initializing at each success, whereas the-long-list does not
set the-long-list []
set the-short-list []
set partition-series-list []
reset-ticks
set-plot-x-range 1 ( target-total + 1 )
end

to go
if ( successes-so-far >= num-successes ) [ stop ]
random-guess-and-update-total
tick
update-plot
finish-up
end

to random-guess-and-update-total
let running-total sum the-short-list

let temp-sample-space 0
ifelse diminishing-sample-space?
[
;; we draw a random number from the space remaining between the running total and the target-total
set temp-sample-space ( target-total - running-total )
]
[
;; we draw a random number from the entire target-total
set temp-sample-space target-total
]

;; we add 1 because random x reports numbers between 0 and (x-1)
set addend ( 1 + random temp-sample-space )

;; if the addend is small enough not to exceed the target-total, we keep it in the-short-list, and paint it in
if sum the-short-list + addend <= target-total [
paint
]
end

;;; make a histogram of all the addends in the-long-list at the right times

to update-plot
histogram the-long-list
let maxbar modes the-long-list
let maxrange length filter [ ? = item 0 maxbar ] the-long-list
set-plot-y-range 0 max list 10 maxrange
end

to paint
let pxcor-of-right-most-colored-patch 0
ifelse length the-short-list = 1
;; we want to create a ribbon of addends, each addend with a different color
[set pxcor-of-right-most-colored-patch ( -1 * max-pxcor - 1 ) ]
[set pxcor-of-right-most-colored-patch ( max [ pxcor ] of patches with [ pcolor != black ] )]

;; temp-color will be any of 14 colors from the NetLogo color space
let temp-color ( 10 * random 14 ) + 5

;; we color only the patches that reflect the latest addend
[ ( pxcor > pxcor-of-right-most-colored-patch ) and ( pxcor <= ( pxcor-of-right-most-colored-patch + addend ) ) ]
[ set pcolor temp-color ]
end

to finish-up
if sum the-short-list = target-total
[
set-plot-x-range 1 ( 1 + max partition-series-list )
histogram partition-series-list
let maxbar modes partition-series-list
let maxrange length filter [ ? = item 0 maxbar ] partition-series-list
set-plot-y-range 0 max list 10 maxrange
set previous-short-list the-short-list
set the-short-list []
set successes-so-far successes-so-far + 1
if wait-at-full? [ wait .5 ]
cp ct
]
end

```

There are 15 versions of this model.

Uri Wilensky over 9 years ago Updated to NetLogo 5.0.4 Download this version
Uri Wilensky over 10 years ago Updated version tag Download this version
Uri Wilensky over 10 years ago Updated to version from NetLogo 5.0.3 distribution Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Updated from NetLogo 4.1 Download this version
Uri Wilensky over 12 years ago Model from NetLogo distribution Download this version
Uri Wilensky over 12 years ago Model from NetLogo distribution Download this version
Uri Wilensky over 12 years ago Partition Perms Distrib Download this version

## Attached files

File Type Description Last updated
Partition Perms Distrib.png preview Preview for 'Partition Perms Distrib' almost 10 years ago, by Uri Wilensky Download

This model does not have any ancestors.

This model does not have any descendants.