|
|
Social Network Analysis and Simulations
Vorlová, Pavla ; Král, Jiří (referee) ; Samek, Jan (advisor)
This diploma thesis is focusing on description of processing social network analysis, design and implementation of a model that simulates a particular social network and its analysis. Social networks are modern and very used in this time. They are very good point for exploring. This project deal with static analysis social network, where social network is constructed by graph. We nd out di erent properties of single component and than we establish signi cance of them. Relationships between components are important too for us, because they have a big influence on propagation information in network. Structural properties figure out existence of di fferent communities. We simulate social network with multi-agent systems, they are desirable for represent changes in network. Multi-agent systems have implemented a simulation model that represents a particular social network. His behaviour was analyzed and examinated by chosen methods.
|
|
|
Vlastnosti síťových centralit
Pokorná, Aneta ; Hartman, David (advisor) ; Balko, Martin (referee)
The need to understand the structure of complex networks increases as both their complexity and the dependency of human society on them grows. Network centralities help to recognize the key elements of these networks. Betweenness centrality is a network centrality measure based on shortest paths. More precisely, the contribution of a pair of vertices u, v to a vertex w ̸= u, v is the fraction of the shortest uv-paths which lead through w. Betweenness centrality is then given by the sum of contributions of all pairs of vertices u, v ̸= w to w. In this work, we have summarized known results regarding both exact values and bounds on betweenness. Additionally, we have improved an existing bound and obtained more exact formulation for r-regular graphs. We have made two major contributions about betweenness uniform graphs, whose vertices have uniform betweenness value. The first is that all betweenness uniform graphs of order n with maximal degree n − k have diameter at most k, by which we have solved a conjecture posed in the literature. The second major result is that betweenness uniform graphs nonisomorphic to a cycle that are either vertex- or edge-transitive are 3-connected, by which we have partially solved another conjecture. 1
|
|
|
Hierarchical Structure Analysis with Applications to the EU Member States Convergence
Fučík, Vojtěch ; Krištoufek, Ladislav (advisor) ; Bobková, Božena (referee)
The main objective of this thesis is to summarize and possibly extend the existing methodology on correlation matrix filtering, hierarchical clustering and topological classification in the economic networks. In the thesis we use classical MST/HT approach supplemented by edges stability analysis and centrality measures analysis. Graphical objects MST and HT enable us to find relations among the elements of the network. Centrality measures anal- ysis helps us to find the hubs in the network and stability analysis determines the reliability of the resulting model. Presented methodology is then utilized for convergence analysis in the EU and for analysis of clusters in the EU's MSTs and HTs. We detected large clusters of former communist countries for every economic indicator, clusters based on geographical location such as Nordic, Baltic, BENELUX or former ECSC countries and a cluster of PIGS countries. We also found that Spain plays a role of a central node in debt/deficit indicator analysis which made us to express our concerns about potential future problems. 1
|
|
|
Social Network Analysis and Simulations
Vorlová, Pavla ; Král, Jiří (referee) ; Samek, Jan (advisor)
This diploma thesis is focusing on description of processing social network analysis, design and implementation of a model that simulates a particular social network and its analysis. Social networks are modern and very used in this time. They are very good point for exploring. This project deal with static analysis social network, where social network is constructed by graph. We nd out di erent properties of single component and than we establish signi cance of them. Relationships between components are important too for us, because they have a big influence on propagation information in network. Structural properties figure out existence of di fferent communities. We simulate social network with multi-agent systems, they are desirable for represent changes in network. Multi-agent systems have implemented a simulation model that represents a particular social network. His behaviour was analyzed and examinated by chosen methods.
|
|
|
Models and methods for network economies
BÖHM, Petr
The goal is to create a summary of models and methods for network economies including network structure, a dynamic and uncertain environment, factors more criteria in the network economy. Deeper deal with graph theory, networks and supply networks. Part of this work is the analytical part, where the patterns and using them I find the position of nodes in the network data from Lidé.cz and eBay. I demonstrate the models and calculations.
|
guest ::
