Renjie Song

Learn More
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter λ, each matching M is assigned a weight λ |M |. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem(More)
  • 1