SearcharxivSearch

arXiv subjects

Renquan Zhang

Publications and source records attributed to Renquan Zhang.

12 recordsLinked to original sources

Personalized Bayesian Federated Learning with Wasserstein Barycenter Aggregation

Personalized Bayesian federated learning (PBFL) handles non-i.i.d. client data and quantifies uncertainty by combining personalization with Bayesian inference. However, existing PBFL methods face two limitations: restrictive parametric assumptions in client posterior inference and naive parameter averaging for server aggregation. To overcome these issues, we propose FedWBA, a novel PBFL method that enhances both local inference and global aggregation. At the client level, we use particle-based variational inference for nonparametric posterior representation. At the server level, we introduce particle-based Wasserstein barycenter aggregation, offering a more geometrically meaningful approach. Theoretically, we provide local and global convergence guarantees for FedWBA. Locally, we prove a KL divergence decrease lower bound per iteration for variational inference convergence. Globally, we show that the Wasserstein barycenter converges to the true parameter as the client data size increases. Empirically, experiments show that FedWBA outperforms baselines in prediction accuracy, uncertainty calibration, and convergence rate, with ablation studies confirming its robustness.

cs.LG

Influence Maximization in Hypergraphs Using A Genetic Algorithm with New Initialization and Evaluation Methods

Influence maximization (IM) is a crucial optimization task related to analyzing complex networks in the real world, such as social networks, disease propagation networks, and marketing networks. Publications to date about the IM problem focus mainly on graphs, which fail to capture high-order interaction relationships from the real world. Therefore, the use of hypergraphs for addressing the IM problem has been receiving increasing attention. However, identifying the most influential nodes in hypergraphs remains challenging, mainly because nodes and hyperedges are often strongly coupled and correlated. In this paper, to effectively identify the most influential nodes, we first propose a novel hypergraph-independent cascade model that integrates the influences of both node and hyperedge failures. Afterward, we introduce genetic algorithms (GA) to identify the most influential nodes that leverage hypergraph collective influences. In the GA-based method, the hypergraph collective influence is effectively used to initialize the population, thereby enhancing the quality of initial candidate solutions. The designed fitness function considers the joint influences of both nodes and hyperedges. This ensures the optimal set of nodes with the best influence on both nodes and hyperedges to be evaluated accurately. Moreover, a new mutation operator is designed by introducing factors, i.e., the collective influence and overlapping effects of nodes in hypergraphs, to breed high-quality offspring. In the experiments, several simulations on both synthetic and real hypergraphs have been conducted, and the results demonstrate that the proposed method outperforms the compared methods.

cs.SI

Influence Maximization based on Threshold Model in Hypergraphs

Influence Maximization problem has received significant attention in recent years due to its application in various do?mains such as product recommendation, public opinion dissemination, and disease propagation. This paper proposes a theoretical analysis framework for collective influence in hypergraphs, focusing on identifying a set of seeds that maximize influence in threshold models. Firstly, we extend the Message Passing method from pairwise networks to hypergraphs to accurately describe the activation process in threshold models. Then we introduce the concept of hyper?graph collective influence (HCI) to measure the influence of nodes. Subsequently, We design an algorithm, HCI-TM, to select the Influence Maximization Set, taking into account both node and hyperedge activation. Numerical simu?lations demonstrate that HCI-TM outperforms several competing algorithms in synthetic and real-world hypergraphs. Furthermore, we find that HCI can be used as a tool to predict the occurrence of cascading phenomena. Notably, we find that HCI-TM algorithm works better for larger average hyperdegrees in Erdos-Rényi (ER) hypergraphs and smaller power-law exponents in scale-free (SF) hypergraphs.

cs.SI

Influence Maximization based on Simplicial Contagion Models in Hypergraphs

In recent years, the exploration of node centrality has received significant attention and extensive investigation, primarily fuelled by its applications in diverse domains such as product recommendations, opinion propagation, disease spread, and other scenarios requiring the maximization of node influence. Despite various perspectives emphasizing the indispensability of higher-order networks, research specifically delving into node centrality within the realm of hypergraphs has been relatively constrained. This paper focuses on the problem of influence maximization on the Simplicial Contagion Model (SCM), using the susceptible-infected-recovered (SIR) model as an example. To find practical solutions to this optimization problem, we have developed a theoretical framework based on message passing process and conducted stability analysis of equilibrium solutions for the self-consistent equations. Furthermore, we introduce a metric called collective influence and propose an adaptive algorithm, known as the Collective Influence Adaptive (CIA), to identify influential propagators in the spreading process. Notably, our algorithm distinguishes itself by prioritizing collective influence over individual influence, resulting in demonstrably superior performance, a characteristic substantiated by a comprehensive array of experiments.

