377 citations · 698 across the 10 of their papers we have counts for
5 papers · 1 filter
Entropy distribution and condensation in random networks with a given degree distribution
Kartik Anand, Dimitri Krioukov, Ginestra Bianconi
The entropy of network ensembles characterizes the amount of information encoded in the network structure, and can be used to quantify network complexity, and the relevance of give…
The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
Kartik Anand, Ginestra Bianconi, Simone Severini
Entropic measures of complexity are able to quantify the information encoded in complex network structures. Several entropic measures have been proposed in this respect. Here we st…
Gibbs entropy of networks ensembles by cavity methods
Kartik Anand, Ginestra Bianconi
The Gibbs entropy of a microcanonical network ensemble is the logarithm of the number of network configurations compatible with a set of hard constraints. This quantity characteriz…
Entropy measures for complex networks: Toward an information theory of complex topologies
Kartik Anand, Ginestra Bianconi
The quantification of the complexity of networks is, today, a fundamental problem in the physics of complex systems. A possible roadmap to solve the problem is via extending key co…
Stability and dynamical properties of material flow systems on random networks
Kartik Anand, Tobias Galla
The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graph…