Searcharxiv⌕ Search

arXiv subjects

Kimmo K. Kaski

Publications and source records attributed to Kimmo K. Kaski.

At least 19 recordsLinked to original sources

Modelling socio-economic effects of the pandemic in a metropolitan area

One of the most notorious measures taken by authorities in every country trying to prevent the uncontrollable spread of the Covid 19 pandemic was to impose severe measures to diminish the mobility of people. In recent publications we proposed a mathematical model to address the consequences of these measures and to predict the infections under different scenarios, for various different countries. In this paper we extend the model, called the BTH--SEIRS-model, to deal with the reduction of mobility in an urban area. The chosen region was the densely-populated metropolitan area around Helsinki, the capital of Finland. This choice obeyed to the fact that there are precise data related to mobility from a mobile telephone company, and that this region was completely isolated from the rest of the country for a short period during the pandemic. We also used public transport data from railways and the accommodation occupation rates in the area of interest. We show that the BTH--SEIRS model is capable of simulating the real infection data as well as the mobility-related economic activity, exhibiting the main trends present in the three indicators used for comparison. Our calculations allow us to highlight the difference of the behaviour of the pandemic in a totally different spatial scale, and to discover the hidden factors that govern the behaviour of people who are forced to commute every day from home to work.

physics.soc-ph↗

Self-Consistency of Entity Sets and Citations in a Deep Research System under Repeated Prompting

Deep research agents (DRA) are commonly used for open-ended synthesis tasks where closed-world QA benchmarks are poorly suited to characterize relevant aspects of performance. We study the self-consistency of one commercial deep research system under repeated identical prompting, representing each report with the set of named entities it mentions, categorised by a custom schema, and the set of citations it retrieves. Across repeated runs of a single open-ended cybersecurity related prompt, we quantify pairwise overlap to characterize how stable the retrieved and synthesized output structure is under repeated identical prompts. In ten runs, the pairwise entity Jaccard results in a median of 0.12 and the pairwise citation Jaccard is below 0.02, with discovery curves that do not visibly saturate. The magnitude and structure of (dis)agreement between entity sets varies by entity class, which suggests that self-consistency in a DRA is better understood as a function of the underlying entity space than as a stable property of the system.

cs.CL↗

AI-Based Vulnerability Assessment Capability and Cyber Attack Graph Analysis

Cyber threats targeting mission-critical infrastructure are becoming more sophisticated while the barrier to launching attacks continues to fall. Traditional point solutions like antivirus and firewalls are reactive and fail to address the combinatorial complexity of modern attack surfaces. This paper presents an investigation combining two complementary methodologies: Lockheed Martin's Vortex/Crow framework, which applies multi-agent reinforcement learning (MARL) over industry-standard cyber knowledge graph to identify and prioritize attack vectors and TTPs (tactics, techniques, and procedures); and Aalto's probabilistic attack graph model that combines network topology and its vulnerabilities to compute system-level risk metrics. The 2015 Ukraine Power Grid cyberattack serves as a well-documented validation scenario. Applied independently to the same operational technology (OT) network topology, both methodologies converge on the same attack vectors and exploit sequences as those documented in the incident record, thus providing mutual cross-validation. Attack graph analyses using node-level elimination experiments identify industrial control systems (ICS) as the most critical enablers of attack propagation, representing high-priority targets for defensive hardening. Comparison of CVSS (v2.0) and IronMiner vulnerability scoring yields in general consistent results, with IronMiner providing more actionable differentiation at network periphery nodes. The layered methodology of baseline assessment and node-level elimination proves to be scalable to large enterprise networks, thus offering defenders a structured, AI-enabled path to prioritize mitigation under realistic time and resource constraints.

cs.CR↗

Diffusion-Induced Spatial Attention Overlapping Community Detection

