We propose a new latent Boolean feature model for complex networks that captures different types of node interactions and network communities. The model is based on a new concept in graph theory, termed the co-intersection representation of a graph, which generalizes the notion of an intersection representation. We describe how to use co-intersection representations to deduce node feature sets and their communities, and proceed to derive several general bounds on the minimum number of features used in co-intersection representations. We also discuss graph families for which exact co-intersection characterizations are possible, and describe algorithms for computing co-intersection numbers and assignments.
|Title of host publication
|Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - Aug 10 2016
|2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: Jul 10 2016 → Jul 15 2016
|IEEE International Symposium on Information Theory - Proceedings
|2016 IEEE International Symposium on Information Theory, ISIT 2016
|7/10/16 → 7/15/16
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics