I'm looking for a reference for the statement that almost every partial order on $n$ elements has trivial automorphism group. I've been told that this is a folklore result. Does anyone know of a good reference?

Not for partial orders, but for many classes of structures, check out Ralph Freese and his 1990 article "On the two kinds of probability in algebra". It talks about labeled versus unlabeled structures, and notes how probabilities for them are similar since most automorphism groups will be trivial. You might find something useful in his bibliography.
– The Masked AvengerMar 6 '14 at 17:11

If you let $L$ be a linear extension of your partial order, then it seems you can almost always construct at least some automorphisms by swapping adjacent elements of $L$. The only time this wouldn't work is if your partial order is already a total order. Am I missing something here?
– Kevin P. CostelloMar 6 '14 at 19:23

1

@KevinP.Costello Could you explain why one almost always gets an automorphism? (It's clear that not just any pair of adjacent elements of $L$ can be swapped: for example, adjacent elements may have different degrees in the comparability graph that corresponds to the underlying partial order.)
– Andrew UzzellMar 7 '14 at 12:27

@AndrewUzzell, and that indeed is what I was missing. Sorry about the mistake.
– Kevin P. CostelloMar 7 '14 at 18:24