Detection of overlapping communities is essential for modelling networks in which nodes participate simultaneously in multiple structural or functional groups. Existing graph neural network approaches commonly rely on local message passing, which can obscure community boundaries through smoothing and limit the representation of structurally relevant long-range dependencies. We introduce Diffusion-Induced Spatial Attention Community Detection (DISCO), a deep-learning framework that combines a structural prior derived from influence spreading dynamics, sparse multi-head attention, and non-negative community-affiliation learning. The prior identifies candidate interactions beyond immediate graph neighbours and biases attention according to their structural proximity, while a Bernoulli-Poisson edge-reconstruction objective enables overlapping community inference from node attributes and structural profiles, or both. Benchmark experiments show that DISCO performs competitively against established graph convolutional and graph attention approaches across different input configurations. To demonstrate its practical applicability, we present a proof-of-concept cybersecurity use case in which changes between community assignments inferred from consecutive communication-network snapshots provide an interpretable anomaly signal. Temporal community similarity identifies structural deviations, while node-level contributions help locate the devices associated with them. DISCO therefore provides both a flexible method for overlapping community detection and a foundation for analysing structural change in dynamic networks.

cs.SI↗

Comparing Probabilistic Influence-Spreading Centralities to Commonly-Used Centrality Measures in Directed and Weighted Networks

The Influence-Spreading Model (ISM) introduces three probabilistic centrality measures: out-centrality, in-centrality, and ISM betweenness centrality. Out-centrality measures the average probability that a node influences others, while in-centrality measures the average probability that others influence a node. ISM betweenness centrality measures the change in total probabilistic influence when a node is removed. These measures depend on edge transmission probabilities and allow walks up to a specified maximum length. We compare the ISM centrality measures to commonly used weighted variants of out-degree, in-degree, closeness, shortest-path betweenness, and Katz centrality in directed, weighted networks using four real-world online social networks and nine synthetic networks generated by Erdős-Rényi, navigable small-world, and directed scale-free models. For the synthetic networks, the edge probabilities are drawn from three beta distributions. We evaluate the similarity in centrality values and their ranking using Pearson correlation and Spearman's rank correlation coefficients. Results show strong correlations between the ISM out-centrality and weighted out-degree and outward Katz centrality, particularly for low edge probabilities. Conversely, relationships between the ISM in-centrality and other measures vary with network topology, sometimes yielding negative correlations. Correlations between the ISM betweenness and the shortest-path betweenness are also topology-dependent and weaken as alternative influence paths become more relevant. Overall, standard centrality measures can approximate the influence of broadcasting influence but often miss the nuances of receiving influence and probabilistic intermediary roles.

cs.SI↗

Spatio-Temporal Attention Graph Neural Network: Explaining Causalities With Attention

Industrial Control Systems (ICS) underpin critical infrastructure and face growing cyber-physical threats due to the convergence of operational technology and networked environments. While machine learning-based anomaly detection approaches in ICS shows strong theoretical performance, deployment is often limited by poor explainability, high false-positive rates, and sensitivity to evolving system behavior, i.e., baseline drifting. We propose a Spatio-Temporal Attention Graph Neural Network (STA-GNN) for unsupervised and explainable anomaly detection in ICS that models both temporal dynamics and relational structure of the system. Sensors, controllers, and network entities are represented as nodes in a dynamically learned graph, enabling the model to capture inter-dependencies across physical processes and communication patterns. Attention mechanisms provide influential relationships, supporting inspection of correlations and potential causal pathways behind detected events. The approach supports multiple data modalities, including SCADA point measurements, network flow features, and payload features, and thus enables unified cyber-physical analysis. To address operational requirements, we incorporate a conformal prediction strategy to control false alarm rates and monitor performance degradation under drifting of the environment. Our findings highlight the possibilities and limitations of model evaluation and common pitfalls in anomaly detection in ICS. Our findings emphasise the importance of explainable, drift-aware evaluation for reliable deployment of learning-based security monitoring systems.

cs.LG↗

Integrating Network and Attack Graphs for Service-Centric Impact Analysis

