3 citations · 4 across the 4 of their papers we have counts for
5 papers
Simulating Gaussian boson sampling on graphs in polynomial time
Konrad Anand, Zongchen Chen, Mary Cryan +4
We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from th…
Modified log-Sobolev inequalities for strongly log-concave distributions
Mary Cryan, Heng Guo, Giorgos Mousa
We show that the modified log-Sobolev constant for a natural Markov chain which converges to an -homogeneous strongly log-concave distribution is at least . Applications in…
Exact counting of Euler Tours for Graphs of Bounded Treewidth
Prasad Chebolu, Mary Cryan, Russell Martin
In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs a…
The number of Euler tours of a random directed graph
Páidí Creed, Mary Cryan
In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asym…
Exact counting of Euler Tours for generalized series-parallel graphs
Prasad Chebolu, Mary Cryan, Russell Martin
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm…