Searcharxiv⌕ Search

arXiv subjects

Juergen Jost

Publications and source records attributed to Juergen Jost.

At least 37 records · Page 2Linked to original sources

Learning, evolution and population dynamics

We study a complementarity game as a systematic tool for the investigation of the interplay between individual optimization and population effects and for the comparison of different strategy and learning schemes. The game randomly pairs players from opposite populations. The game is symmetric at the individual level, but has many equilibria that are more or less favorable to the members of the two populations. Which of these equilibria then is attained is decided by the dynamics at the population level. Players play repeatedly, but in each round with a new opponent. They can learn from their previous encounters and translate this into their actions in the present round on the basis of strategic schemes. The schemes can be quite simple, or very elaborate. We can then break the symmetry in the game and give the members of the two populations access to different strategy spaces. Typically, simpler strategy types have an advantage because they tend to go more quickly towards a favorable equilibrium which, once reached, the other population is forced to accept. Also, populations with bolder individuals that may not fare so well at the level of individual performance may obtain an advantage towards ones with more timid players. By checking the effects of parameters such as the generation length or the mutation rate, we are able to compare the relative contributions of individual learning and evolutionary adaptations.

q-bio.PE↗

Hysteresis effects of changing parameters of noncooperative games

We adapt the method used by Jaynes to derive the equilibria of statistical physics to instead derive equilibria of bounded rational game theory. We analyze the dependence of these equilibria on the parameters of the underlying game, focusing on hysteresis effects. In particular, we show that by gradually imposing individual-specific tax rates on the players of the game, and then gradually removing those taxes, the players move from a poor equilibrium to one that is better for all of them.

cs.GT↗

Synchronized chaos in networks of simple units

We study synchronization of non-diffusively coupled map networks with arbitrary network topologies, where the connections between different units are, in general, not symmetric and can carry both positive and negative weights. We show that, in contrast to diffusively coupled networks, the synchronous behavior of a non-diffusively coupled network can be dramatically different from the behavior of its constituent units. In particular, we show that chaos can emerge as synchronized behavior although the dynamics of individual units are very simple. Conversely, individually chaotic units can display simple behavior when the network synchronizes. We give a synchronization criterion that depends on the spectrum of the generalized graph Laplacian, as well as the dynamical properties of the individual units and the interaction function. This general result will be applied to coupled systems of tent and logistic maps and to two models of neuronal dynamics. Our approach yields an analytical understanding of how simple model neurons can produce complex collective behavior through the coordination of their actions.

nlin.CD↗

Harmonic metrics on unipotent bundles over quasi-compact Kaehler manifolds

In this note, we propose an approach to the study of the analogue for unipotent harmonic bundles of Schmid's Nilpotent Orbit Theorem. Using this approach, we construct harmonic metrics on unipotent bundles over quasi-compact Kähler manifolds with carefully controlled asymptotics near the compactifying divisor; such a metric is unique up to some isometry. Such an asymptotic behavior is canonical in some sense.

math.DG↗

Quantifying structure in networks

We investigate exponential families of random graph distributions as a framework for systematic quantification of structure in networks. In this paper we restrict ourselves to undirected unlabeled graphs. For these graphs, the counts of subgraphs with no more than k links are a sufficient statistics for the exponential families of graphs with interactions between at most k links. In this framework we investigate the dependencies between several observables commonly used to quantify structure in networks, such as the degree distribution, cluster and assortativity coefficients.

cond-mat.dis-nn↗

The regularity of harmonic maps into spheres and applications to Bernstein problems

We show the regularity of, and derive a-priori estimates for (weakly) harmonic maps from a Riemannian manifold into a Euclidean sphere under the assumption that the image avoids some neighborhood of a half-equator. The proofs combine constructions of strictly convex functions and the regularity theory of quasi-linear elliptic systems. We apply these results to the spherical and Euclidean Bernstein problems for minimal hypersurfaces, obtaining new conditions under which compact minimal hypersurfaces in spheres or complete minimal hypersurfaces in Euclidean spaces are trivial.

math.DG↗

Synchronization in discrete-time networks with general pairwise coupling

We consider complete synchronization of identical maps coupled through a general interaction function and in a general network topology where the edges may be directed and may carry both positive and negative weights. We define mixed transverse exponents and derive sufficient conditions for local complete synchronization. The general non-diffusive coupling scheme can lead to new synchronous behavior, in networks of identical units, that cannot be produced by single units in isolation. In particular, we show that synchronous chaos can emerge in networks of simple units. Conversely, in networks of chaotic units simple synchronous dynamics can emerge; that is, chaos can be suppressed through synchrony.

nlin.CD↗

Some explicit constructions of Dirac-harmonic maps