Cyberattacks on enterprise networks exploit complex dependencies among infrastructure, services, and applications, which challenge traditional analysis methods that focus on attack paths or network topology in isolation. In this study, we introduce a novel probabilistic multilayer modelling framework, based on influence propagation in networks, that integrates attack graphs with the communication network topology, enabling a service-centric impact analysis of cyberattacks. Our method captures both the vulnerability exploitability and network connectivity, allowing us to assess the likelihood of attack propagation and cumulative impacts across interconnected services. By integrating standard vulnerability metrics (such as CVSS) with the network-level connectivity probabilities, the framework provides a cohesive view of the dynamics of cyberattacks. We validate this approach using a realistic case study of an enterprise network, demonstrating its ability to determine critical nodes, vulnerabilities, and service dependencies that significantly influence attack outcomes. Our findings show that integrating network and attack graph perspectives offers more actionable insights into risk assessment and mitigation planning, advancing the analysis of cyberattacks in complex networked environments.

cs.CR↗

Dynamical Model for the Sustainable Development Goals

The 2030 Agenda for Sustainable Development of the United Nations outlines 17 goals as global challenges for countries of the world to address in their development. However, the progress of countries towards these goals has been much slower than expected. In a previous study, we analyzed the data over two decades (2000--2022), using unsupervised machine learning techniques. Based on this study, we take into account three main factors to construct a mathematical model to simulate and predict the dynamical behavior of the SDGs. These factors are: (1) the distribution of amount of resources that each country uses to meet the goals, (2) the cooperation between countries, and (3) the correlations between the goals. In this work, we show that the model is capable of reproducing the real data and therefore could be used to simulate hypothetical scenarios that could help to improve actions towards optimal fulfillment of the goals.

physics.soc-ph↗

Automatic Simplification of Common Vulnerabilities and Exposures Descriptions

Understanding cyber security is increasingly important for individuals and organizations. However, a lot of information related to cyber security can be difficult to understand to those not familiar with the topic. In this study, we focus on investigating how large language models (LLMs) could be utilized in automatic text simplification (ATS) of Common Vulnerability and Exposure (CVE) descriptions. Automatic text simplification has been studied in several contexts, such as medical, scientific, and news texts, but it has not yet been studied to simplify texts in the rapidly changing and complex domain of cyber security. We created a baseline for cyber security ATS and a test dataset of 40 CVE descriptions, evaluated by two groups of cyber security experts in two survey rounds. We have found that while out-of-the box LLMs can make the text appear simpler, they struggle with meaning preservation. Code and data are available at https://version.aalto.fi/gitlab/vehomav1/simplification\_nmi.

cs.CL↗

Network Centrality Metrics Based on Unrestricted Paths, Walks and Cycles Compared to Standard Centrality Metrics

Traditional measures of closeness and betweenness centrality in networks rely on the shortest paths between nodes. Many standard metrics fail to accurately reflect the physical or probabilistic characteristics of nodal centrality and network flow, often overlooking processes such as cyclic and recurrent spreading. Here, we present new metrics based on our influence spreading model. These probabilistic measures consider all feasible paths, walks, and cycles within the network. We define in-centrality to assess how central a node is as a target of influence, and out-centrality for its role as a source of influence. We compare our metrics with standard ones by analyzing node rankings, using scatter plots, and calculating the Pearson correlation and Spearman's rank correlation coefficients. Our findings show that the betweenness centrality defined by the influence spreading model emphasizes the importance of alternative routes while maintaining similarity to standard betweenness centrality.

cs.SI↗

Sustainable Visions: Unsupervised Machine Learning Insights on Global Development Goals

