arXiv subjects

W. Kinzel

Publications and source records attributed to W. Kinzel.

At least 19 recordsLinked to original sources

arXiv2012

Transient to Zero-Lag Synchronization in Excitable Networks

The scaling of transient times to zero-lag synchronization in networks composed of excitable units is shown to be governed by three features of the graph representing the network: the longest path between pairs of neurons (diameter), the largest loop (circumference) and the loop with the maximal average out degree. The upper bound of transient times can vary between O(1) and O(N2), where N is the size of the network, and its scaling can be predicted in many scenarios from finite time accumulated information of the transient. Results challenge the assumption that functionality of neural networks might depend solely upon the synchronized repeated activation such as zero-lag synchronization.

q-bio.NC↗

arXiv2012

Random Symmetry Breaking and Freezing in Chaotic Networks

Parameter space of a driven damped oscillator in a double well potential presents either a chaotic trajectory with sign oscillating amplitude or a non-chaotic trajectory with a fixed sign amplitude. A network of such delay coupled damped oscillators is shown to present chaotic dynamics while the amplitude sign of each damped oscillator is randomly frozen. This phenomenon of random broken global symmetry of the network simultaneously with random freezing of each degree of freedom is accompanied by the existence of exponentially many randomly frozen chaotic attractors with the ize of the network. Results are exemplified by a network of modified Duffing oscillators with infinite ange pseudo-inverse delayed interactions.

nlin.CD↗

arXiv2011

Coexistence of exponentially many chaotic spin-glass attractors

A chaotic network of size $N$ with delayed interactions which resembles a pseudo-inverse associative memory neural network is investigated. For a load $\alpha=P/N<1$, where $P$ stands for the number of stored patterns, the chaotic network functions as an associative memory of 2P attractors with macroscopic basin of attractions which decrease with $\alpha$. At finite $\alpha$, a chaotic spin glass phase exists, where the number of distinct chaotic attractors scales exponentially with $N$. Each attractor is characterized by a coexistence of chaotic behavior and freezing of each one of the $N$ chaotic units or freezing with respect to the $P$ patterns. Results are supported by large scale simulations of networks composed of Bernoulli map units and Mackey-Glass time delay differential equations.

nlin.CD↗

arXiv2011

Nonlocal mechanism for cluster synchronization in neural circuits

The interplay between the topology of cortical circuits and synchronized activity modes in distinct cortical areas is a key enigma in neuroscience. We present a new nonlocal mechanism governing the periodic activity mode: the greatest common divisor (GCD) of network loops. For a stimulus to one node, the network splits into GCD-clusters in which cluster neurons are in zero-lag synchronization. For complex external stimuli, the number of clusters can be any common divisor. The synchronized mode and the transients to synchronization pinpoint the type of external stimuli. The findings, supported by an information mixing argument and simulations of Hodgkin Huxley population dynamic networks with unidirectional connectivity and synaptic noise, call for reexamining sources of correlated activity in cortex and shorter information processing time scales.

nlin.CD↗

arXiv2011

Synchronization of chaotic networks with time-delayed couplings: An analytic study

Networks of nonlinear units with time-delayed couplings can synchronize to a common chaotic trajectory. Although the delay time may be very large, the units can synchronize completely without time shift. For networks of coupled Bernoulli maps, analytic results are derived for the stability of the chaotic synchronization manifold. For a single delay time, chaos synchronization is related to the spectral gap of the coupling matrix. For networks with multiple delay times, analytic results are obtained from the theory of polynomials. Finally, the analytic results are compared with networks of iterated tent maps and Lang-Kobayashi equations which imitate the behaviour of networks of semiconductor lasers.

nlin.CD↗

arXiv2010

Synchronization of unidirectional time delay chaotic networks and the greatest common divisor

We present the interplay between synchronization of unidirectional coupled chaotic nodes with heterogeneous delays and the greatest common divisor (GCD) of loops composing the oriented graph. In the weak chaos region and for GCD=1 the network is in chaotic zero-lag synchronization, whereas for GCD=m>1 synchronization of m-sublattices emerges. Complete synchronization can be achieved when all chaotic nodes are influenced by an identical set of delays and in particular for the limiting case of homogeneous delays. Results are supported by simulations of chaotic systems, self-consistent and mixing arguments, as well as analytical solutions of Bernoulli maps.

nlin.CD↗

