Termination of Multipartite Graph Series Arising from Complex Network Modelling

by   Matthieu Latapy, et al.

An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs. However, this approach has, until now, severe limitations resulting from its incapacity to reproduce a key property of this object: the overlapping nature of cliques in complex networks. In order to get rid of these limitations we propose to encode the structure of clique overlaps in a network thanks to a process consisting in iteratively factorising the maximal bicliques between the upper level and the other levels of a multipartite graph. We show that the most natural definition of this factorising process leads to infinite series for some instances. Our main result is to design a restriction of this process that terminates for any arbitrary graph. Moreover, we show that the resulting multipartite graph has remarkable combinatorial properties and is closely related to another fundamental combinatorial object. Finally, we show that, in practice, this multipartite graph is computationally tractable and has a size that makes it suitable for complex network modelling.


page 1

page 2

page 3

page 4


On the Termination of Some Biclique Operators on Multipartite Graphs

We define a new graph operator, called the weak-factor graph, which come...

Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number

In this study, we address the independent set enumeration problem. Altho...

Detecting strong cliques

A strong clique in a graph is a clique intersecting every maximal indepe...

Exact recovery of Planted Cliques in Semi-random graphs

In this paper, we study the Planted Clique problem in a semi-random mode...

First-order logic axiomatization of metric graph theory

The main goal of this note is to provide a First-Order Logic with Betwee...

GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs

We present a prototype of a software tool for exploration of multiple co...

A framework for modelling Molecular Interaction Maps

Metabolic networks, formed by a series of metabolic pathways, are made o...

Please sign up or login with your details

Forgot password? Click here to reset