arXiv subjects

Jan Philipp Pade

Publications and source records attributed to Jan Philipp Pade.

8 recordsLinked to original sources

arXiv2018

Schur reduction of trees and extremal entries of the Fiedler vector

We study the eigenvectors of Laplacian matrices of trees. The Laplacian matrix is reduced to a tridiagonal matrix using the Schur complement. This preserves the eigenvectors and allows us to provide fomulas for the ratio of eigenvector entries. We also obtain bounds on the ratio of eigenvector entries along a path in terms of the eigenvalue and Perron values. The results are then applied to the Fiedler vector. Here we locate the extremal entries of the Fiedler vector and study classes of graphs such that the extremal entries can be found at the end points of the longest path.

math.CO↗

arXiv2017

The Effects of Structural Perturbations on the Synchronizability of Diffusive Networks

We investigate the effects of structural perturbations of both, undirected and directed diffusive networks on their ability to synchronize. We establish a classification of directed links according to their impact on synchronizability. We focus on adding directed links in weakly connected networks having a strongly connected component acting as driver. When the connectivity of the driver is not stronger than the connectivity of the slave component, we can always make the network strongly connected while hindering synchronization. On the other hand, we prove the existence of a perturbation which makes the network strongly connected while increasing the synchronizability. Under additional conditions, there is a node in the driving component such that adding a single link starting at an arbitrary node of the driven component and ending at this node increases the synchronizability.

math.DS↗

arXiv2017

Spectra of Laplacian matrices of weighted graphs: structural genericity properties

This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity) and its associated eigenvector, the so-called Fiedler vector. Here we prove that, given a Laplacian matrix, it is possible to perturb the weights of the existing edges in the underlying graph in order to obtain simple eigenvalues and a Fiedler vector composed of only non-zero entries. These structural genericity properties with the constraint of not adding edges in the underlying graph are stronger than the classical ones, for which arbitrary structural perturbations are allowed. These results open the opportunity to understand the impact of structural changes on the dynamics of complex systems.

math-ph↗

arXiv2015

The dynamical impact of a shortcut in unidirectionally coupled rings of oscillators

We study the destabilization mechanism in a unidirectional ring of identical oscillators, perturbed by the introduction of a long-range connection. It is known that for a homogeneous, unidirectional ring of identical Stuart-Landau oscillators the trivial equilibrium undergoes a sequence of Hopf bifurcations eventually leading to the coexistence of multiple stable periodic states resembling the Eckhaus scenario. We show that this destabilization scenario persists under small non-local perturbations. In this case, the Eckhaus line is modulated according to certain resonance conditions. In the case when the shortcut is strong, we show that the coexisting periodic solutions split up into two groups. The first group consists of orbits which are unstable for all parameter values, while the other one shows the classical Eckhaus behavior.

math.DS↗

arXiv2015

Reduction of Interaction Delays in Networks

Delayed interactions are a common property of coupled natural systems and therefore arise in a variety of different applications. For instance, signals in neural or laser networks propagate at finite speed giving rise to delayed connections. Such systems are often modeled by delay differential equations with discrete delays. In realistic situations, these delays are not identical on different connections. We show that by a componentwise timeshift transformation it is often possible to reduce the number of different delays and simplify the models without loss of information. We identify dynamic invariants of this transformation, determine its capabilities to reduce the number of delays and interpret these findings in terms of the topology of the underlying graph. In particular, we show that networks with identical sums of delay times along the fundamental semicycles are dynamically equivalent and we provide a normal form for these systems. We illustrate the theory using a network motif of coupled Mackey-Glass systems with 8 different time delays, which can be reduced to an equivalent motif with three delays.

math.DS↗

arXiv2015

Classification of coupled dynamical systems with multiple delays: Finding the minimal number of delays

In this article we study networks of coupled dynamical systems with time-delayed connections. If two such networks hold different delays on the connections it is in general possible that they exhibit different dynamical behavior as well. We prove that for particular sets of delays this is not the case. To this aim we introduce a componentwise timeshift transformation (CTT) which allows to classify systems which possess equivalent dynamics, though possibly different sets of connection delays. In particular, we show for a large class of semiflows (including the case of delay differential equations) that the stability of attractors is invariant under this transformation. Moreover we show that each equivalence class which is mediated by the CTT possesses a representative system in which the number of different delays is not larger than the cycle space dimension of the underlying graph. We conclude that the 'true' dimension of the corresponding parameter space of delays is in general smaller than it appears at first glance.

math.DS↗

arXiv2014

Pattern Recognition in a Ring of Delayed Phase Oscillators

We show that a ring of phase oscillators coupled with transmission delays can be used as a pattern recognition system. The introduced model encodes patterns as stable periodic orbits. We present a detailed analysis of the underlying dynamics. In particular, we show that the system possesses a multitude of periodic solutions, prove stability results and present a bifurcation analysis. Furthermore, we show successful recognition results using artificial patterns and speech recordings.

math.DS↗

arXiv2014

Improving the Network Structure can lead to Functional Failures

In many real-world networks the ability to synchronize is a key property for its performance. Examples include power-grid, sensor, and neuron networks as well as consensus formation. Recent work on undirected networks with diffusive interaction revealed that improvements in the network connectivity such as making the network more connected and homogeneous enhances synchronization. However, real-world networks have directed and weighted connections. In such directed networks, understanding the impact of structural changes on the network performance remains a major challenge. Here, we show that improving the structure of a directed network can lead to a failure in the network function. For instance, introducing new links to reduce the minimum distance between nodes can lead to instabilities in the synchronized motion. This counter-intuitive effect only occurs in directed networks. Our results allow to identify the dynamical importance of a link and thereby have a major impact on the design and control of directed networks.

math.DS↗