Essays about: "strongly connected component"

Found 4 essays containing the words strongly connected component.

  1. 1. Emission Allowances in the European Union Emissions Trading System

    University essay from Handelshögskolan i Stockholm/Institutionen för finansiell ekonomi

    Author : Franziska Manke; [2020]
    Keywords : Emission Allowances; EU ETS; Volatility; GARCH; Cointegration;

    Abstract : The first part of the thesis analyses the short term behavior of daily emission allowance (EUA) log returns with a focus on volatility dynamics in the recent market environment. In this part, I present a historical overview of the European Union Emission Trading System (EU ETS), analyze the stylized facts of the time series, employ appropriate time series models, and assess model in-sample and out-of-sample performance. READ MORE

  3. 2. Charge transport in a Hubbard-Holstein junction: Preliminary results from a DFT approach.

    University essay from Lunds universitet/Matematisk fysik; Lunds universitet/Fysiska institutionen

    Author : Eric Ceccarelli; [2019]
    Keywords : Density functional theory; DFT; Hubbard-Holstein; Hubbard-Holstein model; HH; Quantum transport; Physics and Astronomy;

    Abstract : Many-body systems are extremely complicated to describe due to mutual interactions between the constituent particles. This is for example the case of systems with electron-electron (e-e) and electron-phonon (e-ph) interactions. READ MORE

  4. 3. A Weak Formulation of Constraints to Couple Rigid and Elastic Bodies - a Study with FEniCS

    University essay from Lunds universitet/Matematik LTH

    Author : Axel Södersten; [2018]
    Keywords : Flexible multibody dynamics; differential-algebraic equations; interconnecting rigid joints; Mathematics and Statistics; Technology and Engineering;

    Abstract : Many complex mechanical systems are simplified by considering them as multibody systems. In recent years, flexible multibody dynamics has become more and more in demand. READ MORE

  5. 4. The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Bastian Fredriksson; Edvin Lundberg; [2015]
    Keywords : graph decomposition; strongly connected component; pursuit-evasion; search number; el-system; formal grammar; greedy heuristic;

    Abstract : This paper concerns a specific pursuit-evasion problem with a node-located evader which we call the monk problem. First, we propose a way of verifying a strategy using a new kind of recursive systems, called EL-systems. READ MORE