Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0206410

Optimal network topologies for local search with congestion

R. Guimera·A. Arenas·A. Diaz-Guilera·F. Vega-Redondo·A. Cabrales
View original source ↗Read source document ↗Export metadata ↓

Abstract

The problem of searchability in decentralized complex networks is of great importance in computer science, economy and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and obtain expressions for the average search cost--written in terms of the search algorithm and the topological properties of the network--both in presence and abscence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: star-like configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when the number of parallel searches is large.

Explore related subjects

cond-mat.dis-nncs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. Guimera, A. Arenas, A. Diaz-Guilera, F. Vega-Redondo, A. Cabrales. 2002-10-21. Optimal network topologies for local search with congestion. https://doi.org/10.1103/physrevlett.89.248701

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

KEEP EXPLORING

Related papers

arXiv2026

Tunable periodic cascade of delocalization transitions in non-Hermitian IAAF model

Cascade of delocalization transitions provides a route to multi-step control of delocalization, yet achieving a programmable periodic cascade remains a challenge. Here, we demonstrate a tunable periodic cascade of delocalization transitions in a non-Hermitian interpolating Aubry-André-Fibonacci (IAAF) model by introducing an imaginary phase shift into the quasiperiodic potential. Such a periodic cascade of delocalization transitions arises from the competition between kinetic-energy-facilitated delocalization and gain-loss-regulated localization. In numerical static localization characterizations, successive regular stripe patterns for localized and extended states emerge in phase diagrams. We also derive an analytical expression for the cascade period and find that it relies solely on the imaginary phase shift. This provides a direct way of continuously tuning the cascade period via a single control parameter. Complementary static and dynamical diagnostics consistently confirm this periodic cascade of delocalization transitions in the non-Hermitian IAAF system. Our findings identify a novel class of delocalization transitions with tunable cascading periods, opening a route toward experimentally programmable control of delocalization.

cond-mat.dis-nn↗
arXiv2026

Microscopic Mechanism and Control of Reentrant Localization

Increasing quasiperiodic modulation can restore extended states after localization, raising the question of how the same modulation drives both localization and recovery. We identify a microscopic mechanism in quasiperiodic dimer chains by resolving scattering between Fourier channels. Specifically, scattering into neighboring channels and back shifts the spectral edge relative to a localization boundary determined by a neutral auxiliary resonance. Their successive crossings drive the same spectral packet with fixed integrated-density-of-states (IDS) labels into localization and back into an extended regime. This recovery persists across finite parameter ranges in both gap-opening families, including relative-phase detuning. Furthermore, an exact sublattice mapping enables compensated control of the recovery window and predicts recovery thresholds for individual IDS labels.

cond-mat.dis-nn↗
arXiv2026

Dynamical mean-field theory for associative memory with block-correlated patterns

In associative memories storing correlated patterns, retrieval of individual memories can compete with symmetric mixed states. A dynamical description is needed to determine how the initial state selects between these outcomes. We extend the generating-functional dynamical mean-field theory (DMFT) for independent patterns to independent blocks of correlated binary patterns of fixed finite size. The resulting effective single-neuron process has a self-consistent cross-talk noise covariance and self-feedback coefficients that depend on the block-covariance eigenvalues. For hierarchically correlated patterns with nonmonotonic transfer, increasing the loading can permit retrieval from an imperfect initial state before further loading prevents it. DMFT reproduces the retrieval trajectories and basin geometry found in direct simulations. Near the lower boundary of this re-entrant region, direct networks reveal stationary saddles separating coexisting mixed and target-retrieval states. Parameter sensitivities of DMFT trajectories predict nearby shifts of this boundary. At the tested upper boundary, retrieval remains accessible from initial states with larger target overlap, indicating a change in basin access. Under fixed-point convergence assumptions, the theory recovers the equations of generalized self-consistent signal-to-noise analysis.

cond-mat.dis-nn↗