The protein-protein interaction (PPI) networks are dynamically organized as modules, and are typically described by hub dichotomy: 'party' hubs act as intramodule hubs and are coexpressed with their partners, yet 'date' hubs act as coordinators among modules and are incoherently expressed with their partners. However, there remains skepticism about the existence of hub dichotomy. Since differen...

We introduce a new general polynomial-time constructionthe fibre constructionwhich reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction problem CSP(P), where P is any subprojective relational system. As a consequence we get a new proof (not using universal algebra) that CSP(P) is NP -complete for any subprojective (and thus also projective) relational system. The fi...

Psychologists have often categorized human aggression as hostile or instrumental. Hostile aggression is "hot," impulsive behavior that is motivated by a desire to hurt someone; instrumental aggression is "cold," premeditated behavior used as a means to some other end. This dichotomy was useful to the early development of aggression theories and continues to capture important features of nonhuma...

Holant problems are a family of counting problems on graphs, parametrised by sets of complexvalued functions of Boolean inputs. HOLANTc denotes a subfamily of those problems, where any function set considered must contain the two unary functions pinning inputs to values 0 or 1. The complexity classification of Holant problems usually takes the form of dichotomy theorems, showing that for any se...

In the distributed function computation problem, dichotomy theorems, initiated by Han-Kobayashi, seek to classify functions by whether the rate regions for function computation improve on the Slepian-Wolf regions or not. In this paper, we develop a general approach to derive converse bounds on the distributed function computation problem. By using this approach, we recover the sufficiency part,...