@misc{KoltaiSchuette2017, author = {Koltai, P{\´e}ter and Sch{\"u}tte, Christof}, title = {A multi scale perturbation expansion approach for Markov state modeling of non-stationary molecular dynamics}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-64868}, year = {2017}, abstract = {We investigate metastable dynamical systems subject to non-stationary forcing as they appear in molecular dynamics for systems driven by external fields. We show, that if the strength of the forcing is inversely proportional to the length of the slow metastable time scales of the unforced system, then the effective behavior of the forced system on slow time scales can be described by a low-dimensional reduced master equation. Our construction is explicit and uses the multiscale perturbation expansion method called two-timing, or method of multiple scales. The reduced master equation—a Markov state model—can be assembled by constructing two equilibrium Markov state models; one for the unforced system, and one for a slightly perturbed one.}, language = {en} } @misc{WolfAmadi2017, author = {Wolf, Thomas and Amadi, Chimaobi}, title = {Rational Solutions of Underdetermined Polynomial Equations}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-64488}, year = {2017}, abstract = {In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our work provides a method to compute rational solutions of single polynomial equations that are typically large with 10^2 ... 10^5 terms and that are heavily underdetermined. It was possible to obtain this functionality by adding a number of new modules for a new type of splitting of equations to the existing package CRACK that is normally used to solve polynomial algebraic and differential systems of equations.}, language = {en} } @misc{WillenbockelSchuette2016, author = {Willenbockel, Christian Tobias and Sch{\"u}tte, Christof}, title = {Variational Bayesian Inference and Model Selection for the Stochastic Block Model with Irrelevant Vertices}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-57003}, year = {2016}, abstract = {Real World networks often exhibit a significant number of vertices which are sparsely and irregularly connected to other vertices in the network. For clustering theses networks with a model based algorithm, we propose the Stochastic Block Model with Irrelevant Vertices (SBMIV) for weighted net- works. We propose an original Variational Bayesian Expectation Maximiza- tion inference algorithm for the SBMIV which is an advanced version of our Blockloading algorithm for the Stochastic Block Model. We introduce a model selection criterion for the number of clusters of the SBMIV which is based on the lower variational bound of the model likelihood. We propose a fully Bayesian inference process, based on plausible informative priors, which is independent of other algorithms for preprocessing start values for the cluster assignment of vertices. Our inference methods allow for a multi level identification of irrelevant vertices which are hard to cluster reliably ac- cording to the SBM. We demonstrate that our methods improve on the normal Stochastic Block model by applying it to to Earthquake Networks which are an example of networks with a large number of sparsely and irregularly con- nected vertices.}, language = {en} } @misc{Fackeldey2010, author = {Fackeldey, Konstantin}, title = {Challenges in Atomistic-to-Continuum Coupling}, volume = {2010}, journal = {ZIB Report}, edition = {10-12}, doi = {10.1155/2015/834517}, year = {2010}, abstract = {This paper is concerned with the design, analysis, and implementation of concurrent coupling approaches where different (atomic and continuous) models are used simultaneously within a single simulation process. Thereby, several problems or pitfalls can happen, for example, the reflection of molecular movements at the "boundary" between the atomic and continuum regions which leads to an unphysical increase in energy in the atomic model. We investigate the problems with the aim of giving an introduction into this field and preventing errors for scientists starting their research towards multiscale methods.}, language = {en} } @misc{KoltaiCiccottiSchuette2016, author = {Koltai, Peter and Ciccotti, Giovanni and Sch{\"u}tte, Christof}, title = {On metastability and Markov state models for non-stationary molecular dynamics}, volume = {174103}, journal = {The Journal of Chemical Physics}, edition = {145}, issn = {1438-0064}, doi = {10.1063/1.4966157}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-57869}, year = {2016}, abstract = {We utilize the theory of coherent sets to build Markov state models for non- equilibrium molecular dynamical systems. Unlike for systems in equilibrium, "meta- stable" sets in the non-equilibrium case may move as time evolves. We formalize this concept by relying on the theory of coherent sets, based on this we derive finite-time non-stationary Markov state models, and illustrate the concept and its main differences to equilibrium Markov state modeling on simple, one-dimensional examples.}, language = {en} } @misc{Clausecker2017, author = {Clausecker, Robert}, title = {Notes on the Construction of Pattern Databases}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-65586}, year = {2017}, abstract = {This report aims to explain and extend pattern databases as a tool in finding optimal solutions to combination puzzles. Using sliding tile puzzles as an example, an overview over techniques to construct and use pattern databases is given, analysed, and extended. As novel results, zero aware additive pattern databases and PDB catalogues are introduced. This report originally appeared as a bachelor thesis at Humboldt University of Berlin under the title Notes on the Construction of Tablebases.}, language = {en} } @misc{MokhtariPattersonHoefling2021, author = {Mokhtari, Zahra and Patterson, Robert I. A. and H{\"o}fling, Felix}, title = {Spontaneous trail formation in populations of auto-chemotactic walkers}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-84466}, year = {2021}, abstract = {We study the formation of trails in populations of self-propelled agents that make oriented deposits of pheromones and also sense such deposits to which they then respond with gradual changes of their direction of motion. Based on extensive off-lattice computer simulations aiming at the scale of insects, e.g., ants, we identify a number of emerging stationary patterns and obtain qualitatively the non-equilibrium \add{state} diagram of the model, spanned by the strength of the agent--pheromone interaction and the number density of the population. In particular, we demonstrate the spontaneous formation of persistent, macroscopic trails, and highlight some behaviour that is consistent with a dynamic phase transition. This includes a characterisation of the mass of system-spanning trails as a potential order parameter. We also propose a dynamic model for a few macroscopic observables, including the sub-population size of trail-following agents, which captures the early phase of trail formation.}, language = {en} } @misc{SchwartzBorndoerferBartz2016, author = {Schwartz, Stephan and Bornd{\"o}rfer, Ralf and Bartz, Gerald}, title = {The Graph Segmentation Problem}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-60750}, year = {2016}, abstract = {We investigate a graph theoretical problem arising in the automatic billing of a network toll. Given a network and a family of user paths, we study the graph segmentation problem (GSP) to cover parts of the user paths by a set of disjoint segments. The GSP is shown to be NP-hard but for special cases it can be solved in polynomial time. We also show that the marginal utility of a segment is bounded. Computational results for real-world instances show that in practice the problem is more amenable than the theoretic bounds suggest.}, language = {en} } @misc{PulajRaymondTheis2015, author = {Pulaj, Jonad and Raymond, Annie and Theis, Dirk}, title = {New Conjectures For Union-Closed Families}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-56804}, year = {2015}, abstract = {The Frankl conjecture, also known as the union-closed sets conjecture, states that there exists an element in at least half of the sets of any (non-empty) union-closed family. From an optimization point of view, one could instead prove that 2a is an upper bound to the number of sets in a union-closed family with n elements where each element is in at most a sets, where a and n are non-negative integers. Formulating these problems as integer programs we observe that computed optimal values do not vary with n. We formalize these observations as conjectures, and show that they are not equivalent to the Frankl conjecture while still having wide-reaching implications if proven true. Finally, we partially prove the new conjectures and discuss possible approaches to solve them completely.}, language = {en} } @misc{HartmannRichterSchuetteetal.2017, author = {Hartmann, Carsten and Richter, Lorenz and Sch{\"u}tte, Christof and Zhang, Wei}, title = {Variational characterization of free energy: Theory and algorithms}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-65045}, year = {2017}, abstract = {The article surveys and extends variational formulations of the thermodynamic free energy and discusses their information-theoretic content from the perspective of mathematical statistics. We revisit the well-known Jarzynski equality for nonequilibrium free energy sampling within the framework of importance sampling and Girsanov change-of-measure transformations. The implications of the different variational formulations for designing efficient stochastic optimization and nonequilibrium simulation algorithms for computing free energies are discussed and illustrated.}, language = {en} }