Randomness: Difference between revisions

Content deleted Content added
In biology: updated with 1 item from 2022 in science (clarified degree of randomness)
XComhghall (talk | contribs)
m Fallacy: odds are never dynamic: // Edit via Wikiplus
 
(36 intermediate revisions by 23 users not shown)
Line 1:
{{selfrefredirect|Random|For a random Wikipedia article, see [[|Special:Random]]. For |information about Wikipedia's random article feature, see [[|Wikipedia:Random]].|other uses}}
{{redirect|Random}}
{{selfref|For a random Wikipedia article, see [[Special:Random]]. For information about Wikipedia's random article feature, see [[Wikipedia:Random]].}}
{{short description|Apparent lack of pattern or predictability in events}}
{{sprotected2}}
Line 7 ⟶ 6:
{{Probability fundamentals}}
 
[[File:RandomBitmap.png|thumb|alt=|A [[Pseudorandom Number Generator|pseudorandomly generated]] [[bitmap]]. ]]
In common parlanceusage, '''randomness''' is the apparent or actual lack of definite [[pattern]] or [[predictability]] in eventsinformation.<ref>The ''[[Oxford English Dictionary]]'' defines "random" as "Having no definite aim or purpose; not sent or guided in a particular direction; made, done, occurring, etc., without method or conscious choice; haphazard."</ref><ref name=":0">{{Cite web|url=https://www.dictionary.com/browse/randomness|title=Definition of randomness {{!}} Dictionary.com|website=www.dictionary.com|language=en|access-date=2019-11-21}}</ref> A random sequence of events, [[symbol]]s or steps often has no [[:wikt:order|order]] and does not follow an intelligible pattern or combination. Individual random events are, by definition, unpredictable, but if thethere is a known [[probability distribution]] is known, the frequency of different outcomes over repeated events (or "trials") is predictable.<ref group="note">Strictly speaking, the frequency of an outcome will converge [[almost surely]] to a predictable value as the number of trials becomes arbitrarily large. Non-convergence or convergence to a different value is possible, but has [[probability]] zero. Consistent non-convergence is thus evidence of the lack of a fixed probability distribution, as in many evolutionary processes.</ref> For example, when throwing two [[dice]], the outcome of any particular roll is unpredictable, but a sum of 7 will tend to occur twice as often as 4. In this view, randomness is not haphazardness; it is a measure of uncertainty of an outcome. Randomness applies to concepts of chance, [[probability]], and [[information entropy]].
 
The fields of mathematics, probability, and statistics use formal definitions of randomness, typically assuming that there is some 'objective' probability distribution. In statistics, a [[random variable]] is an assignment of a numerical value to each possible outcome of an [[event space]]. This association facilitates the identification and the calculation of probabilities of the events. Random variables can appear in [[random sequence]]s. A [[random process]] is a sequence of random variables whose outcomes do not follow a [[determinism|deterministic]] pattern, but follow an evolution described by [[probability distribution]]s. These and other constructs are extremely useful in [[probability theory]] and the various [[applications of randomness]].
 
Randomness is most often used in [[statistics]] to signify well-defined statistical properties. [[Monte Carlo method]]s, which rely on random input (such as from [[random number generation|random number generators]] or [[pseudorandom number generator]]s), are important techniques in science, particularly in the field of [[Scientific computing|computational science]].<ref>[http://www.people.fas.harvard.edu/~junliu/Workshops/workshop2007/ Third Workshop on Monte Carlo Methods], Jun Liu, Professor of Statistics, Harvard University</ref> By analogy, [[quasi-Monte Carlo method]]s use [[low-discrepancy sequence|quasi-random number generators]].
 
'''Random selection''', when narrowly associated with a [[simple random sample]], is a method of selecting items (often called units) from a population where the probability of choosing a specific item is the proportion of those items in the population. For example, with a bowl containing just 10 red marbles and 90 blue marbles, a random selection mechanism would choose a red marble with probability 1/10. Note that aA random selection mechanism that selected 10 marbles from this bowl would not necessarily result in 1 red and 9 blue. In situations where a population consists of items that are distinguishable, a random selection mechanism requires equal probabilities for any item to be chosen. That is, if the selection process is such that each member of a population, say research subjects, has the same probability of being chosen, then we can say the selection process is random.<ref name=":0" />
 
According to [[Ramsey theory]], pure randomness (in the sense of there being no discernible pattern) is impossible, especially for large structures. Mathematician [[Theodore Motzkin]] suggested that "while disorder is more probable in general, complete disorder is impossible".<ref>{{cite journal|author=Hans Jürgen Prömel|year=2005|title=Complete Disorder is Impossible: The Mathematical Work of Walter Deuber|journal=[[Combinatorics, Probability and Computing]]|publisher=Cambridge University Press|volume=14|pages=3–16|doi=10.1017/S0963548304006674|s2cid=37243306|url=http://edoc.hu-berlin.de/18452/28352 }}</ref> Misunderstanding this can lead to numerous [[conspiracy theory|conspiracy theories]].<ref>Ted.com, (May 2016). [https://www.ted.com/talks/patrickjmt_the_origin_of_countless_conspiracy_theories/transcript The origin of countless conspiracy theories]</ref> [[Cristian S. Calude]] stated that "given the impossibility of true randomness, the effort is directed towards studying degrees of randomness".<ref name="calude2017">[[Cristian S. Calude]], (2017). [https://www.cs.auckland.ac.nz/~cristian/crispapers/QR_TP.pdf "Quantum Randomness: From Practice to Theory and Back"] in "The Incomputable Journeys Beyond the Turing Barrier" Editors: [[S. Barry Cooper]], [[Mariya I. Soskova]], 169–181, doi:10.1007/978-3-319-43669-2_11.</ref> It can be proven that there is infinite hierarchy (in terms of quality or strength) of forms of randomness.<ref name="calude2017" />
 
== History ==
{{Main|History of randomness}}
[[File:Pompeii - Osteria della Via di Mercurio - Dice Players.jpg|thumb|Ancient [[fresco]] of dice players in [[Pompei]].]]
In ancient history, the concepts of chance and randomness were intertwined with that of fate. Many ancient peoples threw [[dice]] to determine fate, and this later evolved into games of chance. Most ancient cultures used various methods of [[divination]] to attempt to circumvent randomness and fate.<ref>''Handbook to life in ancient Rome'' by Lesley Adkins 1998 {{isbn|0-19-512332-8}} page 279</ref><ref>''Religions of the ancient world'' by Sarah Iles Johnston 2004 {{isbn|0-674-01517-7}} page 370</ref> Beyond [[religion]] and [[game of chance|games of chance]], randomness has been attested for [[sortition]] since at least ancient [[Athenian democracy]] in the form of a [[kleroterion]].<ref name=Hansen>{{cite book
| last = Hansen
| first = Mogens Herman
| date = 1991
| title = The Athenian Democracy in the Age of Demosthenes
| page = [https://archive.org/details/atheniandemocrac00hans/page/230 230]
| publisher = Wiley
| url = https://archive.org/details/atheniandemocrac00hans
| author-link = Mogens Herman Hansen
| isbn = 9780631180173
}}</ref>
 
The Chineseformalization of 3000odds yearsand agochance werewas perhaps the earliest peopledone toby formalizethe oddsChinese andof chance3,000 years ago. The Greek philosophers discussed randomness at length, but only in non-quantitative forms. It was only in the 16th century that Italian mathematicians began to formalize the odds associated with various games of chance. The invention of [[calculus]] had a positive impact on the formal study of randomness. In the 1888 edition of his book ''The Logic of Chance'', [[John Venn]] wrote a chapter on ''The conception of randomness'' that included his view of the randomness of the digits of [[pi]] (π), by using them to construct a [[random walk]] in two dimensions.<ref>''Annotated readings in the history of statistics'' by Herbert Aron David, 2001 {{isbn|0-387-98844-0}} page 115. Note that theThe 1866 edition of Venn's book (on Google books) does not include this chapter.</ref>
 
The early part of the 20th century saw a rapid growth in the formal analysis of randomness, as various approaches to the mathematical foundations of probability were introduced. In the mid-to-late-20th century, ideas of [[algorithmic information theory]] introduced new dimensions to the field via the concept of [[algorithmic randomness]].
Line 39 ⟶ 48:
* [[Information theory]]
* [[Pattern recognition]]
*[[Percolation theory]]
* [[Probability theory]]
* [[Quantum mechanics]]
*[[Random walk]]
* [[Statistical mechanics]]
* [[Statistics]]
 
{{div col end}}
 
Line 51 ⟶ 63:
 
=== In biology ===
The [[modern synthesis (20th century)|modern evolutionary synthesis]] ascribes the observed diversity of life to random genetic [[mutation]]s followed by [[natural selection]]. The latter retains some random mutations in the [[gene pool]] due to the systematically improved chance for survival and reproduction that those mutated genes confer on individuals who possess them. The location of the mutation is not entirely random however as e.g. biologically important regions may be more protected from mutations.<ref>{{cite news |title=Study challenges evolutionary theory that DNA mutations are random |url=https://phys.org/news/2022-01-evolutionary-theory-dna-mutations-random.html |access-date=12 February 2022 |work=[[U.C. Davis]] |language=en}}</ref><ref>{{cite journal |last1=Monroe |first1=J. Grey |last2=Srikant |first2=Thanvi |last3=Carbonell-Bejerano |first3=Pablo |last4=Becker |first4=Claude |last5=Lensink |first5=Mariele |last6=Exposito-Alonso |first6=Moises |last7=Klein |first7=Marie |last8=Hildebrandt |first8=Julia |last9=Neumann |first9=Manuela |last10=Kliebenstein |first10=Daniel |last11=Weng |first11=Mao-Lun |last12=Imbert |first12=Eric |last13=Ågren |first13=Jon |last14=Rutter |first14=Matthew T. |last15=Fenster |first15=Charles B. |last16=Weigel |first16=Detlef |title=Mutation bias reflects natural selection in Arabidopsis thaliana |journal=Nature |date=February 2022 |volume=602 |issue=7895 |pages=101–105 |doi=10.1038/s41586-021-04269-6 |pmid=35022609 |pmc=8810380 |bibcode=2022Natur.602..101M |language=en |issn=1476-4687}}</ref><ref>{{cite journal |last1=Belfield |first1=Eric J. |last2=Ding |first2=Zhong Jie |last3=Jamieson |first3=Fiona J.C. |last4=Visscher |first4=Anne M. |last5=Zheng |first5=Shao Jian |last6=Mithani |first6=Aziz |last7=Harberd |first7=Nicholas P. |title=DNA mismatch repair preferentially protects genes from mutation |journal=Genome Research |date=January 2018 |volume=28 |issue=1 |pages=66–74 |doi=10.1101/gr.219303.116|pmid=29233924 |pmc=5749183 }}</ref>
 
Several authors also claim that evolution (and sometimes development) requires a specific form of randomness, namely the introduction of qualitatively new behaviors. Instead of the choice of one possibility among several pre-given ones, this randomness corresponds to the formation of new possibilities.<ref>{{Cite book|last1=Longo|first1=Giuseppe|last2=Montévil|first2=Maël|last3=Kauffman|first3=Stuart|datetitle=2012-01-01Proceedings of the 14th annual conference companion on Genetic and evolutionary computation |titlechapter=No Entailingentailing Lawslaws, but Enablementenablement in the Evolutionevolution of the Biospherebiosphere |date=2012-01-01|url=https://www.academia.edu/11720588|journal=Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation|series=GECCO '12|location=New York, NY, USAUS|publisher=ACM|pages=1379–1392|doi=10.1145/2330784.2330946|isbn=9781450311786|arxiv=1201.2069|citeseerx=10.1.1.701.3838|s2cid=15609415}}</ref><ref>{{Cite journal|last1=Longo|first1=Giuseppe|last2=Montévil|first2=Maël|date=2013-10-01|title=Extended criticality, phase spaces and enablement in biology|url=https://www.academia.edu/11720575|journal=Chaos, Solitons & Fractals|series=Emergent Critical Brain Dynamics|volume=55|pages=64–79|doi=10.1016/j.chaos.2013.03.008|bibcode=2013CSF....55...64L|s2cid=55589891 }}</ref>
 
The characteristics of an organism arise to some extent deterministically (e.g., under the influence of genes and the environment), and to some extent randomly. For example, the ''density'' of [[freckles]] that appear on a person's skin is controlled by genes and exposure to light; whereas the exact location of ''individual'' freckles seems random.<ref>{{cite journal |last= Breathnach |first= A. S. |year= 1982 |title= A long-term hypopigmentary effect of thorium-X on freckled skin |journal= British Journal of Dermatology |volume= 106 |issue= 1 |pages= 19–25 |doi= 10.1111/j.1365-2133.1982.tb00897.x |quote= The distribution of freckles seems entirely random, and not associated with any other obviously punctuate anatomical or physiological feature of skin. |pmid= 7059501|s2cid= 72016377 }}</ref>
Line 60 ⟶ 72:
 
=== In mathematics ===
The mathematical theory of [[probability]] arose from attempts to formulate mathematical descriptions of chance events, originally in the context of [[gambling]], but later in connection with physics. [[Statistics]] is used to infer thean underlying [[probability distribution]] of a collection of empirical observations. For the purposes of [[simulation]], it is necessary to have a large supply of [[Random sequence|random numbers]]—or means to generate them on demand.
 
[[Algorithmic information theory]] studies, among other topics, what constitutes a [[random sequence]]. The central idea is that a string of [[bit]]s is random if and only if it is shorter than any computer program that can produce that string ([[Kolmogorov randomness]]), which means that random strings are those that cannot be [[data compression|compressed]]. Pioneers of this field include [[Andrey Kolmogorov]] and his student [[Per Martin-Löf]], [[Ray Solomonoff]], and [[Gregory Chaitin]]. For the notion of infinite sequence, mathematicians generally accept [[Per Martin-Löf]]'s semi-eponymous definition: An infinite sequence is random if and only if it withstands all recursively enumerable null sets.<ref>{{Cite journal|last=Martin-Löf|first=Per|date=1966|title=The definition of random sequences|journal=Information and Control|language=en|volume=9|issue=6|pages=602–619|doi=10.1016/S0019-9958(66)80018-9|doi-access=free}}</ref> The other notions of random sequences include, among others, recursive randomness and Schnorr randomness, which are based on recursively computable martingales. It was shown by [[Yongge Wang]] that these randomness notions are generally different.<ref>Yongge Wang: Randomness and Complexity. PhD Thesis, 1996. http://webpages.uncc.edu/yonwang/papers/thesis.pdf</ref>
Line 66 ⟶ 78:
Randomness occurs in numbers such as [[binary logarithm|log(2)]] and [[pi]]. The decimal digits of pi constitute an infinite sequence and "never repeat in a cyclical fashion." Numbers like pi are also considered likely to be [[normal number|normal]]:
{{Quote
|text = Pi certainly seems to behave this way. In the first six billion decimal places of pi, each of the digits from 0 through 9 shows up about six hundred million times. Yet such results, conceivably accidental, do not prove normality even in base 10, much less normality in other number bases.<ref>{{cite web |url=http://www.lbl.gov/Science-Articles/Archive/pi-random.html |title=Are the digits of pi random? researcher may hold the key |publisher=Lbl.gov |date=2001-07-23 |access-date=2012-07-27 |archive-date=20 October 2007 |archive-url=https://web.archive.org/web/20071020010208/http://lbl.gov/Science-Articles/Archive/pi-random.html |url-status=dead }}</ref>
}}
 
Line 87 ⟶ 99:
=== In politics ===
 
Random selection can be an official method to resolve [[Tie (draw)|tied]] elections in some jurisdictions.<ref>Municipal Elections Act (Ontario, Canada) 1996, c. 32, Sched., s. 62 (3) : "If the recount indicates that two or more candidates who cannot both or all be declared elected to an office have received the same number of votes, the clerk shall choose the successful candidate or candidates by lot."</ref> Its use in politics originates long ago. Many offices in [[Ancientancient Athens]] were chosen by lot instead of modern voting.
 
== Randomness and religion ==
Line 105 ⟶ 117:
'''Games''': Random numbers were first investigated in the context of [[gambling]], and many randomizing devices, such as [[dice]], [[shuffling playing cards]], and [[roulette]] wheels, were first developed for use in gambling. The ability to produce random numbers fairly is vital to electronic gambling, and, as such, the methods used to create them are usually regulated by government [[Gaming Control Board]]s. Random drawings are also used to determine [[lottery]] winners. In fact, randomness has been used for games of chance throughout history, and to select out individuals for an unwanted task in a fair way (see [[drawing straws]]).
 
'''Sports''': Some sports, including [[American football]], use [[coin toss]]es to randomly select starting conditions for games or [[seed (sports)|seed]] tied teams for [[playoffs|postseason play]]. The [[National Basketball Association]] uses a weighted [[NBA Draftdraft Lotterylottery|lottery]] to order teams in its draft.
 
'''Mathematics''': Random numbers are also employed where their use is mathematically important, such as sampling for [[opinion poll]]s and for statistical sampling in [[quality control]] systems. Computational solutions for some types of problems use random numbers extensively, such as in the [[Monte Carlo method]] and in [[genetic algorithm]]s.
Line 152 ⟶ 164:
 
[[File:Monty open door.svg|thumb|100px|In the [[Monty Hall problem]], when the host reveals one door that contains a goat, this provides new information that needs to be factored into the calculation of probabilities.]]
For example, when being told that a woman has two children, one might be interested in knowing if either of them is a girl, and if yes, what isthe probability that the other child is also a girl. Considering the two events independently, one might expect that the probability that the other child is female is ½ (50%), but by building a [[probability space]] illustrating all possible outcomes, one would notice that the probability is actually only ⅓ (33%).
 
To be sure, the probability space does illustrate four ways of having these two children: boy-boy, girl-boy, boy-girl, and girl-girl. But once it is known that at least one of the children is female, this rules out the boy-boy scenario, leaving only three ways of having the two children: boy-girl, girl-boy, girl-girl. From this, it can be seen only ⅓ of these scenarios would have the other child also be a girl<ref name="NYOdds">{{cite news| url=https://www.nytimes.com/2008/06/08/books/review/Johnson-G-t.html?_r=1 | work=The New York Times | first=George | last=Johnson | title=Playing the Odds | date=8 June 2008}}</ref> (see [[Boy or girl paradox]] for more).
Line 162 ⟶ 174:
<!-- Please keep entries in alphabetical order & add a short description [[WP:SEEALSO]] -->
{{div col|colwidth=20em}}
* [[Aleatory]]
* [[Chaitin's constant]]
* [[Chance (disambiguation)]]
* [[FrequencyFrequentist probability]]
* [[Indeterminism]]
* [[Nonlinear system]]
Line 202 ⟶ 213:
*[http://www.fourmilab.ch/random/ A Pseudorandom Number Sequence Test Program (Public Domain)]
*[https://web.archive.org/web/20050404045817/http://etext.lib.virginia.edu/cgi-local/DHI/dhi.cgi?id=dv1-46 ''Dictionary of the History of Ideas'':] Chance
*[http://www.cs.auckland.ac.nz/~cristian/Calude361_370.pdf Computing a Glimpse of Randomness]
*[http://plato.stanford.edu/entries/chance-randomness/ Chance versus Randomness], from the [[Stanford Encyclopedia of Philosophy]]