ランダム配列、ランダムシークエンス

WordNet

determine the order of constituents in; "They sequenced the human genome"
a following of one thing after another in time; "the doctor saw a sequence of patients" (同)chronological sequence, succession, successiveness, chronological succession
film consisting of a succession of related shots that develop a given subject in a movie (同)episode
serial arrangement in which things follow in logical order or a recurrent pattern; "the sequence of names was alphabetical"; "he invented a technique to determine the sequence of base pairs in DNA"
several repetitions of a melodic phrase in different keys
arrange in a sequence
lacking any definite plan or order or purpose; governed by or depending on chance; "a random choice"; "bombs fell at random"; "random movements"
the basic unit of money in South Africa; equal to 100 cents

PrepTutorEJDIC

〈U〉〈C〉(時間の上の,また因果関係のつながりによる)『連続』,続き / 〈C〉《a~》(…の)一連のもの《+『of』+『名』》 / 〈U〉(起こる)『順序』(order),筋道 / 〈C〉(…に対する)結果《+『to』+『名』》
『手当たりしだいの』,任意の;行き当たりばったりの
ラント(南アフリカ共和国の通貨の単位)
配列,接続;(特に時間の)調整

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2014/03/14 08:43:32」(JST)

wiki en

[Wiki en表示]

Fortuna, Goddess of chance depicted by Tadeusz Kuntze, 1754 (National Museum in Warsaw).

The concept of a random sequence is essential in probability theory and statistics. The concept generally relies on the notion of a sequence of random variables and many statistical discussions begin with the words "let X₁,...,X_n be independent random variables...". Yet as D. H. Lehmer stated in 1951: "A random sequence is a vague notion... in which each term is unpredictable to the uninitiated and whose digits pass a certain number of tests traditional with statisticians".^[1]

Axiomatic probability theory deliberately avoids a definition of a random sequence.^[2] Traditional probability theory does not state if a specific sequence is random, but generally proceeds to discuss the properties of random variables and stochastic sequences assuming some definition of randomness. The Bourbaki school considered the statement "let us consider a random sequence" an abuse of language.^[3] During the 20th century various technical approaches to defining random sequences were developed and now three distinct paradigms can be identified.

Early history[edit]

Émile Borel was one of the first mathematicians to formally address randomness in 1909.^[4] In 1919 Richard von Mises gave the first definition of algorithmic randomness, which was inspired by the law of large numbers, although he used the term collective rather than random sequence. Using the concept of the impossibility of a gambling system, von Mises defined an infinite sequence of zeros and ones as random if it is not biased by having the frequency stability property i.e. the frequency of zeros goes to 1/2 and every sub-sequence we can select from it by a "proper" method of selection is also not biased.^[5]

The sub-sequence selection criterion imposed by von Mises is important, because although 0101010101... is not biased, by selecting the odd positions, we get 000000... which is not random. Von Mises never totally formalized his definition of a proper selection rule for sub-sequences, but in 1940 Alonzo Church defined it as any recursive function which having read the first N elements of the sequence decides if it wants to select element number N+1. Church was a pioneer in the field of computable functions, and the definition he made relied on the Church Turing Thesis for computability.^[6] This definition is often called Mises-Church randomness.

Modern approaches[edit]

In the mid 1960s, A. N. Kolmogorov and D. W. Loveland independently proposed a more permissive selection rule.^[7]^[8] In their view Church's recursive function definition was too restrictive in that it read the elements in order. Instead they proposed a rule based on a partially computable process which having read any N elements of the sequence, decides if it wants to select another element which has not been read yet. This definition is often called Kolmogorov-Loveland stochasticity. But this method was considered too weak by Alexander Shen who showed that there is a Kolmogorov-Loveland stochastic sequence which does not conform to the general notion of randomness.

In 1966 Per Martin-Löf introduced a new notion which is now generally considered the most satisfactory notion of algorithmic randomness. His original definition involved measure theory, but it was later shown that it can be expressed in terms of Kolmogorov complexity. Kolmogorov's definition of a random string was that it is random if has no description shorter than itself via a universal Turing machine.^[9]

Three basic paradigms for dealing with random sequences have now emerged:^[10]

The frequency / measure-theoretic approach. This approach started with the work of Robert von Mises and Alonzo Church. In the 1960s Per Martin-Löf noticed that the sets coding such frequency-based stochastic properties are a special kind of measure zero sets, and that a more general and smooth definition can be obtained by considering all effectively measure zero sets.

The complexity / compressibility approach. This paradigm was championed by A. N. Kolmogorov along with contributions Levin and Gregory Chaitin. For finite random sequences, Kolmogorov defined the "randomness" as the entropy, i.e. Kolmogorov complexity, of a string of length K of zeros and ones as the closeness of its entropy to K, i.e. if the complexity of the string is close to K it is very random and if the complexity is far below K, it is not so random.

The predictability approach. This paradigm was due to Claus P. Schnorr and uses a slightly different definition of constructive martingales than martingales used in traditional probability theory.^[11] Schnorr showed how the existence of a selective betting strategy implied the existence of a selection rule for a biased sub-sequence.