The 2030 Agenda for Sustainable Development of the United Nations outlines 17 goals for countries of the world to address global challenges in their development. However, the progress of countries towards these goal has been slower than expected and, consequently, there is a need to investigate the reasons behind this fact. In this study, we have used a novel data-driven methodology to analyze time-series data for over 20 years (2000-2022) from 107 countries using unsupervised machine learning (ML) techniques. Our analysis reveals strong positive and negative correlations between certain SDGs (Sustainable Development Goals). Our findings show that progress toward the SDGs is heavily influenced by geographical, cultural and socioeconomic factors, with no country on track to achieve all the goals by 2030. This highlights the need for a region-specific, systemic approach to sustainable development that acknowledges the complex interdependencies between the goals and the variable capacities of countries to reach them. For this our machine learning based approach provides a robust framework for developing efficient and data-informed strategies to promote cooperative and targeted initiatives for sustainable progress.

cs.LG↗

Exploration of the effects of epidemics on the regional socio-economics: a modelling approach

Pandemics, in addition to affecting the health of populations, can have huge impacts on their social and economic behavior. These factors, on the other hand, have the potential to feed back to and influence the disease spreading. It is important to systematically study these interrelations, to determine which ones have significant effects, and whether the effects are adverse or beneficial. Our recently developed epidemic model with agent-based and geographical elements is used in this study for such a purpose. We perform an extensive parameter space exploration of the socio-economic part of the model, including factors like the attitudes (called values) of the agents towards the disease spreading, health, economic situation, and regulations by government agents. We search for prominent patterns from the resulting simulated data using basic classification tools, namely self-organizing maps and principal component analysis. We seek to isolate the most important value parameters of the population and government agents influencing the disease spreading speed and patterns, and monitor different quantities of the model output, such as infection rates, the propagation speed of the epidemic, economic activity, government regulations, and the compliance of population. Out of these, the ones describing the epidemic spreading were resulting in the most distinctive clustering of the data, and they were selected as the basis of the remaining analysis. We relate the found clusters to three distinct types of disease spreading: wave-like, chaotic, and transitional spreading patterns. The most important value parameter contributing to phase changes between these phases was found to be the compliance of the population agents towards the government regulations.

physics.soc-ph↗

Modeling the interplay between epidemics and regional socio-economics

In this study we present a dynamical agent-based model to investigate the interplay between the socio-economy of and SEIRS-type epidemic spreading over a geographical area, divided to smaller area districts and further to smallest area cells. The model treats the populations of cells and authorities of districts as agents, such that the former can reduce their economic activity and the latter can recommend economic activity reduction both with the overall goal to slow down the epidemic spreading. The agents make decisions with the aim of attaining as high socio-economic standings as possible relative to other agents of the same type by evaluating their standings based on the local and regional infection rates, compliance to the authorities' regulations, regional drops in economic activity, and efforts to mitigate the spread of epidemic. We find that the willingness of population to comply with authorities' recommendations has the most drastic effect on the epidemic spreading: periodic waves spread almost unimpeded in non-compliant populations, while in compliant ones the spread is minimal with chaotic spreading pattern and significantly lower infection rates. Health and economic concerns of agents turn out to have lesser roles, the former increasing their efforts and the latter decreasing them.

physics.soc-ph↗

Modelling Covid-19 epidemic in Mexico, Finland and Iceland

Over the past two decades there has been a number of global outbreaks of viral diseases. This has accelerated the efforts to model and forecast the disease spreading, in order to find ways to confine the spreading regionally and between regions. Towards this we have devised a model of geographical spreading of viral infections due to human spatial mobility and adapted it to the latest COVID-19 pandemic. In this the region to be modelled is overlaid with a two-dimensional grid weighted with the population density defined cells, in each of which a compartmental SEIRS system of delay difference equations simulate the local dynamics (microdynamics) of the disease. The infections between cells are stochastic and allow for the geographical spreading of the virus over the two-dimensional space (macrodynamics). This approach allows to separate the parameters related to the biological aspects of the disease from the ones that represent the spatial contagious behaviour through different kinds of mobility of people acting as virus carriers. These provide sufficient information to trace the evolution of the pandemic in different situations. In particular we have applied this approach to three in many ways different countries, Mexico, Finland and Iceland and found that the model is capable of reproducing and predicting the stochastic global path of the pandemic. This study sheds light on how the diverse cultural and socioeconomic aspects of a country influence the evolution of the epidemics and also the efficacy of social distancing and other confinement measures.

