Search results
Jump to navigation
Jump to search
- '''Discrepancy of permutations''' is a sub-field of [[discrepancy theory]], that deals with balancing intervals induced by permutations of elements. ...hat interval; the objective is to color the elements such that the maximum discrepancy of an interval in each of the permutations is as small as possible. ...5 KB (771 words) - 06:03, 25 September 2024
- ...ger |year=1999 |isbn=3-540-65528-X}}</ref> is a sub-field of [[discrepancy theory]], that deals with balancing geometric sets, such as intervals or [[rectang ...in that object; the objective is to color the points such that the maximum discrepancy of an object is as small as possible. ...7 KB (1,063 words) - 22:52, 2 October 2024
- ...027895|last=Erdős|first=P.|last2=Turán|first2=P.|title=On a problem in the theory of uniform distribution. II.|journal= Proceedings of the Koninklijke Nederl ==Application to discrepancy== ...3 KB (456 words) - 10:21, 24 February 2023
- ...orem in [[discrepancy theory]] due to [[József Beck]] and [[Tibor Fiala]]. Discrepancy is concerned with coloring elements of a ground set such that each set in a *{{cite book |title=The Discrepancy Method: Randomness and Complexity |last=Chazelle |first=Bernard |author-lin ...3 KB (513 words) - 19:48, 16 May 2024
- Such sequences are commonly studied in [[discrepancy theory]]. ==Erdős discrepancy problem== ...6 KB (794 words) - 21:29, 23 February 2025
- ...he formula of Hlawka–Zaremba|Hlawka–Zaremba formula]] in the theory of low-discrepancy sequences. | title = Good lattice points, discrepancy, and numerical integration ...3 KB (445 words) - 11:04, 12 January 2025
- A '''discrepancy game''' is a kind of [[positional game]]. Like most positional games, it is ...l|last3=Spencer|first3=Joel|last4=Szabó|first4=Tibor|date=2005-09-29|title=Discrepancy Games|url=http://www.combinatorics.org/ojs/index.php/eljc/article/view/v12i ...4 KB (593 words) - 21:58, 14 October 2024
- ...ch for assessing their statistical independence properties is based on the discrepancy of ''s''-tuples of pseudorandom numbers. ==Discrepancy bounds of the GIC Generator== ...7 KB (1,154 words) - 04:19, 30 January 2023
- ...neering: a detailed account|series=Contemporary Mathematics|title=Operator theory, operator algebras, and applications|date=2006|volume=414|pages=299–355|arx ...il Srivastava|date=July 11, 2013|url=http://windowsontheory.org/2013/07/11/discrepancy-graphs-and-the-kadison-singer-conjecture-2/}}</ref> ...8 KB (1,276 words) - 01:42, 15 May 2024
- A '''Stein discrepancy''' is a [[Divergence (statistics)|statistical divergence]] between two [[pr is called a ''Stein discrepancy''.<ref name=":3" /> In contrast to the original integral probability metri ...27 KB (4,167 words) - 09:33, 25 February 2025
- {{about|decision theory|the use in computer science|Decision tree#Decision rules}} ...related to the concept of a [[strategy (game theory)|strategy]] in [[game theory]]. ...2 KB (353 words) - 12:10, 8 January 2025
- ...bound using an algorithm for ''online two-dimensional [[Discrepancy theory|discrepancy]] minimization''. ...9 KB (1,333 words) - 13:26, 24 August 2023
- | title = Matrix discrepancy and the log-rank conjecture | series = Annual ACM Symposium on the Theory of Computing ...4 KB (494 words) - 11:29, 17 December 2023
- ...ermore, it will be assumed that the inputs are [[Independence (probability theory)|independently]] and [[Uniform distribution (continuous)|uniformly]] distri ...timators. This is then known as the [[quasi-Monte Carlo method]]. Some low-discrepancy sequences commonly used in sensitivity analysis include the [[Sobol sequenc ...12 KB (1,988 words) - 20:08, 14 January 2025
- In [[probability theory]], '''integral probability metrics''' are types of [[metric (mathematics)|d ...journal |last1=Zolotarev |first1=V. M. |title=Probability Metrics |journal=Theory of Probability & Its Applications |date=January 1984 |volume=28 |issue=2 |p ...17 KB (2,422 words) - 15:34, 3 May 2024
- ...ze at least <math>m/2+(\log_3{m})/4</math>. Both proofs use theorems on [[Discrepancy of permutations]]. [[Category:Social choice theory]] ...11 KB (1,727 words) - 10:29, 22 July 2024
- *''Mathematics of Ramsey Theory'' ([[Jaroslav Nešetřil]] and [[Vojtěch Rödl]], eds., 1990, vol. 5) *''Matroid Theory and its Applications in Electric Network Theory and in Statics'' (Andras Recszki, 1989, vol. 6) ...4 KB (569 words) - 19:18, 5 July 2024
- ...rial Games: Tic-Tac-Toe Theory|title-link=Combinatorial Games: Tic-Tac-Toe Theory|last1=Beck|first1=József|date=2008|publisher=Cambridge University Press|isb ...me is finite, deterministic and has [[perfect information]]; therefore, in theory it is possible to create the full [[game tree]] and determine which of thes ...6 KB (940 words) - 14:32, 26 November 2024
- ...action lead to the development of the interpersonal adaptation theory. The theory states, individuals enter interactions with [[expectation (epistemic)|expec ...c Interaction Patterns'' in which they described their findings on a "new" theory which drew from the results of previous theories.<ref name=Burgoon1995 /><r ...18 KB (2,482 words) - 15:11, 12 February 2025
- ...divisors, and the ''a''<sub>''i''</sub> are rational numbers, called the [[discrepancy (algebraic geometry)|discrepancies]]. [[Category:Singularity theory]] ...5 KB (729 words) - 04:13, 12 December 2024