Search results

In [[computing]] and [[information science]], the '''Binary Independence Model''' ('''BIM''')<ref name="cyu76" /><ref name="jones77" /> is a probab ...ly the presence or absence of terms in documents are recorded. Terms are [[independence (probability theory)|independently]] distributed in the set of relevant doc ...

...h>H</math> is a random orthogonal <math>p\times p</math> matrix which is [[independence (probability theory)|independent]] of <math>U</math>, then <math>HUH^T\sim ===Partitioned matrix results=== ...

...agent over bundles of goods either under conditions of certainty about the results of any potential choice, or under conditions of uncertainty. ...n be used to make the construction of a utility function easier. Some such independence properties are described below. ...

[[Category:Independence results]] ...

...tatistical population|population]] (of size ''N'') has some ([[statistical independence|independent]]) chance <math>p_i</math> to be selected to the sample when pe ...sample size ''n'' (as opposed to [[Poisson sampling]] which is similar but results in a random sample size with [[expectancy]] of&nbsp;''n''). When selecting ...

[[Category:Independence results]] ...

...me |time period]] after the first will depend on the amount of wealth that results from the previous period's portfolio, which depends on the asset returns th ...'t'' are additively separate, giving rise to the result of ''intertemporal independence of optimal decisions'': optimizing for any particular decision period ''t'' ...

...input data is chosen by an adversary. The trade-offs between the degree of independence and the efficiency of evaluating the hash function are well studied, and ma ...to a <math>k</math>-independent family, which allows black-box use of the independence properties. ...

Both of these classic results ask questions about how large a graph can be before it possesses a certain ...<math>n</math>-vertex graph not containing <math>K_{r+1}</math> and having independence number <math>\alpha(G) < m</math>. What is the maximum number of edges such ...

...random variables''' is a generalization of [[Independent random variables|independence]] that is weaker than the concept of a [[Martingale (probability)|martingal ...-3157|year=1990|s2cid=120632192}}</ref> and Birkel's "asymptotic quadrant independence."<ref>{{Cite journal|date=1992-07-11|title=Laws of large numbers under depe ...

...f {{mvar|n}}. From this the formula {{math|''R''(3,''n'') ≥ 3(''n'' – 1)}} results, where {{math|''R''(''n'',''k'')}} is the [[Ramsey number]]. The equality h ...

..."having established, by herself and in collaboration, a number of striking results on some central problems in arithmetic geometry and number theory".<ref>{{c ...imitrov | first2=Vesselin | last3=Tang | first3=Yunqing | title=The linear independence of $1$, $ζ(2)$, and $L(2,χ_{-3})$ | date=2024 | doi=10.48550/ARXIV.2408.154 ...

...ffers from these logics in that it separates the notions of dependence and independence from the notion of [[Quantification (logic)|quantification]]. ...ce logic is a variant of [[Wilfrid Hodges]]' compositional semantics for [[Independence-friendly logic|IF logic]].<ref>[[#refHodges97|Hodges 1997]]</ref><ref>[[#re ...

| title = An independence result for <math>(\Pi^1_1\text{-CA})+\text{BI}</math> | title = A direct independence proof of Buchholz's Hydra game on finite labeled trees ...

...ower variants of tabulation hashing extend the method to higher degrees of independence. Because of its high degree of independence, tabulation hashing is usable with hashing methods that require a high-qual ...

...the same [[probability distribution]] as the others and all are mutually [[independence (probability theory)|independent]].<ref>{{cite web | url= http://tuvalu.san ...f and only if <math>P(A\land B) = P(A) \cdot P(B)</math>, see also {{slink|Independence (probability theory)#Two random variables}}.) ...

...m variables are [[correlated]] to the cost when the random variables are [[Independence (probability theory)|independent]].<ref name=adsy10>{{cite conference|doi=1 An upper bound on the correlation gap implies an upper bound on the loss that results from ignoring the correlation. For example, suppose we have a stochastic pr ...

...s, voters will (on average) prefer the results of a maximal lottery to the results produced by any other [[voting rule]]. ...op-ranks maximal lotteries has been uniquely characterized using Arrow's [[independence of irrelevant alternatives]] and [[Pareto efficiency]].<ref name="BrBr19a"> ...

...the language L_ID, by the following axioms:<ref>W. Buchholz, "An Independence Result for <math>(\Pi^1_1\textrm{-CA})\textrm{+BI}</math>", Annals of Pure == Results == ...

{{short description|On algebraic independence of logarithms}} ...an|last= Baker|year1=1966|year2=1967a|year3=1967b}}, subsumed many earlier results in transcendental number theory. Baker used this to prove the transcendence ...