I would have done the following: 0) take a connected random graph (call graphs.RandomGNP in a loop, until you get something connected) 1) take a random ordering of vertices, say v1,v2,...,vn. 2) orient each edge (vi,vj) in the direction j>i.
While this might not be uniform on the probability space of acyclic orientations, perhaps it's good enough for your purposes. On Thursday, November 30, 2017 at 9:07:21 AM UTC, Christian Stump wrote: > > 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.
