What's the fastest way to sample a random walk on a directed graph conditional on the start and end points?
-
-
what distribution are you after? this is uniform over all complete paths (almost by def: you're removing all edges that aren't on a path, then splitting p mass at each branch)
-
The prior is that each exit from a node is equally probable.
- Još 3 druga odgovora
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.