A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at least
one vertex of each cycle of the graph. The feedback vertex set problem consists of …

The minimum dominating set (MDS) problem has wide applications in network science and
related fields. It aims at constructing a node set of smallest size such that any node of the …

Belief propagation is a well-studied algorithm for approximating local marginals of
multivariate probability distribution over complex networks, while tensor network states are …

When studying interacting systems, computing their statistical properties is a fundamental
problem in various fields such as physics, applied mathematics, and machine learning …

Tensor renormalization group (TRG) method is a real space renormalization group
approach. It has been successfully applied to both classical and quantum systems. In this …

We present an alternate method to close the master equation representing the continuous
time dynamics of interacting Ising spins. The method makes use of the theory of random …

A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such
that each vertex either belongs to this set or has at least one parent vertex in this set. We …

For a graph formed by vertices and weighted edges, a generalized minimum dominating set
(MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each …

Typical-case computation complexity is a research topic at the boundary of computer
science, applied mathematics, and statistical physics. In the last twenty years, the replica …

A directed graph (digraph) is formed by vertices and arcs (directed edges) from one vertex to
another. A feedback vertex set (FVS) is a set of vertices that contains at least one vertex of …