Is there a way to obtain a random connected poset on n unlabelled elements in sage?
Random preferably means uniformly at random, but other randomness might be okay if it is not too far away from uniform. Generating all posets, checking for connectedness and picking is way too slow. Equivalently, what about random connected acyclic graphs ? I find sage: from sage.graphs.graph_generators_pyx import RandomGNP sage: D = RandomGNP(10, .2, directed = True) but this ignores connected (not too bad) and acyclic (bad), and doesn't seeem to be close is not even close to uniformly at random. Thanks, Christian -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
