Search arXivSearch

arXiv · cond-mat/0204089

Economic Small-World Behavior in Weighted Networks

Abstract

The small-world phenomenon has been already the subject of a huge variety of papers, showing its appeareance in a variety of systems. However, some big holes still remain to be filled, as the commonly adopted mathematical formulation suffers from a variety of limitations, that make it unsuitable to provide a general tool of analysis for real networks, and not just for mathematical (topological) abstractions. In this paper we show where the major problems arise, and how there is therefore the need for a new reformulation of the small-world concept. Together with an analysis of the variables involved, we then propose a new theory of small-world networks based on two leading concepts: efficiency and cost. Efficiency measures how well information propagates over the network, and cost measures how expensive it is to build a network. The combination of these factors leads us to introduce the concept of {\em economic small worlds}, that formalizes the idea of networks that are "cheap" to build, and nevertheless efficient in propagating information, both at global and local scale. This new concept is shown to overcome all the limitations proper of the so-far commonly adopted formulation, and to provide an adequate tool to quantitatively analyze the behaviour of complex networks in the real world. Various complex systems are analyzed, ranging from the realm of neural networks, to social sciences, to communication and transportation networks. In each case, economic small worlds are found. Moreover, using the economic small-world framework, the construction principles of these networks can be quantitatively analyzed and compared, giving good insights on how efficiency and economy principles combine up to shape all these systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vito Latora, Massimo Marchiori. 2002-11-12. Economic Small-World Behavior in Weighted Networks. https://doi.org/10.1140/epjb%2Fe2003-00095-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Information geometry of perturbed gradient flow systems on hypergraphs: A perspective towards nonequilibrium physics

This article serves to concisely review the link between gradient flow systems on hypergraphs and information geometry which has been established within the last five years. Gradient flow systems describe a wealth of physical phenomena and provide powerful analytical technquies which are based on the variational energy-dissipation principle. Modern nonequilbrium physics has complemented this classical principle with thermodynamic uncertaintly relations, speed limits, entropy production rate decompositions, and many more. In this article, we formulate these modern principles within the framework of perturbed gradient flow systems on hypergraphs. In particular, we discuss the geometry induced by the Bregman divergence, the physical implications of dual foliations, as well as the corresponding infinitesimal Riemannian geometry for gradient flow systems. Through the geometrical perspective, we are naturally led to new concepts such as moduli spaces for perturbed gradient flow systems and thermodynamical area which is crucial for understanding speed limits. We hope to encourage the readers working in either of the two fields to further expand on and foster the interaction between the two fields.

cond-mat.stat-mech

Kinetic Interference in Translational Control: A Path-Measure Framework for Collision-Triggered Transcript Decay

I connect two literatures developed independently: the path-measure formulation of non-equilibrium statistical mechanics, where a trajectory action decomposes into a time-antisymmetric (entropic) and time-symmetric (frenetic) sector, and the stochastic modelling of ribosomal traffic on messenger RNA. The biological target is a proposed intervention -- antisense oligonucleotide (ASO) interference with wobble-uridine (U34) modification of transfer RNA -- whose intended effect is not to abolish translation but to perturb its timing, driving ribosome collisions and collision-triggered transcript decay preferentially on high-flux, codon-biased transcripts. Dynamical-activity and large-deviation analyses of generic lattice exclusion models -- notably the symmetric and totally asymmetric simple exclusion processes -- are well established. To my knowledge their formalization specifically for ribosomal traffic queues, translation elongation, and collision-triggered no-go decay remains unoccupied; this paper addresses that narrower gap, not the general one. Two claims here are load-bearing and untested. First, selectivity: transcripts whose loss is therapeutically desirable are separable, by vulnerable-codon-pair burden, from transcripts whose loss is toxic. Second, non-redundancy: the frenetic decomposition yields predictions, specific to ribosomal queueing and collision-triggered decay, not already obtainable from rate-level exclusion-process models or existing activity/large-deviation analyses of exclusion processes. This paper establishes neither. It specifies both as falsifiable tests with pre-registered decision rules, including outcomes under which the framework should be abandoned or narrowed. It is a research programme proposal, not a result. No new experimental, computational, or bioinformatic results are reported.

cond-mat.stat-mech

Thermodynamic efficiency of communication channels

We identify a broad class of communication channels that captures common physical constraints in both artificial and natural systems and derive bounds on their thermodynamic cost. We find that the entropy production per channel use is bounded from below by the input-output mutual information, and their ratio -mutual information divided by entropy production- defines the thermodynamic efficiency. Unlike previous studies of energy-constrained communication channels, our analysis shows that thermodynamic costs must be assigned not only to the input symbols themselves, but also to transitions between successive symbols. As a result, maximizing thermodynamic efficiency favors a biased input that switches only rarely, rather than the capacity-achieving input. For the binary symmetric channel, this preference emerges through a pitchfork bifurcation that spontaneously breaks the symmetry of the channel. A minimal model of cellular sensing exhibits the same phenomenon.

cond-mat.stat-mech