The Setting
A vertex splitting redistributes the edges incident to a vertex among labelled copies of that vertex. Let be a finite simple graph. The set of oriented edges of is (1)✦ For an oriented edge of in (1), the tail and head are given by and , respectively. For an oriented edge of , the reverse edge is the oriented edge given by .✦
The set also supplies the copy labels: labels a copy of . A tail-preserving incidence assignment for is a map satisfying (2). (2) Fix a subset of admissible incidences.
For a real parameter , the exceptional mass constant is the real number given by (3). (3)✦ The entropy bound constant and the smoothing bound constant are the real numbers given by (4). (4)
The Definition
Definition 1. Let be a tail-preserving incidence assignment for , and let be a set of admissible incidences. The admissible splitting graph is the graph on whose adjacency relation is given by (5). (5)✦ For a real parameter , the splitting constant is the real number given by (6). (6)✦
In the paper, the result reads: use the common-time kernels supplied by Lemma 4.1 and jointly sample all their rows; for vertex weights and a parameter , call a label at incidence admissible when , group the neighbors with the same admissible label at into , create a copy of weight for every nonempty group, retain an edge between its assigned copies when both incidence labels are admissible, and put .
What Is Checked
The construction is stated over a finite simple graph , a tail-preserving map of its oriented edges, an arbitrary admissibility set , and a real parameter . The adjacency relation in (5) is symmetric and loopless.