cs.SI

Evaluating the impact of quarantine measures on COVID-19 spread

During the early stage of the COVID-19 pandemic, many countries implemented non-pharmaceutical interventions (NPIs) to control the transmission of SARS-CoV-2, the causative pathogen of COVID-19. Among those NPIs, quarantine measures were widely adopted and enforced through stay-at-home and shelter-in-place orders. Understanding the effectiveness of quarantine measures can inform decision-making and control planning during the ongoing COVID-19 pandemic and for future disease outbreaks. In this study, we use mathematical models to evaluate the impact of quarantine measures on COVID-19 spread in four cities that experienced large-scale outbreaks in the spring of 2020: Wuhan, New York, Milan, and London. We develop a susceptible-exposed-infected-removed (SEIR)-type model with a component of quarantine and couple this disease transmission model with a data assimilation method. By calibrating the model to case data, we estimate key epidemiological parameters before lockdown in each city. We further examine the impact of quarantine rates on COVID-19 spread after lockdown using model simulations. Results indicate that quarantine of susceptible and exposed individuals and undetected infections is necessary to contain the outbreak; however, the quarantine rates for these populations can be reduced through faster isolation of confirmed cases. We generate counterfactual simulations to estimate effectiveness of quarantine measures. Without quarantine measures, the cumulative confirmed cases could be 73, 22, 43 and 93 times higher than reported numbers within 40 days after lockdown in Wuhan, New York, Milan, and London. Our findings underscore the essential role of quarantine during the early phase of the pandemic.

q-bio.PE

Targeted influence maximization in complex networks

Many real-world applications based on spreading processes in complex networks aim to deliver information to specific target nodes. However, it remains challenging to optimally select a set of spreaders to initiate the spreading process. In this paper, we study the targeted influence maximization problem using a susceptible-infected-recovered (SIR) model as an example. Formulated as a combinatorial optimization, the objective is to identify a given number of spreaders that can maximize the influence over target nodes while minimize the influence over non-target nodes. To find a practical solution to this optimization problem, we develop a theoretical framework based on a message passing process and perform a stability analysis on the equilibrium solution using non-backtracking (NB) matrices. We propose that the spreaders can be selected by imposing optimal perturbation on the equilibrium solution for the subgraph consisting of the target nodes and their multi-step nearest neighbors while avoiding such perturbation on the complement graph that excludes target nodes from the original network. We further introduce a metric, termed targeted collective influence, for each node to identify influential spreaders for targeted spreading processes. The proposed method, validated in both synthetic and real-world networks, outperforms other competing heuristic approaches. Our results provide a framework for analyzing the targeted influence maximization problem and a practical method to identify spreaders in real-world applications.

nlin.AO

Backtracking activation impacts the criticality of excitable networks

Networks of excitable elements are widely used to model real-world biological and social systems. The dynamic range of an excitable network quantifies the range of stimulus intensities that can be robustly distinguished by the network response, and is maximized at the critical state. In this study, we examine the impacts of backtracking activation on system criticality in excitable networks consisting of both excitatory and inhibitory units. We find that, for dynamics with refractory states that prohibit backtracking activation, the critical state occurs when the largest eigenvalue of the weighted non-backtracking (WNB) matrix for excitatory units, $λ^E_{NB}$, is close to one, regardless of the strength of inhibition. In contrast, for dynamics without refractory state in which backtracking activation is allowed, the strength of inhibition affects the critical condition through suppression of backtracking activation. As inhibitory strength increases, backtracking activation is gradually suppressed. Accordingly, the system shifts continuously along a continuum between two extreme regimes -- from one where the criticality is determined by the largest eigenvalue of the weighted adjacency matrix for excitatory units, $λ^E_W$, to the other where the critical state is reached when $λ_{NB}^E$ is close to one. For systems in between, we find that $λ^E_{NB}<1$ and $λ^E_W>1$ at the critical state. These findings, confirmed by numerical simulations using both random and synthetic neural networks, indicate that backtracking activation impacts the criticality of excitable networks.

nlin.AO

Dynamic range maximization in excitable networks