arXiv2005

System Parameters of the Transiting Extrasolar Planet HD 209458b

We derive improved system parameters for the HD 209458 system using a model that simultaneously fits both photometric transit and radial velocity observations. The photometry consists of previous Hubble Space Telescope STIS and FGS observations, twelve I-band transits observed between 2001-2003 with the Mt. Laguna Observatory 1m telescope, and six Stromgren b+y transits observed between 2001-2004 with two of the Automatic Photometric Telescopes at Fairborn Observatory. The radial velocities were derived from Keck/HIRES observations. The model properly treats the orbital dynamics of the system, and thus yields robust and physically self-consistent solutions. Our set of system parameters agrees with previously published results though with improved accuracy. For example, applying robust limits on the stellar mass of 0.93-1.20Msun, we find 1.26 < Rplanet < 1.42 Rjup and 0.59 < Mplanet < 0.70 Mjup. We can reduce the uncertainty on these estimates by including a stellar mass-radius relation constraint, yielding Rplanet = 1.35 +/- 0.07 Rjup and Mplanet = 0.66 +/- 0.04 Mjup. Our results verify that the planetary radius is 10-20% larger than predicted by planet evolution models, confirming the need for an additional mechanism to slow the evolutionary contraction of the planet. A revised ephemeris is derived, T0=2452854.82545 + 3.52474554E (HJD), which now contains an uncertainty in the period of 0.016s and should facilitate future searches for planetary satellites and other bodies in the HD 209458 system.

astro-ph↗

arXiv2003

Cooperating Attackers in Neural Cryptography

A new and successful attack strategy in neural cryptography is presented. The neural cryptosystem, based on synchronization of neural networks by mutual learning, has been recently shown to be secure under different attack strategies. The advanced attacker presented here, named the ``Majority-Flipping Attacker'', is the first whose success does not decay with the parameters of the model. This new attacker's outstanding success is due to its using a group of attackers which cooperate throughout the synchronization process, unlike any other attack strategy known. An analytical description of this attack is also presented, and fits the results of simulations.

cond-mat.dis-nn↗

arXiv2002

Secure exchange of information by synchronization of neural networks

A connection between the theory of neural networks and cryptography is presented. A new phenomenon, namely synchronization of neural networks is leading to a new method of exchange of secret messages. Numerical simulations show that two artificial networks being trained by Hebbian learning rule on their mutual outputs develop an antiparallel state of their synaptic weights. The synchronized weights are used to construct an ephemeral key exchange protocol for a secure transmission of secret data. It is shown that an opponent who knows the protocol and all details of any transmission of the data has no chance to decrypt the secret message, since tracking the weights is a hard problem compared to synchronization. The complexity of the generation of the secure channel is linear with the size of the network.

cond-mat.stat-mech↗

arXiv2001

Kinetic Monte Carlo Simulations of dislocations in heteroepitaxial growth

We determine the critical layer thickness for the appearance of misfit dislocations as a function of the misfit between the lattice constants of the substrate and the adsorbate from Kinetic Monte Carlo (KMC) simulations of heteroepitaxial growth. To this end, an algorithm is introduced which allows the off-lattice simulation of various phenomena observed in heteroepitaxial growth including critical layer thickness for the appearance of misfit dislocations, or self-assembled island formation. The only parameters of the model are deposition flux, temperature and a pairwise interaction potential between the particles of the system. Our results are compared with a theoretical treatment of the problem and show good agreement with a simple power law.

cond-mat.mtrl-sci↗

arXiv2001

Particle currents and the distribution of terrace sizes in unstable epitaxial growth

A solid-on-solid model of epitaxial growth in 1+1 dimensions is investigated in which slope dependent upward and downward particle currents compete on the surface. The microscopic mechanisms which give rise to these currents are the smoothening incorporation of particles upon deposition and an Ehrlich-Schwoebel barrier which hinders inter-layer transport at step edges. We calculate the distribution of terrace sizes and the resulting currents on a stepped surface with a given inclination angle. The cancellation of the competing effects leads to the selection of a stable magic slope. Simulation results are in very good agreement with the theoretical findings.

cond-mat.stat-mech↗

arXiv2000

On time's arrow in Ehrenfest models with reversible deterministic dynamics