In most cases, theorems relating the three paradigms (often equivalence) have been proven.^[12]

It is important to realize that for each of the definitions given above for infinite sequences, if one adds a billion zeros to the front of the random sequence the new sequence will still be considered random. Hence any application of these concepts to practical problems needs to be performed with care.^[13]

References[edit]

Sergio B. Volchan What Is a Random Sequence? The American Mathematical Monthly, Vol. 109, 2002, pp. 46–63

Notes[edit]

^ "What is meant by the word Random" in Mathematics and common sense by Philip J. Davis 2006 ISBN 1-56881-270-1 pages 180-182
^ Inevitable Randomness in Discrete Mathematics by József Beck 2009 ISBN 0-8218-4756-2 page 44
^ Algorithms: main ideas and applications by Vladimir Andreevich Uspenskiĭ, Alekseĭ, Lʹvovich Semenov 1993 Springer ISBN 0-7923-2210-X page 166
^ E. Borel, Les probabilites denombrables et leurs applications arithmetique Rend. Circ. Mat. Palermo 27 (1909) 247-271
^ Laurant Bienvenu "Kolmogorov Loveland Stochastocity" in STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science by Wolfgang Thomas ISBN 3-540-70917-7 page 260
^ Alonzo Church, "On the Concept of Random Sequence," Bull. Amer. Math. Soc., 46 (1940), 254–260
^ A. N. Kolmogorov, Three approaches to the quantitative definition of information Problems of Information and Transmission, 1(1):1--7, 1965.
^ D.W. Loveland, A new interpretation of von Mises' concept of random sequence Z. Math. Logik Grundlagen Math 12 (1966) 279-294
^ An introduction to Kolmogorov complexity and its applications by Ming Li, P. M. B. Vitányi 1997 0387948686 pages 149-151
^ R. Downey, Some Recent Progress in Algorithmic Randomness in Mathematical foundations of computer science 2004: by Jiří Fiala, Václav Koubek 2004 ISBN 3-540-22823-3 page 44
^ Schnorr, C. P. (1971). "A unified approach to the definition of a random sequence". Mathematical Systems Theory 5 (3): 246–258
^ Wolfgan Merkel, Kolmogorov Loveland Stochasticity in Automata, languages and programming: 29th international colloquium, ICALP 2002, by Peter Widmayer et al. ISBN 3-540-43864-5 page 391
^ Algorithms: main ideas and applications by Vladimir Andreevich Uspenskiĭ, Alekseĭ, Lʹvovich Semenov 1993 Springer ISBN 0-7923-2210-X page 176

External links[edit]

Hazewinkel, Michiel, ed. (2001), "Random sequence", Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
Video on frequency stability. Why humans can't "guess" randomly
Randomness tests by Terry Ritter

UpToDate Contents

全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.

1. 成人における迅速導入気管挿管のための前処置剤 pretreatment agents for rapid sequence intubation in adults
2. 成人における迅速導入気管挿管 rapid sequence intubation in adults
3. 成人における迅速導入気管挿管のための鎮静剤または導入剤 sedation or induction agents for rapid sequence intubation in adults
4. 成人における迅速導入気管挿管のための神経筋遮断剤（NMBA） neuromuscular blocking agents nmba for rapid sequence intubation in adults
5. DNAによる親子鑑定 parentage testing using dna

English Journal

Purification and structural analysis of membrane-bound polyphenol oxidase from Fuji apple.

Liu F1, Zhao JH1, Wen X1, Ni YY2.
Food chemistry.Food Chem.2015 Sep 15;183:72-7. doi: 10.1016/j.foodchem.2015.03.027. Epub 2015 Mar 17.
Membrane-bound polyphenol oxidase (mPPO) in Fuji apple (Malus domestica Borkh. cv. Red Fuji) was purified and analyzed with a nanoelectrospray ionization mass spectrometer. The three-dimensional model and binding site of mPPO to 4-methyl catechol were also studied using molecular docking. mPPO was p
PMID 25863612

Error catastrophe in populations under similarity-essential recombination.

de Aguiar MA1, Schneider DM2, do Carmo E3, Campos PR4, Martins AB5.
Journal of theoretical biology.J Theor Biol.2015 Jun 7;374:48-53. doi: 10.1016/j.jtbi.2015.03.028. Epub 2015 Apr 3.
Organisms are often more likely to exchange genetic information with others that are similar to themselves. One of the most widely accepted mechanisms of RNA virus recombination requires substantial sequence similarity between the parental RNAs and is termed similarity-essential recombination. This
PMID 25843218

Biocomputational characterization and evolutionary analysis of bubaline dicer1 enzyme.

Singh J1, Mukhopadhyay CS1, Arora JS1, Kaur S2.
Asian-Australasian journal of animal sciences.Asian-Australas J Anim Sci.2015 Jun;28(6):876-87. doi: 10.5713/ajas.14.0767.
Dicer, an ribonuclease type III type endonuclease, is the key enzyme involved in biogenesis of microRNAs (miRNAs) and small interfering RNAs (siRNAs), and thus plays a critical role in RNA interference through post transcriptional regulation of gene expression. This enzyme has not been well studied
PMID 25925065