Take a smooth closed curve in the plane. At each self-intersection, randomly choose one of the two pieces and lift it up just out of the plane. (Perturb the curve so there are no triple intersections.) I don't really know anything about knot theory, so I don't even know if I'm asking the right questions here, but I'm wondering: What is the probability that this is the trivial knot? What can we say about how knotted this knot might be, and with what probabilities? (Measure "knottedness" in whatever way you like.) More generally, can we say anything about the probability of the various possible values in the usual invariants that people use to study knots?

I only have an idea of how to approach the first question, and even then it's only by brute force. I was just playing around with the easiest cases, and I think that with 0, 1, or 2 intersections, all knots are trivial, and with 3 intersections the knot is trivial with probability 75%.

A general analysis should presumably involve calculating the probability that we can simplify using various Reidemeister moves, but I don't know how to incorporate this. I'd imagine a computer could brute-force the first few cases pretty easily (I'm not so bold as to venture an order-of-magnitude guess on whether it's the first few hundred or the first few million)...