42,772 articles
Randall Goldsmith
Randall H. Goldsmith is an American physical and analytical chemist at the University of Wisconsin–Madison known for detecting individual molecules without fluorescent labels using optical microcavities.
Randall Q. Snurr
Randall Q. Snurr is a chemical engineer and the John G. Searle Professor at Northwestern University, known for computationally designing nanoporous materials, especially metal–organic frameworks.
Randall–Sundrum model
The Randall–Sundrum model, proposed by Lisa Randall and Raman Sundrum in 1999, uses a warped extra dimension to explain the vast gap between the Planck and weak scales.
Randles circuit
The Randles circuit, also called the Randles cell, is an equivalent electrical circuit proposed by John Randles in 1947 to model faradaic electrode reactions in electrochemical impedance spectroscopy.
Random assignment
Random assignment, or randomized assignment, places study participants into experimental conditions by chance, balancing known and unknown factors between groups; R. A. Fisher first stated the requirement in 1925.
Random attractor
A random attractor is a family of compact sets in a random dynamical system that attracts all bounded sets, introduced by Crauel, Debussche, and Flandoli in 1997.
Random circuit sampling
Random circuit sampling (RCS) is a benchmark that samples bit strings from a random quantum circuit's output; it underpinned Google's 2019 Sycamore quantum supremacy claim and is #P-hard classically.
Random degree
A random degree is an equivalence class of infinite binary sequences compared by relative randomness, most commonly the K-degrees induced by prefix-free Kolmogorov complexity of initial segments.
Random digit dialing
Random digit dialing (RDD) is a probability sampling method for telephone surveys that generates random phone numbers so unlisted households are covered, standard in election polling.
Random dynamical system
A random dynamical system is a mathematical model of dynamics driven by noise, developed systematically by Ludwig Arnold, that extends invariant measures, attractors, and bifurcation analysis to randomly forced systems.
Random forcing
Random forcing, also called Solovay forcing, is a set-theoretic forcing method, introduced by Robert Solovay in the 1960s, that adjoins a real avoiding all null sets.
Random geometric graph
A random geometric graph is a random graph whose vertices are points scattered in a geometric space, with edges joining pairs within a fixed distance, introduced by Edgar Gilbert in 1961.
Random graph
A random graph, or random network, is a graph whose edges are placed by random rules, a field founded by Paul Erdős and Alfréd Rényi in the late 1950s.
Random graph matching
Random graph matching is the problem of recovering the hidden vertex correspondence between two correlated random graphs, studied for its sharp thresholds and applications like network de-anonymization.
Random graph process
A random graph process is a random sequence of graphs that starts empty and gains one random edge per step, introduced by Erdős and Rényi in 1960.
Random graph process with choice
A random graph process with choice samples several candidate edges at each step and adds one selected by a rule, best studied in the Achlioptas process introduced around 2000.
Random greedy algorithm
The random greedy algorithm is a randomized construction method that builds a maximal matching or independent set by repeatedly choosing at random among non-conflicting objects until none remain.
Random matrix
A random matrix is a matrix whose entries are drawn from a probability distribution; random matrix theory, begun by Wigner in the 1950s, studies their eigenvalue statistics.
Random measure
A random measure is a measure-valued random object in probability theory, assigning a measure to each experimental outcome, with point processes as its key integer-valued special case.
Random oracle model
The random oracle model is a cryptographic proof technique treating a hash function as a perfectly random public function, formulated by Bellare and Rogaway in 1993.
Random permutation
A random permutation is a random ordering of n items in which every one of the n! possible orderings is equally likely, as in a fair shuffle.
Random permutation statistics
Random permutation statistics studies quantities computed from a uniformly random permutation, such as cycles, descents, and inversions, including their distributions and limiting behavior as n grows.
Random phase approximation
The random phase approximation (RPA) is a many-body method that computes screening and correlation energy of interacting electron systems by summing ring diagrams to infinite order.
Random regression model
A random regression model is a mixed statistical model expressing fixed and random effects as continuous functions of a covariate such as age or time.
Random regular graph
A random regular graph is a graph chosen uniformly at random from all graphs on n vertices with every vertex having the same degree d, the model G(n, d).
Random sample consensus
Random sample consensus (RANSAC) is an iterative method for fitting a mathematical model to data with many outliers, introduced by Fischler and Bolles of SRI International in 1981.
Random sampling
Random sampling selects units from a population by chance so every unit has a known probability of selection, allowing results to be generalized with calculable error.
Random tree
A random tree is a tree drawn from a probability distribution, such as a uniformly chosen combinatorial tree or the family tree of a Galton–Watson branching process.
Random variable
A random variable, also called a stochastic or aleatory variable, is a function that assigns a number to each outcome of a random experiment, formalized by Kolmogorov in 1933.
Random vibration
Random vibration is vibration whose amplitude and frequency vary unpredictably in time, described statistically by power spectral density and used in engineering to simulate launch, transport, and turbulent-flow environments.