the random d-process corresponds to a natural algorithmic model for generating d-regular graphs: starting with an empty graph on n vertices, it evolves by sequentially adding new random edges so that the maximum degree remains at most d.

in 1999 wormald conjectured that the final graph of the random d-process is "similar" to a uniform random d-regular graph.

we show that this conjecture does not extend to a natural generalization of this process with mixed degree restrictions, i.e., where each vertex has its own degree restriction (under some mild technical assumptions). 
our proof uses the method of switchings, which is usually only applied to uniform random graph models -- rather than to stochastic processes.

based on joint work in progress with mike molloy and erlang surya.