Browsing by Author "Karjalainen, Joona"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
Item Comparison of Simulation and Performance Models of a Tracking System(2014-10-15) Karjalainen, Joona; Harju, Mikko; Perustieteiden korkeakoulu; Virtanen, KaiItem Convergence of Estimators in Large Stochastic Affiliation Network Models(2015-12-08) Karjalainen, Joona; Leskelä, Lasse; Perustieteiden korkeakoulu; Leskelä, LasseItem Diskreetti momenttiongelma stokastisen lohkomallin estimoinnissa(2018-09-18) Lehtonen, Jaakko; Karjalainen, Joona; Perustieteiden korkeakoulu; Korte, RiikkaItem Structure and estimation of network models with overlapping communities(Aalto University, 2021) Karjalainen, Joona; Matematiikan ja systeemianalyysin laitos; Department of Mathematics and Systems Analysis; Perustieteiden korkeakoulu; School of Science; Leskelä, Lasse, Assoc. Prof., Aalto University, Department of Mathematics and Systems Analysis, FinlandMany types of data in different fields of science can be naturally represented as networks. Social relationships in groups of people, the structure of the internet, and traffic networks can all be understood as collections of nodes and connections between them. Real-world networks often show signs of community structure, i.e., some groups of nodes are more densely connected to each other than to the rest of the nodes. Since communities may emerge through many different mechanisms, it is natural to describe these networks with statistical models where the communities are allowed to overlap. Even in the absence of obvious communities, various other types of structure are commonly observed in data. For example, the degrees of adjacent nodes tend to be correlated, and node pairs have an increased probability of being adjacent if they have common neighbors. This dissertation is concerned with the structure of large and sparse statistical network models with overlapping communities. This structure is described using statistical quantities and distributions and their limits as the number of nodes tends to infinity. The focus is on the asymptotic behavior of subgraph frequencies, joint degree distributions of adjacent nodes, and various summary statistics. New results are proved on their convergence, and exact formulas are provided for their limits. These results lead to new estimators of the model parameters based on counting the frequencies of small subgraphs. The consistency of these estimators is proved under complete or partly incomplete data. The results show that the models have structural similarities with many real-world networks, such as non-trivial clustering, degree correlations, and power laws. This illustrates how some empirical observations on network data can be explained with an underlying overlapping community structure.Item Suurten satunnaisten leikkausverkkojen simulointi ja estimointi(2017-10-24) Koskinen, Tuomas; Karjalainen, Joona; Perustieteiden korkeakoulu; Leskelä, Lasse
