Balance in random signed intersection graphs

We propose a new model for random signed graphs, namely the signed random intersection graphs model. In particular, each vertex of a signed graph is associated with a (finite) universal set of features. For each feature, every vertex can have either a positive, a negative or an indifferent view towards that feature with probability p; q and 1-p-q respectively. Based on the value of a metric that measures the level of agreement between a pair of vertices towards the set of predefined features, an edge may be added between these two vertices which has either a positive or a negative sign. Under this framework, we initiate the study of random signed intersection graphs by providing several preliminary results concerning the number of conflicting views among all vertices using the well-known notion of balance in signed graphs.