arXiv subjects

Erik Bollt

Publications and source records attributed to Erik Bollt.

40 records · Page 3Linked to original sources

arXiv2006

Basis Markov Partitions and Transition Matrices for Stochastic Systems

We analyze dynamical systems subjected to an additive noise and their deterministic limit. In this work, we will introduce a notion by which a stochastic system has something like a Markov partition for deterministic systems. For a chosen class of the noise profiles the Frobenius-Perron operator associated to the noisy system is exactly represented by a stochastic transition matrix of a finite size K. This feature allows us to introduce for these stochastic systems a basis--Markov partition, defined herein, irrespectively of whether the deterministic system possesses a Markov partition or not. We show that in the deterministic limit, corresponding to K --> infinity, the sequence of invariant measures of the noisy systems tends, in the weak sense, to the invariant measure of the deterministic system. Thus by introducing a small additive noise one may approximate transition matrices and invariant measures of deterministic dynamical systems.

nlin.CD↗

arXiv2006

A Fast and Accurate Nonlinear Spectral Method for Image Recognition and Registration

This article addresses the problem of two- and higher dimensional pattern matching, i.e. the identification of instances of a template within a larger signal space, which is a form of registration. Unlike traditional correlation, we aim at obtaining more selective matchings by considering more strict comparisons of gray-level intensity. In order to achieve fast matching, a nonlinear thresholded version of the fast Fourier transform is applied to a gray-level decomposition of the original 2D image. The potential of the method is substantiated with respect to real data involving the selective identification of neuronal cell bodies in gray-level images.

cs.DC↗

arXiv2005

A Local Method for Detecting Communities

We propose a novel method of community detection that is computationally inexpensive and possesses physical significance to a member of a social network. This method is unlike many divisive and agglomerative techniques and is local in the sense that a community can be detected within a network without requiring knowledge of the entire network. A global application of this method is also introduced. Several artificial and real-world networks, including the famous Zachary Karate club, are analyzed.

cond-mat.dis-nn↗

arXiv2005

Sufficient Conditions for Fast Switching Synchronization in Time Varying Network Topologies

In previous work, empirical evidence indicated that a time-varying network could propagate sufficient information to allow synchronization of the sometimes coupled oscillators, despite an instantaneously disconnected topology. We prove here that if the network of oscillators synchronizes for the static time-average of the topology, then the network will synchronize with the time-varying topology if the time-average is achieved sufficiently fast. Fast switching, fast on the time-scale of the coupled oscillators, overcomes the descychnronizing decoherence suggested by disconnected instantaneous networks. This result agrees in spirit with that of where empirical evidence suggested that a moving averaged graph Laplacian could be used in the master-stability function analysis. A new fast switching stability criterion here-in gives sufficiency of a fast-switching network leading to synchronization. Although this sufficient condition appears to be very conservative, it provides new insights about the requirements for synchronization when the network topology is time-varying. In particular, it can be shown that networks of oscillators can synchronize even if at every point in time the frozen-time network topology is insufficiently connected to achieve synchronization.

nlin.CD↗