Constraints and entropy in a model of network evolution

  title={Constraints and entropy in a model of network evolution},
  author={Philip Tee and Ian Wakeman and George Parisis and Jonathan H. P. Dawes and Istv{\'a}n Zolt{\'a}n Kiss},
  journal={The European Physical Journal B},
Abstract Barabási–Albert’s “Scale Free” model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real… 
Phase Transitions in Spatial Networks as a Model of Cellular Symbiosis
Experimental simulations of Random Geometric or Spatial Graphs demonstrate that distance functions that model the mixing of the cells, can create phase transitions in connectivity, and thus cellular interactions, an important result that could provide analytical tools to model the transition of tumors from benign to malignant states.
Relating Vertex and Global Graph Entropy in Randomly Generated Graphs
This paper investigates the existence of a correlation between vertex level and global measures of entropy for a narrow subset of random graphs and uses the greedy algorithm approximation for calculating the chromatic information and therefore Körner entropy.
Quantum Mesh Dynamics (QMD)
A consistent quantum theory of gravity has remained elusive ever since the emergence of General Relativity and Quantum Field Theory. Attempts to date have not yielded a candidate that is either free
Network events in a large commercial network: What can we learn?
It is suggested that the development of methods for inferring functional connectivity could unlock more of the informational value of event log messages and assist network management operators.
Identification of Non-stationary and Non-linear Drying Processes
In this work the identification of the yeast drying process was presented and models for different time intervals of the closed control system were developed.
The role of graph entropy in fault localization and network evolution
A novel approach to improving the scalability of event processing using a mathematical property of networks, graph entropy, is outlined and a constrained model of network evolution is presented, which demonstrates better quantitative agreement with real world networks than the preferential attachment model.
Critical behavior of spatial networks as a model of paracrine signaling in tumorigenesis
The hypothesis that cell to cell interaction is a critical feature of malignancy in tumors is supported by analysis and simulations of dynamic evolution of Spatio-Temporal graphs, and it is demonstrated that the distance function relative to the mixing of the nodes can combine to create phase transitions in connectivity.


Statistical mechanics of complex networks
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Random networks with sublinear preferential attachment: Degree evolutions
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law
Random initial condition in small Barabasi-Albert networks and deviations from the scale-free behavior.
It is argued that the size of the initial network core and its density of connections may be the main responsible for the exponential truncation of the power-law behavior observed in some small scale-free networks.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
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.
Graph evolution: Densification and shrinking diameters
A new graph generator is provided, based on a forest fire spreading process that has a simple, intuitive justification, requires very few parameters, and produces graphs exhibiting the full range of properties observed both in prior work and in the present study.
On the formation of structure in growing networks
Based on the formation of triad junctions, the mechanism proposed in this paper generates networks that exhibit extended rather than single power law behavior. Triad formation guarantees strong
Vertex Entropy As a Critical Node Measure in Network Monitoring
This paper introduces local vertex measures of entropy which approximate global entropy, with the advantage of locality and ease of computation, and establishes properties that vertex entropy must have in order to be useful for identifying critical nodes.
Structure of growing networks with preferential linking.
The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal.