Publication Server of Zuse Institute Berlin (ZIB)
Not a member yet
6648 research outputs found
Sort by
Large population limits of Markov processes on random networks
No full textWe consider time-continuous Markovian discrete-state dynamics on random networks of interacting agents and study the large population limit. The dynamics are projected onto low-dimensional collective variables given by the shares of each discrete state in the system, or in certain subsystems, and general conditions for the convergence of the collective variable dynamics to a mean-field ordinary differential equation are proved. We discuss the convergence to this mean-field limit for a continuous-time noisy version of the so-called "voter model" on Erdős-Rényi random graphs, on the stochastic block model, as well as on random regular graphs. Moreover, a heterogeneous population of agents is studied. For each of these types of interaction networks, we specify the convergence conditions in dependency on the corresponding model parameters
High-performance designs for fiber-pigtailed quantum-light sources based on quantum dots in electrically-controlled circular Bragg gratings
No full textModelling opinion dynamics under the impact of influencer and media strategies
No full textDigital communication has made the public discourse considerably more complex, and new actors and strategies have emerged as a result of this seismic shift. Aside from the often-studied interactions among individuals during opinion formation, which have been facilitated on a large scale by social media platforms, the changing role of traditional media and the emerging role of "influencers" are not well understood, and the implications of their engagement strategies arising from the incentive structure of the attention economy even less so. Here we propose a novel opinion dynamics model that accounts for these different roles, namely that media and influencers change their own positions on slower time scales than individuals, while influencers dynamically gain and lose followers. Numerical simulations show the importance of their relative influence in creating qualitatively different opinion formation dynamics: with influencers, fragmented but short-lived clusters emerge, which are then counteracted by more stable media positions. Mean-field approximations by partial differential equations reproduce this dynamic. Based on the mean-field model, we study how strategies of influencers to gain more followers can influence the overall opinion distribution. We show that moving towards extreme positions can be a beneficial strategy for influencers to gain followers. Finally, we demonstrate that optimal control strategies allow other influencers or media to counteract such attempts and prevent further fragmentation of the opinion landscape. Our modelling framework contributes to better understanding the different roles and strategies in the increasingly complex information ecosystem and their impact on public opinion formation
High-throughput segmentation, data visualization, and analysis of sea star skeletal networks
No full textThe remarkably complex skeletal systems of the sea stars (Echinodermata, Asteroidea), consisting of hundreds to thousands of individual elements (ossicles), have intrigued investigators for more than 150 years. While the general features and structural diversity of isolated asteroid ossicles have been well documented in the literature, the task of mapping the spatial organization of these constituent skeletal elements in a whole-animal context represents an incredibly laborious process, and as such, has remained largely unexplored.
To address this unmet need, particularly in the context of understanding structure-function relationships in these complex skeletal systems, we present an integrated approach that combines micro-computed tomography, semi-automated ossicle segmentation, data visualization tools, and the production of additively manufactured tangible models to reveal biologically relevant structural data that can be rapidly analyzed in an intuitive manner.
In the present study, we demonstrate this high-throughput workflow by segmenting and analyzing entire skeletal systems of the giant knobby star, Pisaster giganteus, at four different stages of growth. The in-depth analysis, presented herein, provides a fundamental understanding of the three-dimensional skeletal architecture of the sea star body wall, the process of skeletal maturation during growth, and the relationship between skeletal organization and morphological characteristics of individual ossicles.
The widespread implementation of this approach for investigating other species, subspecies, and growth series has the potential to fundamentally improve our understanding of asteroid skeletal architecture and biodiversity in relation to mobility, feeding habits, and environmental specialization in this fascinating group of echinoderms
Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework
No full textThis paper is concerned with the exact solution of mixed-integer programs (MIPs) over the rational numbers, i.e., without any roundoff errors and error tolerances. Here, one computational bottleneck that should be avoided whenever possible is to employ large-scale symbolic computations. Instead it is often possible to use safe directed rounding methods, e.g., to generate provably correct dual bounds. In this work, we continue to leverage this paradigm and extend an exact branch-and-bound framework by separation routines for safe cutting planes, based on the approach first introduced by Cook, Dash, Fukasawa, and Goycoolea in 2009. Constraints are aggregated safely using approximate dual multipliers from an LP solve, followed by mixed-integer rounding to generate provably valid, although slightly weaker inequalities. We generalize this approach to problem data that is not representable in floating-point arithmetic, add routines for controlling the encoding length of the resulting cutting planes, and show how these cutting planes can be verified according to the VIPR certificate standard. Furthermore, we analyze the performance impact of these cutting planes in the context of an exact MIP framework, showing that we can solve 21.5% more instances and reduce solving times by 26.8% on the MIPLIB 2017 benchmark test set
Safe and Verified Gomory Mixed Integer Cuts in a Rational MIP Framework
No full textThis paper is concerned with the exact solution of mixed-integer programs (MIPs) over the rational numbers, i.e., without any roundoff errors and error tolerances. Here, one computational bottleneck that should be avoided whenever possible is to employ large-scale symbolic computations. Instead it is often possible to use safe directed rounding methods, e.g., to generate provably correct dual bounds. In this work, we continue to leverage this paradigm and extend an exact branch-and-bound framework by separation routines for safe cutting planes, based on the approach first introduced by Cook, Dash, Fukasawa, and Goycoolea in 2009. Constraints are aggregated safely using approximate dual multipliers from an LP solve, followed by mixed-integer rounding to generate provably valid, although slightly weaker inequalities. We generalize this approach to problem data that is not representable in floating-point arithmetic, add routines for controlling the encoding length of the resulting cutting planes, and show how these cutting planes can be verified according to the VIPR certificate standard. Furthermore, we analyze the performance impact of these cutting planes in the context of an exact MIP framework, showing that we can solve 21.5% more instances and reduce solving times by 26.8% on the MIPLIB 2017 benchmark test set
On the Activation Space of ReLU Equipped Deep Neural Networks
No full textModern Deep Neural Networks are getting wider and deeper in their architecture design. However, with an increasing number of parameters the decision mechanisms becomes more opaque. Therefore, there is a need for understanding the structures arising in the hidden layers of deep neural networks.
In this work, we present a new mathematical framework for describing the canonical polyhedral decomposition in the input space, and in addition, we introduce the notions of collapsing- and preserving patches, pertinent to understanding the forward map and the activation space they induce.
The activation space can be seen as the output of a layer and, in the particular case of ReLU activations, we prove that this output has the structure of a polyhedral complex
Transgressing the Boundaries: Towards a Rigorous Understanding of Deep Learning and Its (Non )Robustness
No full textThe recent advances in machine learning in various fields of applications can be largely attributed to the rise of deep learning (DL) methods and architectures. Despite being a key technology behind autonomous cars, image processing, speech recognition, etc., a notorious problem remains the lack of theoretical understanding of DL and related interpretability and (adversarial) robustness issues. Understanding the specifics of DL, as compared to, say, other forms of nonlinear regression methods or statistical learning, is interesting from a mathematical perspective, but at the same time it is of crucial importance in practice: treating neural networks as mere black boxes might be sufficient in certain cases, but many applications require waterproof performance guarantees and a deeper understanding of what could go wrong and why it could go wrong. It is probably fair to say that, despite being mathematically well founded as a method to approximate complicated functions, DL is mostly still more like modern alchemy that is firmly in the hands of engineers and computer scientists. Nevertheless, it is evident that certain specifics of DL that could explain its success in applications demands systematic mathematical approaches. In this work, we review robustness issues of DL and particularly bridge concerns and attempts from approximation theory to statistical learning theory. Further, we review Bayesian Deep Learning as a means for uncertainty quantification and rigorous explainability
An effective approach for deriving and evaluating approximate optimal design solutions of energy supply systems by time series aggregation
No full textIt is important to design multi-energy supply systems optimally in consideration of their operations for variations in energy demands. An approach for efficiently solving such an optimal design problem with a large number of periods for variations in energy demands is to derive an approximate optimal design solution by time series aggregation. However, such an approach does not provide any information on the accuracy for the optimal value of the objective function. In this paper, an effective approach for time series aggregation is proposed to derive an approximate optimal design solution and evaluate a proper gap between the upper and lower bounds for the optimal value of the objective function based on a mixed-integer linear model. In accordance with aggregation, energy demands are relaxed to uncertain parameters and the problem for deriving an approximate optimal design solution and evaluating it is transformed to a three-level optimization problem, and it is solved by applying both the robust and hierarchical optimization methods. A case study is conducted on a cogeneration system with a practical configuration, and it turns out that the proposed approach enables one to derive much smaller gaps as compared with those obtained by a conventional approach