Searcharxiv⌕ Search

arXiv subjects

Jürgen Jost

Publications and source records attributed to Jürgen Jost.

At least 145 records · Page 8Linked to original sources
arXiv2012

Shared Information -- New Insights and Problems in Decomposing Information in Complex Systems

How can the information that a set ${X_{1},...,X_{n}}$ of random variables contains about another random variable $S$ be decomposed? To what extent do different subgroups provide the same, i.e. shared or redundant, information, carry unique information or interact for the emergence of synergistic information? Recently Williams and Beer proposed such a decomposition based on natural properties for shared information. While these properties fix the structure of the decomposition, they do not uniquely specify the values of the different terms. Therefore, we investigate additional properties such as strong symmetry and left monotonicity. We find that strong symmetry is incompatible with the properties proposed by Williams and Beer. Although left monotonicity is a very natural property for an information measure it is not fulfilled by any of the proposed measures. We also study a geometric framework for information decompositions and ask whether it is possible to represent shared information by a family of posterior distributions. Finally, we draw connections to the notions of shared knowledge and common knowledge in game theory. While many people believe that independent variables cannot share information, we show that in game theory independent agents can have shared knowledge, but not common knowledge. We conclude that intuition and heuristic arguments do not suffice when arguing about information.

cs.IT↗
arXiv2012

Relations Between Graphs

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective homomorphisms of graphs and naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs. Both R-cores and R-cocores of graphs are unique up to isomorphism and can be computed in polynomial time.

math.CO↗
arXiv2012

Minimum vertex covers and the spectrum of the normalized Laplacian on trees

We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers. In particular, for the eigenvalue 1, its multiplicity is related to the size of a minimum vertex cover, and zero entries of its eigenvectors correspond to vertices in minimum vertex covers; while for eigenvalues near 1, their distance to 1 can be estimated from minimum vertex covers; and for the largest eigenvalue smaller than 1, the sign graphs of its eigenvectors take vertices in a minimum vertex cover as representatives.

math.CO↗
arXiv2012

Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplacian

We study the spectrum of the normalized Laplace operator of a connected graph $Γ$. As is well known, the smallest nontrivial eigenvalue measures how difficult it is to decompose $Γ$ into two large pieces, whereas the largest eigenvalue controls how close $Γ$ is to being bipartite. The smallest eigenvalue can be controlled by the Cheeger constant, and we establish a dual construction that controls the largest eigenvalue. Moreover, we find that the neighborhood graphs $Γ[l]$ of order $l\geq2$ encode important spectral information about $Γ$ itself which we systematically explore. In particular, the neighborhood graph method leads to new estimates for the smallest nontrivial eigenvalue that can improve the Cheeger inequality, as well as an explicit estimate for the largest eigenvalue from above and below. As applications of such spectral estimates, we provide a criterion for the synchronizability of coupled map lattices, and an estimate for the convergence rate of random walks on graphs.

math.CO↗
arXiv2012

Analysis of inverse stochastic resonance and the long-term firing of Hodgkin-Huxley neurons with Gaussian white noise

In previous articles we have investigated the firing properties of the standard Hodgkin-Huxley (HH) systems of ordinary and partial differential equations in response to input currents composed of a drift (mean) and additive Gaussian white noise. For certain values of the mean current, as the noise amplitude increased from zero, the firing rate exhibited a minimum and this phenomenon was called inverse stochastic resonance (ISR). Here we analyse the underlying transitions from a stable equilibrium point to the limit cycle and vice-versa. Focusing on the case of a mean input current density $μ=6.8$ at which repetitive firing occurs and ISR had been found to be pronounced, some of the properties of the corresponding stable equilibrium point are found. A linearized approximation around this point has oscillatory solutions from whose maxima spikes tend to occur. A one dimensional diffusion is also constructed for small noise based on the correlations between the pairs of HH variables and the small magnitudes of the fluctuations in two of them. Properties of the basin of attraction of the limit cycle (spike) are investigated heuristically and also the nature of distribution of spikes at very small noise corresponding to trajectories which do not ever enter the basin of attraction of the equilibrium point. Long term trials of duration 500000 ms are carried out for values of the noise parameter $σ$ from 0 to 2.0, with results appearing in Section 3. The graph of mean spike count versus $σ$ is divided into 4 regions $R_1,...,R_4,$ where $R_3$ contains the minimum associated with ISR.

