The Setting
A random hyperedge can connect several vertices at once. The library defines connectivity and source clusters for labelled hypergraphs, including suppression at a prescribed vertex set.
The Definition
Definition 1. A labelled hypergraph on a vertex set with label set is an indexed family of vertex subsets, written as in (1). (1)✦
A configuration is an assignment of a state to each label, with meaning that label is open. For parameters , the Bernoulli product law on configurations is given by (2). (2)✦
For a suppression set , open adjacency in is the relation on vertices that holds when they belong to a common open hyperedge disjoint from , as in (3). (3)✦
Open connectivity in is the relation on vertices that holds when they are joined by a finite adjacency path, allowing length zero, as in (4). (4)✦
For fixed , the source cluster of a vertex is the set of vertices connected to in (5). (5)✦
The cluster union of a source set is the union of the source clusters of vertices in , with , and fixed, as in (6). (6)✦
For a target set , connection from to is the relation that holds when is connected to at least one vertex of in with configuration and suppression set , as in (7). (7)✦
In the paper, the result reads: a finite hypergraph has a finite vertex set and a finite labelled family of nonempty vertex subsets, labels may repeat the same subset, open hyperedges join all their vertices, each cluster contains its source, is the union of the source clusters, and deleting removes its vertices and every hyperedge meeting .
What Is Checked
The hypergraph and connectivity definitions are stated over arbitrary vertex and label sets, with suppression and source or target subsets of the vertex set; the product law uses one parameter for each label.