Synchronization of random walks with reflecting boundaries

DOI10.1088/0305-4470/37/36/003MaRDI QIDQ4654377zbMATH OpenOpenAlexFDO

Authors Andreas Ruttor, G. Reents, Wolfgang Kinzel

Publication date 4 March 2005

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0405369

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: Reflecting boundary conditions cause two one-dimensional random walks to synchronize if a common direction is chosen in each step. The mean synchronization time and its standard deviation are calculated analytically. Both quantities are found to increase proportional to the square of the system size. Additionally, the probability of synchronization in a given step is analyzed, which converges to a geometric distribution for long synchronization times. From this asymptotic behavior the number of steps required to synchronize an ensemble of independent random walk pairs is deduced. Here the synchronization time increases with the logarithm of the ensemble size. The results of this model are compared to those observed in neural synchronization.

Recommendations

• Complex networks: when random walk dynamics equals synchronization
• scientific article; zbMATH DE number 5033175
• Random talk: Random walk and synchronizability in a moving neighborhood network
• Synchronization and functional central limit theorems for interacting reinforced random walks
• Practical synchronization of Winfree oscillators in a random environment

Cited in

(2)

• Neural cryptography with queries
• Complex networks: when random walk dynamics equals synchronization

This page was built for publication: Synchronization of random walks with reflecting boundaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654377)