| 1. |
- Bohlin, Ludvig, 1986-
(författare)
-
Toward higher-order network models
- 2018
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Complex systems play an essential role in our daily lives. These systems consist of many connected components that interact with each other. Consider, for example, society with billions of collaborating individuals, the stock market with numerous buyers and sellers that trade equities, or communication infrastructures with billions of phones, computers and satellites.The key to understanding complex systems is to understand the interaction patterns between their components - their networks. To create the network, we need data from the system and a model that organizes the given data in a network representation. Today's increasing availability of data and improved computational capacity for analyzing networks have created great opportunities for the network approach to further prosper. However, increasingly rich data also gives rise to new challenges that question the effectiveness of the conventional approach to modeling data as a network. In this thesis, we explore those challenges and provide methods for simplifying and highlighting important interaction patterns in network models that make use of richer data.Using data from real-world complex systems, we first show that conventional network modeling can provide valuable insights about the function of the underlying system. To explore the impact of using richer data in the network representation, we then expand the analysis for higher-order models of networks and show why we need to go beyond conventional models when there is data that allows us to do so. In addition, we also present a new framework for higher-order network modeling and analysis. We find that network models that capture richer data can provide more accurate representations of many real-world complex systems.
|
|
| 2. |
- Bohlin, Ludvig, et al.
(författare)
-
Community Detection and Visualization of Networks with the Map Equation Framework
- 2014
-
Ingår i: Measuring Scholarly Impact. - Cham : Springer. - 9783319103761 - 9783319103778 ; , s. 3-34
-
Bokkapitel (refereegranskat)abstract
- Large networks contain plentiful information about the organization of a system. The challenge is to extract useful information buried in the structure of myriad nodes and links. Therefore, powerful tools for simplifying and highlighting important structures in networks are essential for comprehending their organization. Such tools are called community-detection methods and they are designed to identify strongly intraconnected modules that often correspond to important functional units. Here we describe one such method, known as the map equation, and its accompanying algorithms for finding, evaluating, and visualizing the modular organization of networks. The map equation framework is very flexible and can identify two-level, multi-level, and overlapping organization in weighted, directed, and multiplex networks with its search algorithm Infomap. Because the map equation framework operates on the flow induced by the links of a network, it naturally captures flow of ideas and citation flow, and is therefore well-suited for analysis of bibliometric networks.
|
|
| 3. |
- Bohlin, Ludvig, et al.
(författare)
-
Robustness of journal rankings by network flows with different amounts of memory
- 2016
-
Ingår i: Journal of the Association for Information Science and Technology. - : Wiley. - 2330-1635 .- 2330-1643. ; 67:10, s. 2527-2535
-
Tidskriftsartikel (refereegranskat)abstract
- As the number of scientific journals has multiplied, journal rankings have become increasingly important for scientific decisions. From submissions and subscriptions to grants and hirings, researchers, policy makers, and funding agencies make important decisions influenced by journal rankings such as the ISI journal impact factor. Typically, the rankings are derived from the citation network between a selection of journals and unavoidably depend on this selection. However, little is known about how robust rankings are to the selection of included journals. We compare the robustness of three journal rankings based on network flows induced on citation networks. They model pathways of researchers navigating the scholarly literature, stepping between journals and remembering their previous steps to different degrees: zero-step memory as impact factor, one-step memory as Eigenfactor, and two-step memory, corresponding to zero-, first-, and second-order Markov models of citation flow between journals. We conclude that higher-order Markov models perform better and are more robust to the selection of journals. Whereas our analysis indicates that higher-order models perform better, the performance gain for higher-order Markov models comes at the cost of requiring more citation data over a longer time period.
|
|
| 4. |
- Bohlin, Ludvig, et al.
(författare)
-
Stock Portfolio Structure of Individual Investors Infers Future Trading Behavior
- 2014
-
Ingår i: PLOS ONE. - : plos one. - 1932-6203. ; 9:7, s. e103006-
-
Tidskriftsartikel (refereegranskat)abstract
- Although the understanding of and motivation behind individual trading behavior is an important puzzle in finance, little is known about the connection between an investor's portfolio structure and her trading behavior in practice. In this paper, we investigate the relation between what stocks investors hold, and what stocks they buy, and show that investors with similar portfolio structures to a great extent trade in a similar way. With data from the central register of shareholdings in Sweden, we model the market in a similarity network, by considering investors as nodes, connected with links representing portfolio similarity. From the network, we find investor groups that not only identify different investment strategies, but also represent individual investors trading in a similar way. These findings suggest that the stock portfolios of investors hold meaningful information, which could be used to earn a better understanding of stock market dynamics.
|
|
| 5. |
- Edler, Daniel, et al.
(författare)
-
Mapping Higher-Order Network Flows in Memory and Multilayer Networks with Infomap
- 2017
-
Ingår i: Algorithms. - : MDPI AG. - 1999-4893. ; 10:4
-
Tidskriftsartikel (refereegranskat)abstract
- Comprehending complex systems by simplifying and highlighting important dynamical patterns requires modeling and mapping higher-order network flows. However, complex systems come in many forms and demand a range of representations, including memory and multilayer networks, which in turn call for versatile community-detection algorithms to reveal important modular regularities in the flows. Here we show that various forms of higher-order network flows can be represented in a unified way with networks that distinguish physical nodes for representing a complex system's objects from state nodes for describing flows between the objects. Moreover, these so-called sparse memory networks allow the information-theoretic community detection method known as the map equation to identify overlapping and nested flow modules in data from a range of different higher-order interactions such as multistep, multi-source, and temporal data. We derive the map equation applied to sparse memory networks and describe its search algorithm Infomap, which can exploit the flexibility of sparse memory networks. Together they provide a general solution to reveal overlapping modular patterns in higher-order flows through complex systems.
|
|
| 6. |
- Karimi, Fariba, 1981-, et al.
(författare)
-
Mapping bilateral information interests using the activity of Wikipedia editors
- 2015
-
Ingår i: Palgrave communications. - : Springer Science and Business Media LLC. - 2055-1045. ; 1, s. 1-7
-
Tidskriftsartikel (refereegranskat)abstract
- We live in a global village where electronic communication has eliminated the geographical barriers of information exchange. The road is now open to worldwide convergence of information interests, shared values and understanding. Nevertheless, interests still vary between countries around the world. This raises important questions about what today’s world map of information interests actually looks like and what factors cause the barriers of information exchange between countries. To quantitatively construct a world map of information interests, we devise a scalable statistical model that identifies countries with similar information interests and measures the countries’ bilateral similarities. From the similarities we connect countries in a global network and find that countries can be mapped into 18 clusters with similar information interests. Through regression we find that language and religion best explain the strength of the bilateral ties and formation of clusters. Our findings provide a quantitative basis for further studies to better understand the complex interplay between shared interests and conflict on a global scale. The methodology can also be extended to track changes over time and capture important trends in global information exchange.
|
|
| 7. |
- Persson, Christian, et al.
(författare)
-
Maps of sparse Markov chains efficiently reveal community structure in network flows with memory
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- To better understand the flows of ideas or information through social and biological systems, researchers develop maps that reveal important patterns in network flows. In practice, network flow models have implied memoryless first-order Markov chains, but recently researchers have introduced higher-order Markov chain models with memory to capture patterns in multi-step pathways. Higher-order models are particularly important for effectively revealing actual, overlapping community structure, but higher-order Markov chain models suffer from the curse of dimensionality: their vast parameter spaces require exponentially increasing data to avoid overfitting and therefore make mapping inefficient already for moderate-sized systems. To overcome this problem, we introduce an efficient cross-validated mapping approach based on network flows modeled by sparse Markov chains. To illustrate our approach, we present a map of citation flows in science with research fields that overlap in multidisciplinary journals. Compared with currently used categories in science of science studies, the research fields form better units of analysis because the map more effectively captures how ideas flow through science.
|
|
