Networks with arbitrary edge multiplicities

  title={Networks with arbitrary edge multiplicities},
  author={Vinko Zlatic and Diego Garlaschelli and Guido Caldarelli},
  journal={EPL (Europhysics Letters)},
One of the main characteristics of real-world networks is their large clustering. Clustering is one aspect of a more general but much less studied structural organization of networks, i.e. edge multiplicity, defined as the number of triangles in which edges, rather than vertices, participate. Here we show that the multiplicity distribution of real networks is in many cases scale free, and in general very broad. Thus, besides the fact that in real networks the number of edges attached to… 

Figures from this paper

Deciphering the global organization of clustering in real complex networks
The clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular, supporting the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.
The role of clustering in the stucture and function of complex networks
The role played by clustering in the structure and function of complex networks is studied, and it is analytically proved that multiple percolation transitions are possible in networks that are sufficiently weakly connected.
How random are complex networks
This work considers six real networks and finds that many important local and global structural properties of these networks are closely reproduced by $dk$-random graphs whose degree distributions, degree correlations, and clustering are as in the corresponding real network.
Bond percolation on a class of correlated and clustered random graphs
It is argued that the multitype approach coupled with the use of clustered hyperedges can reproduce a wide spectrum of complex patterns, and thus enhances the capability to model real complex networks.
Network structure from a characterization of interactions in complex systems
Surprisingly, it is found that particularly key constituents of functional networks—as identified with betweenness and eigenvector centrality—coincide with ground truth to a high degree, while global topological and spectral properties—clustering coefficient, average shortest path length, assortativity, and synchronizability—clearly deviate.
Quantifying randomness in real networks
This work considers six real networks and finds that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network.
The core decomposition of networks: theory, algorithms and applications
In this survey, an in-depth discussion of core decomposition is performed, focusing mainly on the basic theory and fundamental concepts, the algorithmic techniques proposed for computing it efficiently under different settings, and the applications that can benefit significantly from it.
Tweaking synchronization by connectivity modifications.
It is shown that in particular short cycles can lead to a maximum change of the Laplacian's eigenvalue spectrum, dictating the synchronization properties of such networks.
Latent geometry of bipartite networks
This model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartites clustering, and proposes an efficient method to infer the latent pairwise distances between nodes.
Detecting new edge types in a temporal network model
This work develops an effective technique to detect undiscovered new edge types in networks by leveraging a novel temporal network model and finds that when time is finite, the method is still significantly more accurate than the baseline.


Analytical maximum-likelihood method to detect patterns in real networks
This work proposes a fast method that allows one to obtain expectation values and standard deviations of any topological property analytically across the entire graph ensemble, for any binary, weighted, directed or undirected network.
On the rich-club effect in dense and weighted networks
This work focuses on dense and weighted networks, proposing a suitable null model and studying the behaviour of the degree correlations as measured by the rich-club coefficient, and represents a generalization of the richest network to weighted networks which is complementary to other recently proposed ones.
The entropy of randomized network ensembles
This paper characterize these randomized network ensembles by their entropy, i.e. the normalized logarithm of the total number of networks which are part of these ensemble, and proposes entropy as an indicator to assess the role of each structural feature in a given real network.
It is still unknown whether there are families of tight knots whose lengths grow faster than linearly with crossing numbers, but the largest power has been reduced to 3/z, and some other physical models of knots as flattened ropes or strips which exhibit similar length versus complexity power laws are surveyed.
Scale-free networks
PRE 82
  • 066118
  • 2010
PRE 80
  • 036107
  • 2009
Physics Reports
  • Education
Scale-Free Networks (Oxford
  • 2007