Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

Tensor networks enable researchers to tackle quantum physics problems previously thought to be solvable only by quantum computers. Credit: Lucy Reading-Ikkanda/Simons Foundation By applying a 1980s ...

NP-complete for general graphs APX-hard: difficult to approximate within a constant factor Generalizes well-known problems such as maximum clique and subgraph isomorphism ...

Dr. Clayton is a mathematician. Candidates for quantitative jobs — like those on Wall Street or in Silicon Valley — are sometimes asked offbeat questions such as: How many Ping-Pong balls fit in a 747 ...

Timely reconstruction of epidemic dynamics is essential for public health, and structured coalescent models constitute an essential tool for this purpose. However, statistical and computational ...

Using an advanced Monte Carlo method, Caltech researchers found a way to tame the infinite complexity of Feynman diagrams and solve the long-standing polaron problem, unlocking deeper understanding of ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

Abstract: Network Function Virtualization (NFV) has the potential for cost-efficiency, manage-convenience, and flexibility services but meanwhile poses challenges for the service function chain (SFC) ...

The original version of this story appeared in Quanta Magazine. For computer scientists, solving problems is a bit like mountaineering. First they must choose a problem to solve—akin to identifying a ...

Abstract: In applied and numerical algebraic geometry, many problems are reduced to computing an approximation to a real algebraic curve. In order to elevate the results of such a computation to the ...

We present a new optimization-based method for aggregating preferences in settings in which each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial ...