Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHeterogeneous nucleation on complex networks with mobile impurities
125
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the heterogeneous nucleation of Ising model on complex networks under a non-equilibrium situation where the impurities perform degree-biased motion controlled by a parameter alpha. Through the forward flux sampling and detailed analysis on the nucleating clusters, we find that the nucleation rate shows a nonmonotonic dependence on alpha for small number of impurities, in which a maximal nucleation rate occurs at alpha=0 corresponding to the degree-uncorrelated random motion. Furthermore, we demonstrate the distinct features of the nucleating clusters along the pathway for different preference of impurities motion, which may be used to understand the resonance-like dependence of nucleation rate on the motion bias of impurities. Our theoretical analysis shows that the nonequilibrium diffusion of impurities can always induce a positive energy flux that can facilitate the barrier-crossing nucleation process. The nonmonotonic feature of the average value of the energy flux with alpha may be the origin of our simulation results.
rate research
Read More
Power grids, road maps, and river streams are examples of infrastructural networks which are highly vulnerable to external perturbations. An abrupt local change of load (voltage, traffic density, or water level) might propagate in a cascading way and affect a significant fraction of the network. Almost discontinuous perturbations can be modeled by shock waves which can eventually interfere constructively and endanger the normal functionality of the infrastructure. We study their dynamics by solving the Burgers equation under random perturbations on several real and artificial directed graphs. Even for graphs with a narrow distribution of node properties (e.g., degree or betweenness), a steady state is reached exhibiting a heterogeneous load distribution, having a difference of one order of magnitude between the highest and average loads. Unexpectedly we find for the European power grid and for finite Watts-Strogatz networks a broad pronounced bimodal distribution for the loads. To identify the most vulnerable nodes, we introduce the concept of node-basin size, a purely topological property which we show to be strongly correlated to the average load of a node.
In the last two decades, network science has blossomed and influenced various fields, such as statistical physics, computer science, biology and sociology, from the perspective of the heterogeneous interaction patterns of components composing the complex systems. As a paradigm for random and semi-random connectivity, percolation model plays a key role in the development of network science and its applications. On the one hand, the concepts and analytical methods, such as the emergence of the giant cluster, the finite-size scaling, and the mean-field method, which are intimately related to the percolation theory, are employed to quantify and solve some core problems of networks. On the other hand, the insights into the percolation theory also facilitate the understanding of networked systems, such as robustness, epidemic spreading, vital node identification, and community detection. Meanwhile, network science also brings some new issues to the percolation theory itself, such as percolation of strong heterogeneous systems, topological transition of networks beyond pairwise interactions, and emergence of a giant cluster with mutual connections. So far, the percolation theory has already percolated into the researches of structure analysis and dynamic modeling in network science. Understanding the percolation theory should help the study of many fields in network science, including the still opening questions in the frontiers of networks, such as networks beyond pairwise interactions, temporal networks, and network of networks. The intention of this paper is to offer an overview of these applications, as well as the basic theory of percolation transition on network systems.
Forecasting the evolution of contagion dynamics is still an open problem to which mechanistic models only offer a partial answer. To remain mathematically or computationally tractable, these models must rely on simplifying assumptions, thereby limiting the quantitative accuracy of their predictions and the complexity of the dynamics they can model. Here, we propose a complementary approach based on deep learning where the effective local mechanisms governing a dynamic on a network are learned from time series data. Our graph neural network architecture makes very few assumptions about the dynamics, and we demonstrate its accuracy using different contagion dynamics of increasing complexity. By allowing simulations on arbitrary network structures, our approach makes it possible to explore the properties of the learned dynamics beyond the training data. Finally, we illustrate the applicability of our approach using real data of the COVID-19 outbreak in Spain. Our results demonstrate how deep learning offers a new and complementary perspective to build effective models of contagion dynamics on networks.
Community structure is one of the most relevant features encountered in numerous real-world applications of networked systems. Despite the tremendous effort of scientists working on this subject over the past few decades to characterize, model, and analyze communities, more investigations are needed to better understand the impact of community structure and its dynamics on networked systems. Here, we first focus on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms. We discuss modularity and the use of modularity maximization as the basis for community detection. Then, we overview the Stochastic Block Model, its different variants, and inference of community structures from such models. Next, we focus on time evolving networks, where existing nodes and links can disappear and/or new nodes and links may be introduced. The extraction of communities under such circumstances poses an interesting and non-trivial problem that has gained considerable interest over the last decade. We briefly discuss considerable advances made in this field recently. Finally, we focus on immunization strategies essential for targeting the influential spreaders of epidemics in modular networks. Their main goal is to select and immunize a small proportion of individuals from the whole network to control the diffusion process. Various strategies have emerged over the years suggesting different ways to immunize nodes in networks with overlapping and non-overlapping community structure. We first discuss stochastic strategies that require little or no information about the network topology at the expense of their performance. Then, we introduce deterministic strategies that have proven to be very efficient in controlling the epidemic outbreaks, but require complete knowledge of the network.
The majority-vote model with noise is one of the simplest nonequilibrium statistical model that has been extensively studied in the context of complex networks. However, the relationship between the critical noise where the order-disorder phase transition takes place and the topology of the underlying networks is still lacking. In the paper, we use the heterogeneous mean-field theory to derive the rate equation for governing the models dynamics that can analytically determine the critical noise $f_c$ in the limit of infinite network size $Nrightarrow infty$. The result shows that $f_c$ depends on the ratio of ${leftlangle k rightrangle }$ to ${leftlangle k^{3/2} rightrangle }$, where ${leftlangle k rightrangle }$ and ${leftlangle k^{3/2} rightrangle }$ are the average degree and the $3/2$ order moment of degree distribution, respectively. Furthermore, we consider the finite size effect where the stochastic fluctuation should be involved. To the end, we derive the Langevin equation and obtain the potential of the corresponding Fokker-Planck equation. This allows us to calculate the effective critical noise $f_c(N)$ at which the susceptibility is maximal in finite size networks. We find that the $f_c-f_c(N)$ decays with $N$ in a power-law way and vanishes for $Nrightarrow infty$. All the theoretical results are confirmed by performing the extensive Monte Carlo simulations in random $k$-regular networks, Erdos-Renyi random networks and scale-free networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