We introduce a deterministic, time-reversible version of the Ehrenfest urn model. The distribution of first-passage times from equilibrium to non-equilibrium states and vice versa is calculated. We find that average times for transition to non-equilibrium always scale exponentially with the system size, whereas the time scale for relaxation to equilibrium depends on microscopic dynamics. To illustrate this, we also look at deterministic and stochastic versions of the Ehrenfest model with a distribution of microscopic relaxation times.

cond-mat.stat-mech↗

arXiv2000

A New Stochastic Strategy for the Minority Game

We present a variant of the Minority Game in which players who where successful in the previous timestep stay with their decision, while the losers change their decision with a probability $p$. Analytical results for different regimes of $p$ and the number of players $N$ are given and connections to existing models are discussed. It is shown that for $p \propto 1/N$ the average loss $σ^2$ is of the order of 1 and does not increase with $N$ as for other known strategies.

cond-mat.stat-mech↗

arXiv2000

The influence of the crystal lattice on coarsening in unstable epitaxial growth

We report the results of computer simulations of epitaxial growth in the presence of a large Schwoebel barrier on different crystal surfaces: simple cubic(001), bcc(001), simple hexagonal(001) and hcp(001). We find, that mounds coarse by a step edge diffusion driven process, if adatoms can diffuse relatively far along step edges without being hindered by kink-edge diffusion barriers. This yields the scaling exponents alpha = 1, beta = 1/3. These exponents are independent of the symmetry of the crystal surface. The crystal lattice, however, has strong effects on the morphology of the mounds, which are by no means restricted to trivial symmetry effects: while we observe pyramidal shapes on the simple lattices, on bcc and hcp there are two fundamentally different classes of mounds, which are encompanied by characteristic diffusion currents: a metastable one with rounded corners, and an actively coarsening configuration, which breaks the symmetry given by the crystal surface.

cond-mat.stat-mech↗

arXiv2000

Interacting Neural Networks

Several scenarios of interacting neural networks which are trained either in an identical or in a competitive way are solved analytically. In the case of identical training each perceptron receives the output of its neighbour. The symmetry of the stationary state as well as the sensitivity to the used training algorithm are investigated. Two competitive perceptrons trained on mutually exclusive learning aims and a perceptron which is trained on the opposite of its own output are examined analytically. An ensemble of competitive perceptrons is used as decision-making algorithms in a model of a closed market (El Farol Bar problem or Minority Game); each network is trained on the history of minority decisions. This ensemble of perceptrons relaxes to a stationary state whose performance can be better than random.

cond-mat.dis-nn↗

arXiv2000

Dynamics of Interacting Neural Networks

The dynamics of interacting perceptrons is solved analytically. For a directed flow of information the system runs into a state which has a higher symmetry than the topology of the model. A symmetry breaking phase transition is found with increasing learning rate. In addition it is shown that a system of interacting perceptrons which is trained on the history of its minority decisions develops a good strategy for the problem of adaptive competition known as the Bar Problem or Minority Game.

cond-mat.dis-nn↗

arXiv1999

The role of step edge diffusion in epitaxial crystal growth

The role of step edge diffusion (SED) in epitaxial growth is investigated. To this end we revisit and extend a recently introduced simple cubic solid-on-solid model, which exhibits the formation and coarsening of pyramid or mound like structures. By comparing the limiting cases of absent, very fast (significant), and slow SED we demonstrate how the details of this process control both the shape of the emerging structures as well as the scaling behavior. We find a sharp transition from significant SED to intermediate values of SED, and a continuous one for vanishing SED. We argue that one should be able to control these features of the surface in experiments by variation of the flux and substrate temperature.

cond-mat.stat-mech↗

arXiv1999

Unconventional MBE Strategies from Computer Simulations for Optimized Growth Conditions

We investigate the influence of step edge diffusion (SED) and desorption on Molecular Beam Epitaxy (MBE) using kinetic Monte-Carlo simulations of the solid-on-solid (SOS) model. Based on these investigations we propose two strategies to optimize MBE growth. The strategies are applicable in different growth regimes: During layer-by-layer growth one can exploit the presence of desorption in order to achieve smooth surfaces. By additional short high flux pulses of particles one can increase the growth rate and assist layer-by-layer growth. If, however, mounds are formed (non-layer-by-layer growth) the SED can be used to control size and shape of the three-dimensional structures. By controlled reduction of the flux with time we achieve a fast coarsening together with smooth step edges.

cond-mat.stat-mech↗