Search PubMed⌕ Search

Biomedical subjects

Ljupco Kocarev

Publications and source records attributed to Ljupco Kocarev.

9 recordsLinked to original sources

Estimating topology of networks.

We suggest a method for estimating the topology of a network based on the dynamical evolution supported on the network. Our method is robust and can be also applied when disturbances and/or modeling errors are presented. Several examples with networks of phase oscillators, pulse-coupled Hindmarch-Rose neurons, and Lorenz oscillators are provided to illustrate our approach.

Journal Article↗

Distribution of edge load in scale-free trees.

Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and non-scale-free trees. We aim at the probability distribution of edge betweenness under the condition that a local property, the in-degree of the "younger" node of a randomly selected edge, is known. En route to the conditional distribution of edge betweenness the exact joint distribution of cluster size and in-degree, and its one-dimensional marginal distributions have been presented in the paper as well. From the derived probability distributions the expectation values of different quantities have been calculated. Our results provide an exact solution not only for infinite, but for finite networks as well.

Journal Article↗

Synchronization in power-law networks.

We consider realistic power-law graphs, for which the power-law holds only for a certain range of degrees. We show that synchronizability of such networks depends on the expected average and expected maximum degree. In particular, we find that networks with realistic power-law graphs are less synchronizable than classical random networks. Finally, we consider hybrid graphs, which consist of two parts: a global graph and a local graph. We show that hybrid networks, for which the number of global edges is proportional to the number of total edges, almost surely synchronize.

Algorithms↗

Finite-space Lyapunov exponents and pseudochaos.

We propose a definition of finite-space Lyapunov exponent. For discrete-time dynamical systems, it measures the local (between neighboring points) average spreading of the system. We justify our definition by showing that, for large classes of chaotic maps, the corresponding finite-space Lyapunov exponent approaches the Lyapunov exponent of a chaotic map when M-->infinity, where M is the cardinality of the discrete phase space. In analogy with continuous systems, we say the system has pseudochaos if its finite-space Lyapunov exponent tends to a positive number (or to +infinity), when M-->infinity.

Journal Article↗

Public-key encryption with chaos.

We propose public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman (RSA), ElGamal, and Rabin. For the case of generalized RSA algorithm we discuss in detail its software implementation and properties. We show that our algorithm is as secure as RSA algorithm.

Journal Article↗

When are synchronization errors small?

We address the question of bounds on the synchronization error for the case of nearly identical nonlinear systems. It is pointed out that negative largest conditional Lyapunov exponents of the synchronization manifold are not sufficient to guarantee a small synchronization error and that one has to find bounds for the deformation of the manifold due to perturbations. We present an analytic bound for a simple subclass of systems, which includes the Lur'e systems, showing that the bound for the deformation grows as the largest singular value of the linearized system gets larger. Then, the Lorenz system is taken as an example to demonstrate that the phenomenon is not restricted to Lur'e systems.

Journal Article↗

Lyapunov exponents, noise-induced synchronization, and Parrondo's paradox.

We show that Lyapunov exponents of a stochastic system, when computed for a specific realization of the noise process, are related to conditional Lyapunov exponents in deterministic systems. We propose to use the term stochastically induced regularity instead of noise-induced synchronization and explain the reason why. The nature of stochastically induced regularity is discussed: in some instances, it is a dynamical analog of Parrondo's paradox.

Journal Article↗

A unifying definition of synchronization for dynamical systems.

We propose a unifying definition for synchronization between stationary finite dimensional deterministic dynamical systems. By example, we show that the synchronization phenomena discussed in the dynamical systems literature fits within the framework of this definition, and discuss problems with previous definitions of synchronization. We conclude with a discussion of possible extensions of the definition to infinite dimensional systems described by partial differential equations and/or systems where noise is present. (c) 2000 American Institute of Physics.

Journal Article↗

Synchronizing spatiotemporal chaos.

We show analytically and numerically that a pair of uni-directionally coupled spatially extended systems can synchronize. For the case of partial differential equations the synchronization can be achieved by applying the scalar driving signals only at finite number of space points. Our approach is very general and can be useful for practical applications since the synchronization is achieved via feeding in the response system only the information from certain (discrete) spatial locations of the drive system. We also stress some open problems in the field of synchronization of spatiotemporal chaos. (c) 1997 American Institute of Physics.

Journal Article↗