Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0211498

Self-similar community structure in organisations

R. Guimera·L. Danon·A. Diaz-Guilera·F. Giralt·A. Arenas
View original source ↗Read source document ↗Export metadata ↓

Abstract

The formal chart of an organisation is designed to handle routine and easily anticipated problems, but unexpected situations arise which require the formation of new ties so that the corresponding extra tasks can be properly accomplished. The characterisation of the structure of such informal networks behind the formal chart is a key element for successful management. We analyse the complex e-mail network of a real organisation with about 1,700 employees and determine its community structure. Our results reveal the emergence of self-similar properties that suggest that some universal mechanism could be the underlying driving force in the formation and evolution of informal networks in organisations, as happens in other self-organised complex systems.

Explore related subjects

cond-mat.dis-nn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. Guimera, L. Danon, A. Diaz-Guilera, F. Giralt, A. Arenas. 2002-11-22. Self-similar community structure in organisations. https://doi.org/10.1103/physreve.68.065103

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↗