edgepedia

All articles starting with R

22,461 articles

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 Hearts

Random Hearts is a 1999 American romantic drama directed by Sydney Pollack. It stars Harrison Ford and Kristin Scott Thomas as two strangers whose spouses die in a plane crash.

Random House

Random House: American trade book publisher founded in New York in 1927 by Bennett Cerf and Donald Klopfer; published the first authorized U.S. Ulysses; acquired by Bertelsmann in 1998 and merged with Penguin in 2013 to form Penguin Random House.

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 Network Distillation

Random Network Distillation (RND) is an exploration method for deep reinforcement learning, introduced in 2018 by OpenAI and University of Edinburgh researchers, that reached above-average human performance on Montezuma's Revenge.

Random neural network

The random neural network is a probabilistic neural network model in which neurons exchange excitatory and inhibitory spikes, introduced by Erol Gelenbe in 1989 and analyzed with queueing theory.

Random number generation

Random number generation is the production of numbers that lack a predictable pattern, drawn from physical processes or deterministic algorithms, and used in cryptography, Monte Carlo simulation, games, and testing.

Random optimization

Random optimization is a derivative-free stochastic direct-search method introduced by Matyás in 1965, which perturbs the current best point randomly and moves only on improvement.

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 play dance

Random play dance (랜덤플레이댄스, RPD) is a K-pop game, first played on the show Weekly Idol in 2011, where dancers must instantly match randomly played song snippets.

Random projection

Random projection is a dimensionality reduction method that multiplies high-dimensional data by a randomly generated matrix, approximately preserving pairwise distances; the Johnson–Lindenstrauss lemma guarantees the needed target dimension.

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 search

Random search is an optimization method that samples candidate settings at random and returns the best one found, widely used for hyperparameter tuning in machine learning.

Random survival forest

A random survival forest (RSF) is an ensemble machine learning method that adapts Leo Breiman's random forests to survival analysis, predicting time-to-event outcomes from right-censored data using randomized survival trees.

Random testing (software testing)

Random testing is a software testing method that samples inputs at random from a program's input domain, records failing inputs, and quantifies reliability statistically when no input fails.

Random Thoughts

Random Thoughts (Suixianglu, also translated as Reflections) is a collection of 150 essays by the Chinese writer Ba Jin, written from 1978 to 1986 and reflecting on the Cultural Revolution.

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.