Search references for BOOLEAN MODEL-PROBABILITY-THEORY. Phrases containing BOOLEAN MODEL-PROBABILITY-THEORY
See searches and references containing BOOLEAN MODEL-PROBABILITY-THEORY!BOOLEAN MODEL-PROBABILITY-THEORY
For statistics in probability theory, the Boolean-Poisson model or simply Boolean model for a random subset of the plane (or higher dimensions, analogously)
Boolean model (probability theory)
Boolean_model_(probability_theory)
Mathematical topics based on the works of George Boole
function that determines Boolean values or operators Boolean model (probability theory), a model in stochastic geometry Boolean network, a certain network
Boolean
Branch of mathematics in probability theory
simple power scheme. Stochastic geometry models of wireless networks Random graphs Boolean model (probability theory) Percolation thresholds Meester, R. (1996)
Continuum_percolation_theory
Mathematical model of ferromagnetism in statistical mechanics
pseudo-Boolean function; tools from the analysis of Boolean functions can be applied to describe and study it. The configuration probability is given
Ising_model
Overview of and topical guide to logic
form (Boolean algebra) Boolean conjunctive query Boolean-valued model Boolean domain Boolean expression Boolean ring Boolean function Boolean-valued
Outline_of_logic
Description of a system using mathematical concepts and language
values, but rather by probability distributions. A deductive model is a logical structure based on a theory. An inductive model arises from empirical
Mathematical_model
Classical information retrieval model
The (standard) Boolean model of information retrieval (BIR) is a classical information retrieval (IR) model where documents are retrieved based on whether
Boolean model of information retrieval
Boolean_model_of_information_retrieval
Number measuring the chance an event occurs
computer science, game theory, and philosophy to, for example, draw inferences about the expected frequency of events. Probability theory is also used to describe
Probability
Two closely related models for generating random graphs
graph theory, the Erdős–Rényi models are two closely related models for generating random graphs and the evolution of a random network. These models are
Erdős–Rényi_model
Mathematical theory on behavior of connected clusters in a random graph
mathematical model for obtaining a random graph, a site is "occupied" with probability p or "empty" (in which case its edges are removed) with probability 1 –
Percolation_theory
Interpretation of probability
the Boolean algebra of statements may be finite. Other axiomatizations have been suggested by various authors with the purpose of making the theory more
Bayesian_probability
Analysis of Boolean functions Balanced Boolean function Bent function Boolean algebras canonically defined Boolean function Boolean matrix Boolean-valued function
List of Boolean algebra topics
List_of_Boolean_algebra_topics
Problem of determining if a Boolean formula could be made true
In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY
Boolean satisfiability problem
Boolean_satisfiability_problem
Probability distribution
yes–no question, and each with its own Boolean-valued outcome: success (with probability p) or failure (with probability q = 1 − p). A single success/failure
Binomial_distribution
Algebraic manipulation of "true" and "false"
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the
Boolean_algebra
Set of elements in any of some sets
operations given by union, intersection, and complementation, is a Boolean algebra. In this Boolean algebra, union can be expressed in terms of intersection and
Union_(set_theory)
English mathematician and philosopher (1815–1864)
function that determines Boolean values or operators Boolean model (probability theory), a model in stochastic geometry Boolean network, a certain network
George_Boole
Function returning one of only two values
logical function), used in logic. Boolean functions are the subject of Boolean algebra and switching theory. A Boolean function takes the form f : { 0
Boolean_function
Type of random mathematical object
and BIC (Bayesian information criterion). Boolean model (probability theory) Continuum percolation theory Compound Poisson process Cox process Point
Poisson_point_process
System for reasoning about vagueness
of a probability theory for jointly modelling uncertainty and vagueness. Bart Kosko claims in Fuzziness vs. Probability that probability theory is a subtheory
Fuzzy_logic
Branch of mathematics that studies sets
set theory and fuzzy set theory, in which the value of an atomic formula embodying the membership relation is not simply True or False. The Boolean-valued
Set_theory
set theory. Algebra of sets Axiom of choice Axiom of countable choice Axiom of dependent choice Zorn's lemma Axiom of power set Boolean-valued model Burali-Forti
List_of_set_theory_topics
number Algebraic logic Boolean algebra (logic) Dialectica space categorical logic Finite model theory Descriptive complexity theory Model checking Trakhtenbrot's
List of mathematical logic topics
List_of_mathematical_logic_topics
Inherent difficulty of computational problems
resources, whatever the algorithm used. The theory formalizes this intuition, by introducing mathematical models of computation to study these problems and
Computational complexity theory
Computational_complexity_theory
Discrete set of Boolean variables
A Boolean network consists of a discrete set of Boolean variables each of which has a Boolean function (possibly different for each variable) assigned
Boolean_network
Probability distribution modeling a coin toss which need not be fair
outcomes that are Boolean-valued: a single bit whose value is success/yes/true/one with probability p and failure/no/false/zero with probability q. It can be
Bernoulli_distribution
Derivation of the laws of probability theory
laws of probability theory from a certain set of postulates. This derivation justifies the so-called "logical" interpretation of probability, as the laws
Cox's_theorem
Theory of machine learning
Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433–444
Computational_learning_theory
"Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer". In Creignou, N.; Le Berre, D. (eds.). Theory and Applications of Satisfiability
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Logical modeling technique
the probability of occurrence. ETA uses a type of modeling technique called "event tree", which branches events from one single event using Boolean logic
Event_tree_analysis
Sorting method in information retrieval
probabilistic model, probability theory has been used as a principal means for modeling the retrieval process in mathematical terms. The probability model of information
Ranking (information retrieval)
Ranking_(information_retrieval)
Model of computational complexity
In computational complexity theory, the decision tree model is the model of computation in which an algorithm can be considered to be a decision tree,
Decision_tree_model
measurement — it can be a Boolean value, a real number, a vector (in which case it is also called a data vector), etc. decision rule decision theory degrees of freedom
Glossary of probability and statistics
Glossary_of_probability_and_statistics
Form of reasoning
displaying short descriptions of redirect targets Decision theory – Branch of applied probability theory Defeasible reasoning – Reasoning that is rationally
Deductive_reasoning
Computational Formula that can be measured in terms of True or False
complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is
True quantified Boolean formula
True_quantified_Boolean_formula
Graph generated by a random process
process which generates them. The theory of random graphs lies at the intersection between graph theory and probability theory. From a mathematical perspective
Random_graph
(lattice theory) Boolean prime ideal theorem (mathematical logic) Bourbaki–Witt theorem (order theory) Cantor's isomorphism theorem (order theory) Dilworth's
List_of_theorems
Theories in mathematical logic
first-order theory is given by a set of axioms in some language. This entry lists some of the more common examples used in model theory and some of their
List_of_first-order_theories
Branch of logic
Finite model theory is a subarea of model theory. Model theory is the branch of logic which deals with the relation between a formal language (syntax)
Finite_model_theory
Network whose degree distribution follows a power law
generative model that mixes preferential attachment with a baseline probability of gaining a link. Another generative model is the copy model studied by
Scale-free_network
List of statements that appear to contradict themselves
theorem: Why do measured quantum particles not satisfy mathematical probability theory? Double-slit experiment: Matter and energy can act as a wave or as
List_of_paradoxes
Computer hardware technology that uses quantum mechanics
information eventually quickly decoheres. While programmers may depend on probability theory when designing a randomized algorithm, quantum-mechanical notions
Quantum_computing
Pair of logical equivalences
and Boolean algebra, however, they also play an important role in reasoning and computation. De Morgan's laws are utilized in probability theory, allowing
De_Morgan's_laws
Study of random spatial patterns
construction of elaborate random spatial patterns. The simplest version, the Boolean model, places a random compact object at each point of a Poisson point process
Stochastic_geometry
topology and set theory. Cohen 1. Paul Cohen 2. Cohen forcing is a method for constructing models of ZFC 3. A Cohen algebra is a Boolean algebra whose
Glossary_of_set_theory
Study of abstract machines and automata
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical
Automata_theory
Scale-free network generation algorithm
choosing an existing link, the probability of selecting a particular page would be proportional to its degree. The BA model claims that this explains the
Barabási–Albert_model
Concept in model theory
In model theory, interpretation of a structure M in another structure N (typically of a different signature) is a technical notion that approximates the
Interpretation_(model_theory)
Study of collection and analysis of data
Inferences made using mathematical statistics employ the framework of probability theory, which deals with the analysis of random phenomena. A standard statistical
Statistics
Relationship where one statement follows from another
penguin}. Abstract algebraic logic Ampheck Boolean algebra (logic) Boolean domain Boolean function Boolean logic Causality Deductive reasoning Logic gate
Logical_consequence
Model in network science
Bianconi–Barabási model depends on the fitness distribution ρ ( η ) {\displaystyle \rho (\eta )} . There are two scenarios that can happen based on the probability distribution
Bianconi–Barabási_model
with some fixed probability. Using the tools of percolation theory, a new type model referred to as a blinking Boolean-Poisson model, was proposed to
Stochastic geometry models of wireless networks
Stochastic_geometry_models_of_wireless_networks
Estimate of the importance of a word in a document
much theory, aside from a connection to Zipf's law. Attempts have been made to put idf on a probabilistic footing, by estimating the probability that
Tf–idf
Study of discrete mathematical structures
of combinatorial structures using tools from complex analysis and probability theory. In contrast with enumerative combinatorics which uses explicit combinatorial
Discrete_mathematics
Israeli mathematician
works included papers on limits of planar graphs,[BS] noise sensitivity of Boolean functions[BKS1] and first passage percolation[BKS2]. With Olle Häggström
Itai_Benjamini
In probability theory, a conditional event algebra (CEA) is an alternative to a standard, Boolean algebra of possible events (a set of possible events
Conditional_event_algebra
Area of physical and philosophical debate
quantum information and Bayesian probability and aims to eliminate the interpretational conundrums that have beset quantum theory. QBism deals with common questions
Interpretations of quantum mechanics
Interpretations_of_quantum_mechanics
Determining the probability of future events based on past events
represents probabilities of statements. Occam's razor says the "simplest theory, consistent with the data is most likely to be correct". The "simplest theory" is
Inductive_probability
Computable number Definable number Halting probability Algorithmic information theory Algorithmic probability Data compression Advice (complexity) Amortized
List of computability and complexity topics
List_of_computability_and_complexity_topics
In the mathematical theory of probability, Lewis's triviality result (named after David Lewis) is a theorem about the impossibility of systematically
Lewis's_triviality_result
Topological model
domain of the mask elements is {0,1,2,F,*}, or {T,F,*} for the boolean form. The simpler models 4-Intersection and 9-Intersection were proposed before DE-9IM
DE-9IM
Axiomatic set theories based on the principles of mathematical constructivism
admits a surjection from a Boolean topos onto it, relating to classical statements being provable intuitionistically. In type theory, the expression " x →
Constructive_set_theory
Set which cannot be assigned a meaningful "volume"
introduction. Historically, this led Borel and Kolmogorov to formulate probability theory on sets which are constrained to be measurable. The measurable sets
Non-measurable_set
Theory of logic to account for observations from quantum theory
propositions to a Boolean algebra. Consequently, quantum logic struggles to represent the passage of time. One possible workaround is the theory of quantum filtrations
Quantum_logic
Probabilistic classification algorithm
at quantifying uncertainty (with naive Bayes models often producing wildly overconfident probabilities). However, they are highly scalable, requiring
Naive_Bayes_classifier
Academic field of logic and rhetoric
Argumentation theory is the interdisciplinary study of how conclusions can be supported or undermined by premises through logical reasoning. With historical
Argumentation_theory
Computer system simulating intelligence
analytical model of the task to be processed and a prewritten program, i.e. a fixed set of instructions. The models used are based on Boolean logic (also
Computational_intelligence
American mathematician (1916–2001)
information theory", and the man who laid the foundations of the Information Age. Shannon was among the first to describe the use of Boolean algebra—essential
Claude_Shannon
Equivalence of average-case and expected complexity
addition, the algorithm must have probability 0 or 1 of generating any particular answer on the remaining inputs. For any Boolean function, the minimum complexity
Yao's_principle
Mathematical term; concerning axioms used to derive theorems
the theory of probabilities to theoretical physics. Israel comments also on cultural resistance, at least in France and Italy, to this "German model" and
Axiomatic_system
Mathematical method of risk analysis
Probability bounds analysis is essentially a combination of the methods of standard interval analysis and classical probability theory. Probability bounds
Probability_bounds_analysis
Theory within consciousness research
Integrated information theory (IIT) proposes a mathematical model for the consciousness of a system. It comprises a framework ultimately intended to explain
Integrated_information_theory
distributional, or local. Any random graph model (at a fixed set of parameter values) results in a probability distribution on graphs, and those that are
Maximum-entropy random graph model
Maximum-entropy_random_graph_model
Algebraic ring that need not have additive negative elements
lattices. The smallest semiring that is not a ring is the two-element Boolean algebra, for instance with logical disjunction ∨ {\displaystyle \lor }
Semiring
Taxonomy of statistical data elements
in that dichotomous categorical variables may be represented with the Boolean data type, polytomous categorical variables with arbitrarily assigned integers
Statistical_data_type
Set of problems in computational complexity theory
function problems) and using other models of computation (e.g. probabilistic Turing machines, interactive proof systems, Boolean circuits, and quantum computers)
Complexity_class
Logical connective
built on foundations such as modal logic, relevance logic, probability theory, and causal models. Similar discrepancies have been observed by psychologists
Material_conditional
Technique invented by Paul Cohen for proving consistency and independence results
picked in this Boolean algebra, which assigns values true/false to statements of our theory. The point is that the resulting theory has a model that contains
Forcing_(mathematics)
Algorithm to be run on quantum computers
time. Consider an oracle consisting of n random Boolean functions mapping n-bit strings to a Boolean value, with the goal of finding n n-bit strings z1
Quantum_algorithm
Variable representing a random phenomenon
(2014), Introduction to Queueing Theory and Stochastic Teletraffic Models (PDF), arXiv:1307.2968 Zukerman, Moshe (2014), Basic Probability Topics (PDF)
Random_variable
Theorem in quantum mechanics
represents a new theory of probability, one in which the structure of the space of possible events is modified from the classical, Boolean algebra thereof
Gleason's_theorem
Data structure for approximate set membership
counting Bloom filter variant); the more items added, the larger the probability of false positives. Bloom proposed the technique for applications where
Bloom_filter
Family of random graph models
distribution and cover time of sparse directed configuration models". Probability Theory and Related Fields. 178 (3): 1011–1066. arXiv:1909.05752. doi:10
Configuration_model
Branch of discrete mathematics
problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas
Combinatorics
Logic with discrete truth values
finite-valued logic. However, finite-valued logic can be applied in Boolean-valued modeling, description logics, and defuzzification of fuzzy logic. A finite-valued
Finite-valued_logic
Representation of a type of random process
In statistics, an autoregressive (AR) model is a modelled representation of a type of random process. It can be used to describe time-varying processes
Autoregressive_model
Method of deriving conclusions
2022, Lead section, § 2. Proof Theory Demey, Kooi & Sack 2023, Lead section, § 1. Combining Logic and Probability Theory, § 2.1 Probabilistic Semantics
Rule_of_inference
Clustering and community detection algorithm
C_prime changes the quality function in the positive direction, set the probability that the community of v to exp(1/θ * ∆HP(v → C)) else set it to 0 for
Leiden_algorithm
Study of graphs as a representation of relations between discrete objects
science, network theory is a part of graph theory. It defines networks as graphs where the vertices or edges possess attributes. Network theory analyses these
Network_theory
Statistical models for network analysis
outnumbers the number of parameters which can constrain the model, the ideal probability distribution is the one which maximizes the Gibbs entropy. Let
Exponential family random graph models
Exponential_family_random_graph_models
Mixing property of Markov chains and graphs
In theoretical computer science, graph theory, and mathematics, the conductance is a parameter of a Markov chain that is closely tied to its mixing time
Conductance_(graph_theory)
Concept in network science
relationship to the Erdős–Rényi model. The planted partition model is the special case that the values of the probability matrix P {\displaystyle P} are
Stochastic_block_model
Inference seeking the simplest and most likely explanation
explicitly so in his influential 1883 "A theory of probable inference", in which he returns to involving probability in the hypothetical conclusion. Like
Abductive_reasoning
Network representing spatial objects
But in this case, space intervenes in the fact that the connection probability between two individuals usually decreases with the distance between them
Spatial_network
List of algebraic structures List of Boolean algebra topics List of category theory topics List of cohomology theories List of commutative algebra topics
Lists_of_mathematics_topics
Properties of the operation of a secure cipher
where the designers preferred the permutation layer to consist of linear Boolean functions, although nonlinear functions can be used, too. In Shannon's
Confusion_and_diffusion
Measure of algorithmic complexity
(1968). "Logical basis for information theory and probability theory". IEEE Transactions on Information Theory. 14 (5): 662–664. doi:10.1109/TIT.1968
Kolmogorov_complexity
Probabilistic optimization technique and metaheuristic
search space is discrete (for example the traveling salesman problem, the boolean satisfiability problem, protein structure prediction, and job-shop scheduling)
Simulated_annealing
Machine learning algorithm
box or open-box model. If a given situation is observable in a model the explanation for the condition is easily explained by Boolean logic. By contrast
Decision_tree_learning
Julia Sergeevna (October 1998). "Solution of Boolean equations". Computational Mathematics and Modeling. 9 (4): 287–295. doi:10.1007/BF02409862. S2CID 122112834
Platon_Poretsky
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY
BOOLEAN MODEL-PROBABILITY-THEORY