Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1303.4421

Analysis of Remote Synchronization in Complex Networks

Lucia Valentina Gambuzza·Alessio Cardillo·Alessandro Fiasconaro·Luigi Fortuna·Jesús Gómez-Gardeñes·Mattia Frasca
View original source ↗Read source document ↗Export metadata ↓

Abstract

A novel regime of synchronization, called remote synchronization, where the peripheral nodes form a phase synchronized cluster not including the hub, was recently observed in star motifs. We show the existence of a more general dynamical state of remote synchronization in arbitrary networks of coupled oscillators. This state is characterized by the synchronization of pairs of nodes that are not directly connected via a physical link or any sequence of synchronized nodes. This phenomenon is almost negligible in networks of phase oscillators as its underlying mechanism is the modulation of the amplitude of those intermediary nodes between the remotely synchronized units. Our findings thus show the ubiquity and robustness of these states and bridge the gap from their recent observation in simple toy graphs to complex networks.

Explore related subjects

physics.soc-phnlin.AO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucia Valentina Gambuzza, Alessio Cardillo, Alessandro Fiasconaro, Luigi Fortuna, Jesús Gómez-Gardeñes, Mattia Frasca. 2013-10-02. Analysis of Remote Synchronization in Complex Networks. https://doi.org/10.1063/1.4824312

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

KEEP EXPLORING

Related papers

arXiv2026

Who Moves the Deity? Mechanics, Participation, and Attributed Agency in Himalayan Rath Carrying

People carry ritual palanquins, or raths, while describing themselves as following a deity's movement. This study combines western Himalayan ethnography, motor-control research and synthetic mechanics to explain how practical contribution and attributed agency relate. It distinguishes knowing a destination, preparing for a load change, influencing local movement and attributing an episode's purpose. An oracle-mediated travel proposal connects divine initiative to practical responsibility; accounts of rehearsal, shoulder adjustment, upright carrying and a narrated return identify distinct forms of participation. Using assumed parameters and prescribed shoulder motions, a two-support model separates heave from roll, and a four-contact walking extension adds pitch. The extension demonstrates substantial changes in individual loads with negligible rocking and shows how pitch and contact opening affect load sharing. A worked comparison with an upright-carrying account explains how visible posture can conceal changing support. These findings connect ritual authority, bodily preparation and local physical influence while specifying evidence that distinguishes guidance, anticipation, correction and retrospective interpretation. The resulting account treats following as an organised form of participation: people can sustain and adjust a movement while attributing its initiative and purpose to the deity.

physics.soc-ph↗
arXiv2026

Warned alike, AI agents avoid the less-crowded road while people take it

AI agents built on a few shared models increasingly act for many people. A shared forecast about others can align their choices and change how scarce capacity is allocated. We tested this feedback in a two-road congestion game. Adding one sentence warning that others might follow a routing tip made populations of 50 GPT agents crowd one road while avoiding the nearly empty alternative. Average travel time rose from 64 to 95 min, although any crowded-road agent could have saved 69 min by switching alone. The warning discouraged the very move it predicted. The pattern persisted for 100 rounds. Two other model families shifted the same way without locking onto one road. Twelve all-human groups (240 participants) stayed near balance under numerical reports or the tip and warning. In 24 mixed groups with a further 240 participants, imbalance grew with the share of agents in the registered analysis, while people increasingly took the road the agents avoided. Collective costs stayed below the allagent reference, but with 15 agents and 5 humans, agent seats averaged 80 min, compared with 44 min for human seats. Shared forecasts can thus sustain collective inefficiency among similar agents. A better group average can also hide an unequal burden. Evaluations of AI agents that share resources should test populations, treat messages as interventions and report who bears the costs.

physics.soc-ph↗
arXiv2026

Reachability Does Not Imply Searchability in Expanding Networks

Routing and search respond in opposite ways to rapid network expansion. Short graph distances make a known destination easy to reach, while the neighborhood accessible within a few hops can be vastly larger than any finite inspection budget. We show that this tension imposes an algorithm-independent constraint on sparse search. If $m_q$ relevant nodes are placed without structural information among $N$ nodes and at most $M$ nodes can be inspected, any target-blind exploration protocol has success probability at most $Mm_q/N$, irrespective of correlations between successive inspections, of revisits, and of any structural preference the exploration rule may have. Geometry determines when this constraint becomes relevant: a target becomes accessible with order-one probability when the graph-distance ball volume satisfies $V(R_c)\sim N/m_q$. At this scale, any inspection mechanism achieving a fixed success probability $δ>0$ must enrich the probability of inspecting relevant nodes by at least order $N/(Mm_q)$ relative to the neutral target density. For uniformly searched candidate sets, this entails a vanishing visible fraction of the accessible region. Thus rapidly expanding networks can make rare targets geometrically close while target-blind search remains ineffective. Numerical results on Krioukov hyperbolic random graphs and two-dimensional lattices show that this separation can arise within only a few hops in the rapidly expanding case, while the lattice accessibility radius grows algebraically.

physics.soc-ph↗