We study the strategy to optimally maximize the dynamic range of excitable networks by removing the minimal number of links. A network of excitable elements can distinguish a broad range of stimulus intensities and has its dynamic range maximized at criticality. In this study, we formulate the activation propagation in excitable networks as a message passing process in which the critical state is reached when the largest eigenvalue of the weighted non-backtracking (WNB) matrix is exactly one. By considering the impact of single link removal on the largest eigenvalue, we develop an efficient algorithm that aims to identify the optimal set of links whose removal will drive the system to the critical state. Comparisons with other competing heuristics on both synthetic and real-world networks indicate that the proposed method can maximize the dynamic range by removing the smallest number of links, and at the same time maintain the largest size of the giant connected component.

nlin.AO

Organization mechanism and counting algorithm on Vertex-Cover solutions

Counting the solution number of combinational optimization problems is an important topic in the study of computational complexity, especially on the #P-complete complexity class. In this paper, we first investigate some organizations of Vertex-Cover unfrozen subgraphs by the underlying connectivity and connected components of unfrozen vertices. Then, a Vertex-Cover Solution Number Counting Algorithm is proposed and its complexity analysis is provided, the results of which fit very well with the simulations and have better performance than those by 1-RSB in a neighborhood of c = e for random graphs. Base on the algorithm, variation and fluctuation on the solution number statistics are studied to reveal the evolution mechanism of the solution numbers. Besides, marginal probability distributions on the solution space are investigated on both random graph and scale-free graph to illustrate different evolution characteristics of their solution spaces. Thus, doing solution number counting based on graph expression of solution space should be an alternative and meaningful way to study the hardness of NP-complete and #P-complete problems, and appropriate algorithm design can help to achieve better approximations of solving combinational optimization problems and the corresponding counting problems.

cs.CC

Evolution of autocatalytic sets in a competitive percolation model

The evolution of autocatalytic sets (ACS) is a widespread process in biological, chemical and ecological systems which is of great significance in many applications, such as the evolution of new species or complex chemical organizations. In this paper, we propose a competitive model with a m-selection rule in which an abrupt emergence of a macroscopic independent ACS is observed. By numerical simulations, we find that the maximal increase of the size grows linearly with the system size. We analytically derive the threshold tα where the abrupt jump happens and verify it by simulations. Moreover, our analysis explains how this giant independent ACS grows and reveals that, as the selection rule becomes more strict, the phase transition is dramatically postponed, and the number of the largest independent ACSs coexisting in the system increases accordingly. Our research work deepens the understanding of the evolution of ACS and should provide useful information for designing strategies to control the emergence of ACS in corresponding applications.

q-bio.MN

Analysis on the evolution process of BFW-like model with explosive percolation of multiple giant components

Recently, the modified BFW model on random graph [Phys. Rev. Lett., 106, 115701 (2011)], which shows a strongly discontinuous percolation transition with multiple giant components, has attracted much attention from physicists, statisticians and materials scientists. In this paper, by establishing the theoretical expression of evolution equations on the modified BFW model, the steady-state and evolution process are analyzed and a close correspondence is built between the values of parameter αand the number of giant components in steady-states, which fits very well with the numerical simulations. In fact, with the value of αdecreasing to 0.25, the error between theoretical and numerical results is smaller than 4% and trends to 0 rapidly. Furthermore, the sizes of giant components for different evolution strategies can also be obtained by solving some constraints derived from the evolution equations. The analysis of the steady-state and evolution process is of great help to explain why the percolation of modified BFW model is explosive and how explosive it is.

math-ph

Determining the Solution Space of Vertex-Cover by Interactions and Backbones

To solve the combinatorial optimization problems especially the minimal Vertex-cover problem with high efficiency, is a significant task in theoretical computer science and many other subjects. Aiming at detecting the solution space of Vertex-cover, a new structure named interaction between nodes is defined and discovered for random graph, which results in the emergence of the frustration and long-range correlation phenomenon. Based on the backbones and interactions with a node adding process, we propose an Interaction and Backbone Evolution Algorithm to achieve the reduced solution graph, which has a direct correspondence to the solution space of Vertex-cover. By this algorithm, the whole solution space can be obtained strictly when there is no leaf-removal core on the graph and the odd cycles of unfrozen nodes bring great obstacles to its efficiency. Besides, this algorithm possesses favorable exactness and has good performance on random instances even with high average degrees. The interaction with the algorithm provides a new viewpoint to solve Vertex-cover, which will have a wide range of applications to different types of graphs, better usage of which can lower the computational complexity for solving Vertex-cover.

math-ph