q-bio.NC↗
arXiv2011

Interlacing inequalities for eigenvalues of discrete Laplace operators

The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies eigenvalue bounds for the other one. In this paper, we therefore develop topological arguments in order to de- rive such analytical inequalities. We investigate, in a general and systematic manner, interlacing of spectra for weighted simplicial complexes with arbi- trary weights. This enables us to control the spectral effects of operations like deletion of a subcomplex, collapsing and contraction of a simplex, cover- ings and simplicial maps, for absolute and relative Laplacians. It turns out that many well-known results from graph theory become special cases of our general results and consequently admit improvements and generalizations. In particular, we derive a number of effective eigenvalue bounds.

math.SP↗
arXiv2011

Spectra of combinatorial Laplace operators on simplicial complexes

We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the weighted Laplacian, and the normalized graph Laplacian. This framework then allows us to define the normalized Laplace operator $Δ_{i}^{up}$ on simplicial complexes which we then systematically investigate. We study the effects of a wedge sum, a join and a duplication of a motif on the spectrum of the normalized Laplace operator, and identify some of the combinatorial features of a simplicial complex that are encoded in its spectrum.

math.AT↗
arXiv2010

Symbolic dynamics and synchronization of coupled map networks with multiple delays

We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of certain symbol sequences related to the characteristics of the dynamics. In particular, we show that the resulting forbidden sequences are closely related to the time delays in the system. We present two applications to coupled map lattices, namely (1) detecting synchronization and (2) determining unknown values of the transmission delays in networks with possibly directed and weighted connections and measurement noise. The method is applicable to multi-dimensional as well as set-valued maps, and to networks with time-varying delays and connection structure.

nlin.CD↗
arXiv2010

Another Proof of Oscar Rojo's Theorems

We present here another proof of Oscar Rojo's theorems about the spectrum of graph Laplacian on certain balanced trees, by taking advantage of the symmetry properties of the trees in question, and looking into the eigenfunctions of Laplacian.

math.CO↗
arXiv2010

Non-divergence harmonic maps

We describe work on solutions of certain non-divergence type and therefore non-variational elliptic and parabolic systems on manifolds. These systems include Hermitian and affine harmonics which should become useful tools for studying Hermitian and affine manifolds, resp. A key point is that in addition to the standard condition of nonpositive image curvature that is well known and understood in the theory of ordinary harmonic maps (which arise from a variational problem), here we also need in addition a global topological condition to guarantee the existence of solutions.

math.DG↗
arXiv2010

STDP-driven networks and the \emph{C. elegans} neuronal network

We study the dynamics of the structure of a formal neural network wherein the strengths of the synapses are governed by spike-timing-dependent plasticity (STDP). For properly chosen input signals, there exists a steady state with a residual network. We compare the motif profile of such a network with that of a real neural network of \emph{C. elegans} and identify robust qualitative similarities. In particular, our extensive numerical simulations show that this STDP-driven resulting network is robust under variations of the model parameters.

q-bio.NC↗
arXiv2010

Genotype networks in metabolic reaction spaces

Background: A metabolic genotype comprises all chemical reactions an organism can catalyze via enzymes encoded in its genome. A genotype is viable in a given environment if it is capable of producing all biomass components the organism needs to survive and reproduce. Previous work has focused on the properties of individual genotypes while little is known about how genome-scale metabolic networks with a given function can vary in their reaction content. Results: We here characterize spaces of such genotypes. Specifically, we study metabolic genotypes whose phenotype is viability in minimal chemical environments that differ in their sole carbon sources. We show that regardless of the number of reactions in a metabolic genotype, the genotypes of a given phenotype typically form vast, connected, and unstructured sets -- genotype networks -- that nearly span the whole of genotype space. The robustness of metabolic phenotypes to random reaction removal in such spaces has a narrow distribution with a high mean. Different carbon sources differ in the number of metabolic genotypes in their genotype network; this number decreases as a genotype is required to be viable on increasing numbers of carbon sources, but much less than if metabolic reactions were used independently across different chemical environments. Conclusions: Our work shows that phenotype-preserving genotype networks have generic organizational properties and that these properties are insensitive to the number of reactions in metabolic genotypes.

