Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userConnecting complex networks to nonadditive entropies
369
0
0.0
(
0
)
Added by
Samura\\'i Gomes de Aguiar Brito
Publication date
2020
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Boltzmann-Gibbs statistical mechanics applies satisfactorily to a plethora of systems. It fails however for complex systems generically involving strong space-time entanglement. Its generalization based on nonadditive $q$-entropies adequately handles a wide class of such systems. We show here that scale-invariant networks belong to this class. We numerically study a $d$-dimensional geographically located network with weighted links and exhibit its energy distribution per site at its quasi-stationary state. Our results strongly suggest a correspondence between the random geometric problem and a class of thermal problems within the generalised thermostatistics. The Boltzmann-Gibbs exponential factor is generically substituted by its $q$-generalisation, and is recovered in the $q=1$ limit when the nonlocal effects fade away. The present connection should cross-fertilise experiments in both research areas.
rate research
Read More
The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduced in the literature, and point out their advantages and limitations. The concepts are illustrated by simple examples as well as by empirical data of the world trade and weighted coauthorship networks.
Many real-world complex networks arise as a result of a competition between growth and rewiring processes. Usually the initial part of the evolution is dominated by growth while the later one rather by rewiring. The initial growth allows the network to reach a certain size while rewiring to optimise its function and topology. As a model example we consider tree networks which first grow in a stochastic process of node attachment and then age in a stochastic process of local topology changes. The ageing is implemented as a Markov process that preserves the node-degree distribution. We quantify differences between the initial and aged network topologies and study the dynamics of the evolution. We implement t
Homochirality, i.e. the dominance across all living matter of one enantiomer over the other among chiral molecules, is thought to be a key step in the emergence of life. Building on ideas put forward by Frank and many others, we proposed recently one such mechanism in G. Laurent et al., PNAS (2021) based on the properties of large out of equilibrium chemical networks. We showed that in such networks, a phase transition towards an homochiral state is likely to occur as the number of chiral species in the system becomes large or as the amount of free energy injected into the system increases. This paper aims at clarifying some important points in that scenario, not covered by our previous work. We first analyze the various conventions used to measure chirality, introduce the notion of chiral symmetry of a network, and study its implications regarding the relative chiral signs adopted by different groups of molecules. We then propose a generalization of Franks model for large chemical networks, which we characterize completely using methods of random matrices. This analysis can be extended to sparse networks, which shows that the emergence of homochirality is a robust transition.
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as non-interacting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.
We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes with smaller number of links are more prone to extreme events than the ones with larger number of links. We obtain analytical estimates and verify them with numerical simulations. They are shown to be robust even when random walkers follow shortest path on the network. The results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle an extreme event.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
