About: Schrödinger method     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSchrödinger_method

In combinatorial mathematics and probability theory, the Schrödinger method, named after the Austrian physicist Erwin Schrödinger, is used to solve some problems of . Suppose are independent random variables that are uniformly distributed on the interval [0, 1]. Let does not depend on λ (in the language of statisticians, N is a sufficient statistic for this parametrized family of probability distributions for the order statistics). We proceed as follows: so that

AttributesValues
rdfs:label
  • Schrödinger method (en)
rdfs:comment
  • In combinatorial mathematics and probability theory, the Schrödinger method, named after the Austrian physicist Erwin Schrödinger, is used to solve some problems of . Suppose are independent random variables that are uniformly distributed on the interval [0, 1]. Let does not depend on λ (in the language of statisticians, N is a sufficient statistic for this parametrized family of probability distributions for the order statistics). We proceed as follows: so that (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
has abstract
  • In combinatorial mathematics and probability theory, the Schrödinger method, named after the Austrian physicist Erwin Schrödinger, is used to solve some problems of . Suppose are independent random variables that are uniformly distributed on the interval [0, 1]. Let be the corresponding order statistics, i.e., the result of sorting these n random variables into increasing order. We seek the probability of some event A defined in terms of these order statistics. For example, we might seek the probability that in a certain seven-day period there were at most two days in on which only one phone call was received, given that the number of phone calls during that time was 20. This assumes uniform distribution of arrival times. The Schrödinger method begins by assigning a Poisson distribution with expected value λt to the number of observations in the interval [0, t], the number of observations in non-overlapping subintervals being independent (see Poisson process). The number N of observations is Poisson-distributed with expected value λ. Then we rely on the fact that the conditional probability does not depend on λ (in the language of statisticians, N is a sufficient statistic for this parametrized family of probability distributions for the order statistics). We proceed as follows: so that Now the lack of dependence of P(A | N = n) upon λ entails that the last sum displayed above is a power series in λ and P(A | N = n) is the value of its nth derivative at λ = 0, i.e., For this method to be of any use in finding P(A | N =n), must be possible to find Pλ(A) more directly than P(A | N = n). What makes that possible is the independence of the numbers of arrivals in non-overlapping subintervals. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is known for of
is known for of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software