This paper concerns the study of the linear threshold model in random networks, specifically in Erdös-Rényi networks. In our approach, we consider an activation threshold defined by the expected value for the node degree and the associate...
This paper introduces the mathematical formalization of two probabilistic procedures for susceptible-infected-recovered (SIR) and susceptible-infected-susceptible (SIS) infectious diseases epidemic models, over Erdös-Rényi contact network...
This paper proposes a new approach to integrating Q learning into the fuzzy linear programming (FLP) paradigm to improve peer selection in P2P networks. Using Q learning, the proposed method employs real-time feedback to adjust and update peer select...
We perform a detailed (computational) scaling study of well-known general indices (the first and second variable Zagreb indices, M1α(G) and M2α(G), and the general sum-connectivity index, χα(G)) as well as of general versions of...
Mathematical models of the spread of epidemic diseases are studied, paying special attention to networks. We treat the Susceptible-Infected-Recovered (SIR) model and the Susceptible-Exposed-Infectious-Recovered (SEIR) model described by differential...
11 July 2019
We present a series of SIR-network models, extended with a game-theoretic treatment of imitation dynamics which result from regular population mobility across residential and work areas and the ensuing interactions. Each considered SIR-network model...
We define a new family of random geometric graphs which we call random covering graphs and study its statistical properties. To the best of our knowledge, this family of graphs has not been explored in the past. Our experimental results suggest that...
In the present work, we study the introduction of a latent interaction index, examining its impact on the formation and development of complex networks. This index takes into account both observed and unobserved heterogeneity per node in order to ove...
On some regular and non-regular topologies, we studied the critical properties of models that present up-down symmetry, like the equilibrium Ising model and the nonequilibrium majority vote model. These are investigated on networks, like Apollonian (...
We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random netw...
Extended connectivity in graphs can be analyzed through k-path Laplacian matrices, which permit the capture of long-range interactions in various real-world networked systems such as social, transportation, and multi-agent networks. In this work, we...
In this study, we propose a load-redistribution-based practical cascading failure model that analyses the dynamic behaviour of a power system upon the occurrence of node failures. The proposed model pays particular attention to the load model and its...
In this study, we explore the depth measures for flow hierarchy in directed networks. Two simple measures are defined—rooted depth and relative depth—and their properties are discussed. The method of loop collapse is introduced, allowing...
The present paper reports simulation results for a simple model of reference group influence on market choices, e.g., brand selection. The model was simulated on three types of random graphs, Erdos–Renyi, Barabasi–Albert, and Watts–Strogatz. The esti...
We demonstrate the use of agent-based models to simulate the interactions of two mobile dating applications that possess divergent interaction features. We reproduce several expected outcomes when compared to extant literature. We also demonstrate th...
With the rapid development of network science, Turing patterns on complex networks have attracted extensive attention from researchers. In this paper, we focus on spatial patterns in multiplex ER (Erdös-Rényi) random networks, taking the...
Centrality is one of the most studied concepts in network analysis. Despite an abundance of methods for measuring centrality in social networks has been proposed, each approach exclusively characterizes limited parts of what it implies for an actor t...
A discrete version of opinion dynamics systems, based on the Biswas–Chatterjee–Sen (BChS) model, has been studied on Barabási–Albert networks (BANs). In this model, depending on a pre-defined noise parameter, the mutual affin...
This paper proposes a model of the dynamics of credit contagion through non-performing loans on financial networks. Credit risk contagion is modeled in the context of the classical SIS (Susceptibles-Infected-Susceptibles) epidemic processes on networ...
The ultimate objective of research on hypernetwork robustness is to enhance its capability to withstand external attacks and natural disasters. For hypernetworks such as telecommunication networks, public safety networks, and military networks—...
The spatial optimization method between combinatorial optimization problems and GIS has many geographical applications. The p-center problem is a classic NP-hard location modeling problem, which has essential applications in many real-world scenarios...
In network analysis, developing a unified theoretical framework that can compare methods under different models is an interesting problem. This paper proposes a partial solution to this problem. We summarize the idea of using a separation condition f...
Finding hidden infected nodes is extremely important when information or diseases spread rapidly in a network because hints regarding the global properties of the diffusion dynamics can be provided, and effective control strategies for mitigating suc...
Brain dynamics show a rich spatiotemporal behavior whose stability is neither ordered nor chaotic, indicating that neural networks operate at intermediate stability regimes including critical dynamics represented by a negative power-law distribution...
Active distribution networks (ADNs) are a typical cyber–physical system (CPS), which consist of two kinds of interdependent sub-networks: power networks (PNs) and communication networks (CNs). The combination of typical characteristics of the A...
14 September 2020
The occurrence of popular social events causes fluctuations and changes of public emotions, while the rapid development of online social platforms and networks has made individual interactions more intense and further escalated public emotions into p...
We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on the Barabási–Albert (...