Home > Search Results: Popovič, Viktor
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Measures of extremal dependence in time series
 Popovič, Viktor ; Pawlas, Zbyněk (advisor) ; Hudecová, Šárka (referee)
In the present thesis we deal with dependence among extremal values within time series. Concerning this type of relations the commonly used autocorrelation function does not provide sufficient information. Moreover, autocorrelation function is suitable for Gaussian processes while nowadays we often work with heavy-tailed time series. In this thesis we cover two measures of extremal dependence that are used for this type of data. We introduce the coefficient of tail dependence, measure of extremal dependence based on tail characteristics of joint survival function. The second measure is called extremogram, which depends only on the extreme values in the sequence. In addition to the theoretical part, simulation study and application to real data of both described measures including their comparison are performed. Results are stated together with tables and graphical output.
Detailed record
Optimization of flow in graph
 Popovič, Viktor ; Lachout, Petr (advisor) ; Kozmík, Václav (referee)
When it comes to maximization of effectively or minimizing of cost, optimization represents the key activity. There is a number of practical examples that can be implemented into Theory of Graphs and subsequently optimized. This thesis includes the introduction to transportation problem where the consumer demand is met by the lowest price. Also there is maximum flow problem which is to transfer maximum of commodity (petroleum, gas...) through the network where each edge has a capacity restriction. We will also look into the alternative situations where we will maximize the flow along with minimizing of cost. To resolve these problems we will establish numeric algorithms like distribute method, labeling algorithm, shortest augmented path algorithm, and Preflow-Push algorithms. We will also illustrate functionality on example which confirm appropriate application of algorithms and differences among them.
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English