Filters

2014 - 201932020 - 20221

More filters

2020 - 20234
Reset filters

Settings

Subject: networks Ă—

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Mixed Cu-Fe Sulfides Derived from Polydopamine-Coated Prussian Blue Analogue as a Lithium-Ion Battery Electrode
    (Washington, DC : ACS Publications, 2022) Bornamehr, Behnoosh; Presser, Volker; Husmann, Samantha
    Batteries employing transition-metal sulfides enable high-charge storage capacities, but polysulfide shuttling and volume expansion cause structural disintegration and early capacity fading. The design of heterostructures combining metal sulfides and carbon with an optimized morphology can effectively address these issues. Our work introduces dopamine-coated copper Prussian blue (CuPB) analogue as a template to prepare nanostructured mixed copper-iron sulfide electrodes. The material was prepared by coprecipitation of CuPB with in situ dopamine polymerization, followed by thermal sulfidation. Dopamine controls the particle size and favors K-rich CuPB due to its polymerization mechanism. While the presence of the coating prevents particle agglomeration during thermal sulfidation, its thickness demonstrates a key effect on the electrochemical performance of the derived sulfides. After a two-step activation process during cycling, the C-coated KCuFeS2electrodes showed capacities up to 800 mAh/g at 10 mA/g with nearly 100% capacity recovery after rate handling and a capacity of 380 mAh/g at 250 mA/g after 500 cycles.
  • Thumbnail Image
    Item
    Spectral Theory of Infinite Quantum Graphs
    (Cham (ZG) : Springer International Publishing AG, 2018) Exner, Pavel; Kostenko, Aleksey; Malamud, Mark; Neidhardt, Hagen
    We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection between spectral properties of a quantum graph and the corresponding properties of a certain weighted discrete Laplacian on the underlying discrete graph. Using this connection together with spectral theory of (unbounded) discrete Laplacians on infinite graphs, we prove a number of new results on spectral properties of quantum graphs. Namely, we prove several self-adjointness results including a Gaffney-type theorem. We investigate the problem of lower semiboundedness, prove several spectral estimates (bounds for the bottom of spectra and essential spectra of quantum graphs, CLR-type estimates) and study spectral types.
  • Thumbnail Image
    Item
    Interval stability for complex systems
    (Bristol : Institute of Physics Publishing, 2018) Klinshov, V.V.; Kirillov, S.; Kurths, J.; Nekorkin, V.I.
    Stability of dynamical systems against strong perturbations is an important problem of nonlinear dynamics relevant to many applications in various areas. Here, we develop a novel concept of interval stability, referring to the behavior of the perturbed system during a finite time interval. Based on this concept, we suggest new measures of stability, namely interval basin stability (IBS) and interval stability threshold (IST). IBS characterizes the likelihood that the perturbed system returns to the stable regime (attractor) in a given time. IST provides the minimal magnitude of the perturbation capable to disrupt the stable regime for a given interval of time. The suggested measures provide important information about the system susceptibility to external perturbations which may be useful for practical applications. Moreover, from a theoretical viewpoint the interval stability measures are shown to bridge the gap between linear and asymptotic stability. We also suggest numerical algorithms for quantification of the interval stability characteristics and demonstrate their potential for several dynamical systems of various nature, such as power grids and neural networks.
  • Thumbnail Image
    Item
    Testing the detectability of spatio-temporal climate transitions from paleoclimate networks with the start model
    (Göttingen : Copernicus, 2014) Rehfeld, K.; Molkenthin, N.; Kurths, J.
    A critical challenge in paleoclimate data analysis is the fact that the proxy data are heterogeneously distributed in space, which affects statistical methods that rely on spatial embedding of data. In the paleoclimate network approach nodes represent paleoclimate proxy time series, and links in the network are given by statistically significant similarities between them. Their location in space, proxy and archive type is coded in the node attributes. We develop a semi-empirical model for Spatio- Temporally AutocoRrelated Time series, inspired by the interplay of different Asian Summer Monsoon (ASM) systems. We use an ensemble of transition runs of this START model to test whether and how spatio-temporal climate transitions could be detectable from (paleo)climate networks. We sample model time series both on a grid and at locations at which paleoclimate data are available to investigate the effect of the spatially heterogeneous availability of data. Node betweenness centrality, averaged over the transition region, does not respond to the transition displayed by the START model, neither in the grid-based nor in the scattered sampling arrangement. The regionally defined measures of regional node degree and cross link ratio, however, are indicative of the changes in both scenarios, although the magnitude of the changes differs according to the sampling. We find that the START model is particularly suitable for pseudo-proxy experiments to test the technical reconstruction limits of paleoclimate data based on their location, and we conclude that (paleo)climate networks are suitable for investigating spatio-temporal transitions in the dependence structure of underlying climatic fields.