physics.soc-ph↗

Dynamical properties of hierarchical networks of Van Der Pol oscillators

Oscillator networks found in social and biological systems are characterized by the presence of wide ranges of coupling strengths and complex organization. Yet robustness and synchronization of oscillations are found to emerge on macro-scales that eventually become key to the functioning of these systems. In order to model this kind of dynamics observed, for example, in systems of circadian oscillators, we study networks of Van der Pol oscillators that are connected with hierarchical couplings. For each isolated oscillator we assume the same fundamental frequency. Using numerical simulations, we show that the coupled system goes to a phase-locked state, with both phase and frequency being the same for every oscillator at each level of the hierarchy. The observed frequency at each level of the hierarchy changes, reaching an asymptotic lowest value at the uppermost level. Notably, the asymptotic frequency can be tuned to any value below the fundamental frequency of an uncoupled Van der Pol oscillator. We compare the numerical results with those of an approximate analytic solution and find them to be in qualitative agreement.

physics.soc-ph↗

Status maximization as a source of fairness in a networked dictator game

Human behavioural patterns exhibit selfish or competitive, as well as selfless or altruistic tendencies, both of which have demonstrable effects on human social and economic activity. In behavioural economics, such effects have traditionally been illustrated experimentally via simple games like the dictator and ultimatum games. Experiments with these games suggest that, beyond rational economic thinking, human decision-making processes are influenced by social preferences, such as an inclination to fairness. In this study we suggest that the apparent gap between competitive and altruistic human tendencies can be bridged by assuming that people are primarily maximising their status, i.e., a utility function different from simple profit maximisation. To this end we analyse a simple agent-based model, where individuals play the repeated dictator game in a social network they can modify. As model parameters we consider the living costs and the rate at which agents forget infractions by others. We find that individual strategies used in the game vary greatly, from selfish to selfless, and that both of the above parameters determine when individuals form complex and cohesive social networks.

cs.MA↗

Modelling community formation driven by the status of individual in a society

In human societies, people's willingness to compete and strive for better social status as well as being envious of those perceived in some way superior lead to social structures that are intrinsically hierarchical. Here we propose an agent-based, network model to mimic the ranking behaviour of individuals and its possible repercussions in human society. The main ingredient of the model is the assumption that the relevant feature of social interactions is each individual's keenness to maximise his or her status relative to others. The social networks produced by the model are homophilous and assortative, as frequently observed in human communities and most of the network properties seem quite independent of its size. However, it is seen that for small number of agents the resulting network consists of disjoint weakly connected communities while being highly assortative and homophilic. On the other hand larger networks turn out to be more cohesive with larger communities but less homophilic. We find that the reason for these changes is that larger network size allows agents to use new strategies for maximizing their social status allowing for more diverse links between them.

cs.MA↗

Modelling Trading Networks and the Role of Trust

We present a simple dynamical model for describing trading interactions between agents in a social network by considering only two dynamical variables, namely money and goods or services, that are assumed conserved over the whole time span of the agents' trading transactions. A key feature of the model is that agent-to-agent transactions are governed by the price in units of money per goods, which is dynamically changing, and by a trust variable, which is related to the trading history of each agent. All agents are able to sell or buy, and the decision to do either has to do with the level of trust the buyer has in the seller, the price of the goods and the amount of money and goods at the disposal of the buyer. Here we show the results of extensive numerical calculations under various initial conditions in a random network of agents and compare the results with the available related data. In most cases the agreement between the model results and real data turns out to be fairly good, which allow us to draw some general conclusions as how different trading strategies could affect the distribution of wealth in different kinds of societies.

physics.soc-ph↗