Randomized algorithms - approximation, generation and counting

  title={Randomized algorithms - approximation, generation and counting},
  author={Russ Bubley},
  booktitle={Distinguished dissertations},
  • Russ Bubley
  • Published in Distinguished dissertations 1 March 2000
  • Mathematics
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain… 
A Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas
A series of linear procedures are presented which when they are integrated into a main program, allow us to compute in polynomial time the number of models of a formula F in 2-CF when the constraint graph GF holds the following condition.
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
This algorithm is the first polynomial time MCMC algorithm for closed Jackson networks with multiple servers, and two new ergodic Markov chains are proposed, both of which have a unique stationary distribution that is the product form solution forclosed Jackson networks.
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Polynomial-time Randomized Approximation and Perfect Sampler for Closed Jackson Networks with Single Servers
This paper proposes the first fully polynomial-time randomized approximation scheme (FPRAS) for basic queueing networks, closed Jackson networks with single servers, based on MCMC (Markov chain Monte Carlo) method.
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets
It is shown that if the depth-first graph of G does not contain a pair of basic cycles with common edges, then NI(G) can be computed in linear time (in the size of the graph) and determines new classes of instances of graphs without restrictions on their degrees.
On Sampling Simple Paths in Planar Graphs According to Their Lengths
This work considers the problem of sampling simple paths between two given vertices in a planar graph and proposes a natural Markov chain exploring such paths by means of “local” modifications, and shows that this chain is always ergodic and thus it converges to the desired sampling distribution for any planar graphs.
New Polynomial Classes for #2SAT Established Via Graph-Topological Structure
It is shown that, if the depth-search over the constrained graph of a formula generates a tree where the set of fundamental cycles are disjointed, then #2SAT is tractable and can be applied to impact directly in the re- duction of the complexity time of the algorithms for Boolean formulas.
An Enumerative Algorithm for #2SAT
Polynomial time perfect sampler for discretized dirichlet distribution
A perfect (exact) sampling algorithm according to a discretized Dirichlet distribution is proposed, which simulates transitions of the chain O(n 3 lnΔ) times where n is the dimension (the number of parameters) and 1/Δ is the grid size for discretization.
A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs
This paper presents a polynomial time algorithm for counting the number of independent sets on a special class of graphs called cactus graphs, based on previous results on unicyclic graphs.