A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
Linked
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
Evolution and Structure of the Internet: A Statistical Physics Approach
Evolution and Structure of the Internet: A Statistical Physics Approach
Theoretical Computer Science - Complex networks
Efficiently covering complex networks with cliques of similar vertices
Theoretical Computer Science - Complex networks
Relevance of massively distributed explorations of the internet topology: qualitative results
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data reduction and exact algorithms for clique cover
Journal of Experimental Algorithmics (JEA)
A scale-free graph model based on bipartite graphs
Discrete Applied Mathematics
Node degree distribution in affiliation graphs for social network density modeling
SocInfo'10 Proceedings of the Second international conference on Social informatics
Termination of multipartite graph series arising from complex network modelling
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Business intelligence approach to support modelling and analysis of complex economic networks
International Journal of Networking and Virtual Organisations
Worst-case optimal fingerprinting codes for non-threshold collusion
DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems
Intrinsically dynamic network communities
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scale invariant bipartite graph generative model
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Degree distributions of evolving alphabetic bipartite networks and their projections
Theoretical Computer Science
Extracting hierarchies with overlapping structure from network data
Proceedings of the Winter Simulation Conference
Modeling affiliations in networks
Proceedings of the Winter Simulation Conference
Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Text clustering using one-mode projection of document-word bipartite graphs
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.89 |
The analysis and modelling of various complex networks has received much attention in the last few years. Some such networks display a natural bipartite structure: two kinds of nodes coexist with links only between nodes of different kinds. This bipartite structure has not been deeply studied until now, mainly because it appeared to be specific to only a few complex networks. However, we show here that all complex networks can be viewed as bipartite structures sharing some important statistics, like degree distributions. The basic properties of complex networks can be viewed as consequences of this underlying bipartite structure. This leads us to propose the first simple and intuitive model for complex networks which captures the main properties met in practice.