A graph is $r$-regular if all its vertices have the same degree $r$. A random $r$-regular graph with $n$ vertices is a graph sampled uniformly at random from the set of all $r$-regular graphs on $n$ vertices.

Entanglement is one of the most striking features of quantum mechanics and it gives rise to situations that are not possible classically. For example, a subsystem can have more disorder than the whole system.

In ``multiGigabit systems having digital signal processing (DSP) based transceiver architectures, the analog-to-digital converter (ADC) is a critical component due to the cost and power requirements of high precision ADC.