q-bio.MN↗
arXiv2009

Universal Bounds for Eigenvalues of the Polyharmonic Operators

We study eigenvalues of polyharmonic operators on compact Riemannian manifolds with boundary (possibly empty). In particular, we prove a universal inequality for the eigenvalues of the polyharmonic operators on compact domains in a Euclidean space. This inequality controls the $k$th eigenvalue by the lower eigenvalues, independently of the particular geometry of the domain. Our inequality is sharper than the known Payne-Pólya-Weinberg type inequality and also covers the important Yang inequality on eigenvalues of the Dirichlet Laplacian. We also prove universal inequalities for the lower order eigenvalues of the polyharmonic operator on compact domains in a Euclidean space which in the case of the biharmonic operator and the buckling problem strengthen the estimates obtained by Ashbaugh. Finally, we prove universal inequalities for eigenvalues of polyharmonic operators of any order on compact domains in the sphere.

math.DG↗
arXiv2009

Affine Harmonic Maps

We introduce a class of maps from an affine flat into a Riemannian manifold that solve an elliptic system defined by the natural second order elliptic operator of the affine structure and the nonlinear Riemann geometry of the target. These maps are called affine harmonic. We show an existence result for affine harmonic maps in a given homotopy class when the target has non positive sectional curvature and some global non triviality condition is met. An example shows that such a condition is necessary. The analytical part is made difficult by the absence of a variational structure underlying affine harmonic maps. We therefore need to combine estimation techniques from geometric analysis and PDE theory with global geometric considerations.

math.DG↗
arXiv2008

Synchronization of discrete-time dynamical networks with time-varying couplings

We study the local complete synchronization of discrete-time dynamical networks with time-varying couplings. Our conditions for the temporal variation of the couplings are rather general and include both variations in the network structure and in the reaction dynamics; the reactions could, for example, be driven by a random dynamical system. A basic tool is the concept of Hajnal diameter which we extend to infinite Jacobian matrix sequences. The Hajnal diameter can be used to verify synchronization and we show that it is equivalent to other quantities which have been extended to time-varying cases, such as the projection radius, projection Lyapunov exponents, and transverse Lyapunov exponents. Furthermore, these results are used to investigate the synchronization problem in coupled map networks with time-varying topologies and possibly directed and weighted edges. In this case, the Hajnal diameter of the infinite coupling matrices can be used to measure the synchronizability of the network process. As we show, the network is capable of synchronizing some chaotic map if and only if there exists an integer T>0 such that for any time interval of length T, there exists a vertex which can access other vertices by directed paths in that time interval.

math.DS↗
arXiv2008

Chaos synchronization in networks of coupled maps with time-varying topologies

Complexity of dynamical networks can arise not only from the complexity of the topological structure but also from the time evolution of the topology. In this paper, we study the synchronous motion of coupled maps in time-varying complex networks both analytically and numerically. The temporal variation is rather general and formalized as being driven by a metric dynamical system. Four network models are discussed in detail in which the interconnections between vertices vary through time randomly. These models are 1) i.i.d. sequences of random graphs with fixed wiring probability, 2) groups of graphs with random switches between the individual graphs, 3) graphs with temporary random failures of nodes, and 4) the meet-for-dinner model where the vertices are randomly grouped. We show that the temporal variation and randomness of the connection topology can enhance synchronizability in many cases; however, there are also instances where they reduce synchronizability. In analytical terms, the Hajnal diameter of the coupling matrix sequence is presented as a measure for the synchronizability of the graph topology. In topological terms, the decisive criterion for synchronization of coupled chaotic maps is that the union of the time-varying graphs contains a spanning tree.

nlin.CD↗