We construct explicit examples of Dirac-harmonic maps $(ϕ, ψ)$ between Riemannian manifolds $(M,g)$ and $(N,g')$ which are non-trivial in the sense that $ϕ$ is not harmonic. When $\dim M=2$, we also produce examples where $ϕ$ is harmonic, but not conformal, and $ψ$ is non-trivial.

math.DG↗

Evolution of network structure by temporal learning

We study the effect of learning dynamics on network topology. A network of discrete dynamical systems is considered for this purpose and the coupling strengths are made to evolve according to a temporal learning rule that is based on the paradigm of spike-time-dependent plasticity. This incorporates necessary competition between different edges. The final network we obtain is robust and has a broad degree distribution.

nlin.CD↗

Complexity Measures from Interaction Structures

We evaluate new complexity measures on the symbolic dynamics of coupled tent maps and cellular automata. These measures quantify complexity in terms of $k$-th order statistical dependencies that cannot be reduced to interactions between $k-1$ units. We demonstrate that these measures are able to identify complex dynamical regimes.

nlin.CD↗

The silencing of neuronal activity by noise and the phenomenon of inverse stochastic resonance

Neurons in the central nervous system are affected by complex and noisy signals due to fluctuations in their cellular environment and in the inputs they receive from many other cells 1,2. Such noise usually increases the probability that a neuron will send out a signal to its target cells 2-5. In stochastic resonance, which occurs in many physical and biological systems, an optimal response is found at a particular noise amplitude 6-9. We have found that in a classical neuronal model the opposite can occur - that noise can subdue or turn off repetitive neuronal activity in both single cells and networks of cells. Recent experiments on regularly firing neurons with noisy inputs confirm these predictions 10,11. Surprisingly, we find that in some cases there is a noise level at which the response is a minimum, a phenomenon which is called inverse stochastic resonance. Suppression of rhythmic behavior by noise and inverse stochastic resonance are predicted to occur not only in neuronal systems but more generally in diverse nonlinear dynamical systems where a stable limit cycle is attainable from a stable rest state.

q-bio.NC↗

Metrics of constant curvature on a Riemann surface with two corners on the boundary

We use PDE methods as developed for the Liouville equation to study the existence of conformal metrics with prescribed singularities on surfaces with boundary, the boundary condition being constant geodesic curvature. Our first result shows that a disk with two corners admits a conformal metric with constant Gauss curvature and constant geodesic curvature on its boundary if and only if the two corners have the same angle. In fact, we can classify all the solutions in a more general situation, that of the 2-sphere cut by two planes.

math.DG↗

Liouville Theorems for Dirac-Harmonic Maps

We prove Liouville theorems for Dirac-harmonic maps from the Euclidean space $\R^n$, the hyperbolic space $\H^n$ and a Riemannian manifold $\mathfrak{S^n}$ ($n\geq 3$) with the Schwarzschild metric to any Riemannian manifold $N$.

math-ph↗

Nonlinear Dirac equations on Riemann surfaces

We develop analytical methods for nonlinear Dirac equations. Examples of such equations include Dirac-harmonic maps with curvature term and the equations describing the generalized Weierstrass representation of surfaces in three-manifolds. We provide the key analytical steps, i.e., small energy regularity and removable singularity theorems and energy identities for solutions.

math.DG↗

Transient termination of synaptically sustained spiking by stochastic inputs in a pair of coupled Type 1 neurons

We examine the effects of stochastic input currents on the firing behavior of two excitable neurons coupled with fast excitatory synapses. In such cells (models), typified by the quadratic integrate and fire model, mutual synaptic coupling can cause sustained firing or oscillatory behavior which is necessarily antiphase. Additive Gaussian white noise can transiently terminate the oscillations, hence destroying the stable limit cycle. Further application of the noise may return the system to spiking activity. In a particular noise range, the transition times between the oscillating and the resting state are strongly asymmetric. We numerically investigate an approximate basin of attraction, A, of the periodic orbit and use Markov process theory to explain the firing behavior in terms of the probability of escape of trajectories from A

q-bio.NC↗

Network synchronization: Spectral versus statistical properties

We consider synchronization of weighted networks, possibly with asymmetrical connections. We show that the synchronizability of the networks cannot be directly inferred from their statistical properties. Small local changes in the network structure can sensitively affect the eigenvalues relevant for synchronization, while the gross statistical network properties remain essentially unchanged. Consequently, commonly used statistical properties, including the degree distribution, degree homogeneity, average degree, average distance, degree correlation, and clustering coefficient, can fail to characterize the synchronizability of networks.

cond-mat.dis-nn↗

Symbolic Synchronization and the Detection of Global Properties of Coupled Dynamics from Local Information

We study coupled dynamics on networks using symbolic dynamics. The symbolic dynamics is defined by dividing the state space into a small number of regions (typically 2), and considering the relative frequencies of the transitions between those regions. It turns out that the global qualitative properties of the coupled dynamics can be classified into three different phases based on the synchronization of the variables and the homogeneity of the symbolic dynamics. Of particular interest is the {\it homogeneous unsynchronized phase} where the coupled dynamics is in a chaotic unsynchronized state, but exhibits (almost) identical symbolic dynamics at all the nodes in the network. We refer to this dynamical behaviour as {\it symbolic synchronization}. In this phase, the local symbolic dynamics of any arbitrarily selected node reflects global properties of the coupled dynamics, such as qualitative behaviour of the largest Lyapunov exponent and phase synchronization. This phase depends mainly on the network architecture, and only to a smaller extent on the local chaotic dynamical function. We present results for two model dynamics, iterations of the one-dimensional logistic map and the two-dimensional Hénon map, as local dynamical function.

nlin.CD↗