arXiv subjects

Xiaoqun Wu

Publications and source records attributed to Xiaoqun Wu.

At least 19 recordsLinked to original sources

arXiv2026

Structural Inference under Hidden Agents

Recovering latent interaction structures from multi-agent dynamics is important for understanding and predicting interacting systems. Trajectory-based structural inference has achieved promising performance, but conventional formulations assume that the trajectories of all modeled agents are available. In practice, agents may become unobserved at deployment because of limited sensing, occlusion, or communication failure. Existing studies have considered unseen-node estimation, structural inference under partial observations, and missing-value imputation, yet the joint recovery of hidden-agent trajectories and their interactions remains underexplored. We formulate this problem as structural inference under hidden agents. Its key difficulty is a circular dependency: recovering interactions involving a hidden agent requires an estimate of its trajectory, while trajectory reconstruction can itself benefit from structural information. To address this challenge, we propose Structural Inference under Hidden Agents (SIHA), which combines structure-agnostic initialization with structure-guided iterative refinement. SIHA reconstructs hidden trajectories from visible observations, infers interactions using Neural Relational Inference, and feeds the estimated structure back into hidden-state reconstruction through multi-strength structural attention and iterative state--structure updates. Experiments on three benchmark dynamical systems demonstrate consistent improvements in visible-to-visible structural inference, while also showing benefits in hidden-state reconstruction and future prediction. Motion-capture experiments with simulated whole-limb occlusion further demonstrate its effectiveness in realistic hidden-agent settings.

cs.LG↗

arXiv2026

Grounded Laplacians of Directed Signed Matrix-Weighted Networks: Spectral Properties and Applications to Non-Trivial Consensus

Grounded Laplacians provide the spectral link between external information and network convergence. This paper establishes positive-stability results for grounded Laplacians in directed signed matrix-weighted networks, where directionality, antagonism, and singular edge weight matrices coexist. First, under in-degree dominance and positive-negative reachability, we derive explicit local thresholds for the grounding gains. Second, a scaled, kernel-based certificate replaces the unscaled degree condition with a signed matrix-weighted Dirichlet decomposition and a joint-kernel test for the scaled symmetric part. The computable margin $γ_p$ lower-bounds the minimum real part of the spectrum and certifies exponential contraction in the $P$-norm. Under absolute generalized balance, the kernel-intersection test is given; the balanced and definite-edge unbalanced undirected cases follow. As an application, non-trivial consensus (NTC) on signed matrix-weighted networks is studied. Informed agents, external signals and coupling terms are designed to steer all agents to any prescribed nonzero state without requiring structural balance. Switching topology case retains non-trivial consensus result under certain conditions. Realizing NTC on signed matrix-weighted networks demonstrates that groups with both cooperative and antagonistic multi-dimensional interactions can achieve consensus, which was previously deemed exclusive to fully cooperative groups.

eess.SY↗

arXiv2026

Quantifying opinion homophily in online social networks: A bounded confidence perspective

The concept of homophily is pervasive in online social media. While many empirical studies have relied on external sociodemographic traits to investigate it, significantly less is known about homophily at the cognitive level, that is, at the level of shared opinions or values. For such "value homophily", in this paper we study interval-based patterns of opinion homophily from a bounded confidence perspective. We consider three heterogeneous datasets from Reddit and Twitter covering polarizing issues, with user opinions quantified via sentiment analysis and fact-checking, and analyze the interaction networks formed by weaker (reply-based) and stronger (follow-based) social ties. Our findings show that users' interaction neighborhoods are significantly more concentrated in opinion space than expected by chance, with tie strength and issue polarization further amplifying this effect. Moreover, users often exhibit asymmetric tolerance ranges, with asymmetry typically directed toward locally mainstream positions rather than more radical or opposing ones. These findings support a bounded confidence interpretation of online value homophily.

cs.SI↗

arXiv2026

Signed DeGroot-Friedkin Dynamics with Interdependent Topics

This paper investigates DeGroot-Friedkin (DF) dynamics over signed influence networks with interdependent topics. We propose a multi-topic signed framework that combines repelling interpersonal interactions with cross-issue self-appraisal, examining how antagonism and topic interdependence shape the evolution of agent-level social power. When the logic matrices (for topic interdependence) of all agents share a common dominant left eigenvector, we identify structural conditions under which the original dynamics admit an exact reduction to an explicit scalar DF map. This yields a complete classification of limiting social power configurations into pluralistic, mixed, and vertex-dominant types. In all three cases, the dynamics are globally convergent, and in the first two the ordering induced by the interaction centrality is preserved. We further show local robustness under small heterogeneous perturbations of the logic matrices. We also clarify what changes when this common-eigenvector structure is lost. These results extend signed social power dynamics beyond the standard nonnegative scalar setting and shed light on the robustness and scope of centrality-based social power formation in multi-topic signed influence systems.

physics.soc-ph↗

arXiv2026

Fostering Sustainable Cooperation through Strategic Resource Allocation and Utilization on Social Networks

Efficient allocation and use of limited resources are fundamental to advancing collective welfare and achieving long-term societal sustainability. This challenge involves not only how policymakers distribute scarce resources among individuals, but also how individuals strategically utilize them. The complexity deepens when individuals are embedded in networks of social interactions, where outcomes are interdependent and future decisions are shaped by a dynamic tension between cooperation driven by collective long-term benefit and self-interest motivated by short-term personal gain. Here, we introduce a novel framework of generalized public goods games on hypergraphs to capture the multifaceted nature of real-world social interactions. Using Nash equilibrium analysis, we reveal how full cooperation (all individuals contribute all their resources to maximize collective benefit) emerges from the interplay between resource allocation strategies, individual usage behaviors, and the structure of interactions. We find that equal resource distribution enhances cooperation in homogeneous networks but may suppress it in heterogeneous ones, indicating that equity in allocation does not universally lead to optimal collective outcomes. To address this, we propose two complementary optimization strategies: one to guide policymakers in designing effective resource allocation schemes, and the other to support individuals in making sustainable use decisions. We validate the effectiveness of both approaches across a range of synthetic and empirical cases. Our findings provide actionable insights for designing governance frameworks and resource management policies that promote sustainable cooperation in complex socio-environmental systems.

cs.GT↗

arXiv2026

Non-trivial consensus on directed signed matrix-weighted networks with compound measurement noises and time-varying topologies

This paper studies non-trivial consensus--a relatively novel and unexplored convergence behavior--on directed signed matrix-weighted networks subject to both additive and multiplicative measurement noises under time-varying topologies. Building upon grounded matrix-weighted Laplacian properties, a stochastic dynamic model is established that simultaneously captures inter-dimensional cooperative and antagonistic interactions, compound measurement noises and time-varying network structures. Based on stochastic differential equations theory, protocols that guarantee mean square and almost sure non-trivial consensus are proposed. Specifically, for any predetermined non-trivial consensus state, all agents are proven to converge toward this non-zero value in the mean-square and almost-sure senses. The design of control gain function in our protocols highlights a balanced consideration of the cumulative effect over time, the asymptotic decay property and the finite energy corresponding to measurement noises. Notably, the conditions on time-varying topologies in our protocols only require boundedness of elements in edge weight matrices, which facilitate the practicality of concept "time-varying topology" in matrix-weighted network consensus algorithms. Furthermore, the proposed protocols operate under milder connectivity conditions and no requirements on structural (un)balance properties. The work in this paper demonstrates that groups with both cooperative and antagonistic inter-dimensional interactions can achieve consensus even in the presence of compound measurement noises and time-varying topologies, challenging the conventional belief that consensus is attainable only in fully cooperative settings.

eess.SY↗

arXiv2025

Understanding and Enhancing the Planning Capability of Language Models via Multi-Token Prediction

Large Language Models (LLMs) have achieved impressive performance across diverse tasks but continue to struggle with learning transitive relations, a cornerstone for complex planning. To address this issue, we investigate the Multi-Token Prediction (MTP) paradigm and its impact to transitive relation learning. We theoretically analyze the MTP paradigm using a Transformer architecture composed of a shared output head and a transfer layer. Our analysis reveals that the transfer layer gradually learns the multi-step adjacency information, which in turn enables the backbone model to capture unobserved transitive reachability relations beyond those directly present in the training data, albeit with some inevitable noise in adjacency estimation. Building on this foundation, we propose two strategies to enhance the transfer layer and overall learning quality: Next-Token Injection (NTI) and a Transformer-based transfer layer. Our experiments on both synthetic graphs and the Blocksworld planning benchmark validate our theoretical findings and demonstrate that the improvements significantly enhance the model's path-planning capability. These findings deepen our understanding of how Transformers with MTP learn in complex planning tasks, and provide practical strategies to overcome the transitivity bottleneck, paving the way toward structurally aware and general-purpose planning models.

cs.AI↗

arXiv2025

PINN-MG: A physics-informed neural network for mesh generation

In numerical simulation, structured mesh generation often requires a lot of time and manpower investment. The general scheme for structured quad mesh generation is to find a mapping between the computational domain and the physical domain. This mapping can be obtained by solving partial differential equations. However, existing structured mesh generation methods are difficult to ensure both efficiency and mesh quality. In this paper, we propose a structured mesh generation method based on physics-informed neural network, PINN-MG. It takes boundary curves as input and then utilizes an attention network to capture the potential mapping between computational and physical domains, generating structured meshes for the input physical domain. PINN-MG introduces the Navier-Lamé equation in linear elastic as a partial differential equation term in the loss function, ensuring that the neural network conforms to the law of elastic body deformation when optimizing the loss value. The training process of PINN-MG is completely unsupervised and does not require any prior knowledge or datasets, which greatly reduces the previous workload of producing structured mesh datasets. Experimental results show that PINN-MG can generate higher quality structured quad meshes than other methods, and has the advantages of traditional algebraic methods and differential methods.

cs.CE↗

arXiv2024

Exploring Loss Landscapes through the Lens of Spin Glass Theory

In the past decade, significant strides in deep learning have led to numerous groundbreaking applications. Despite these advancements, the understanding of the high generalizability of deep learning, especially in such an over-parametrized space, remains limited. For instance, in deep neural networks (DNNs), their internal representations, decision-making mechanism, absence of overfitting in an over-parametrized space, superior generalizability, etc., remain less understood. Successful applications are often considered as empirical rather than scientific achievement. This paper delves into the loss landscape of DNNs through the lens of spin glass in statistical physics, a system characterized by a complex energy landscape with numerous metastable states, as a novel perspective in understanding how DNNs work. We investigated the loss landscape of single hidden layer neural networks activated by Rectified Linear Unit (ReLU) function, and introduced several protocols to examine the analogy between DNNs and spin glass. Specifically, we used (1) random walk in the parameter space of DNNs to unravel the structures in their loss landscape; (2) a permutation-interpolation protocol to study the connection between copies of identical regions in the loss landscape due to the permutation symmetry in the hidden layers; (3) hierarchical clustering to reveal the hierarchy among trained solutions of DNNs, reminiscent of the so-called Replica Symmetry Breaking (RSB) phenomenon (i.e. the Parisi solution) in spin glass; (4) finally, we examine the relationship between the ruggedness of DNN's loss landscape and its generalizability, showing an improvement of flattened minima.

cond-mat.dis-nn↗

arXiv2022

Adaptive Fuzzy Tracking Control with Global Prescribed-Time Prescribed Performance for Uncertain Strict-Feedback Nonlinear Systems

Adaptive fuzzy control strategies are established to achieve global prescribed performance with prescribed-time convergence for strict-feedback systems with mismatched uncertainties and unknown nonlinearities. Firstly, to quantify the transient and steady performance constraints of the tracking error, a class of prescribed-time prescribed performance functions are designed, and a novel error transformation function is introduced to remove the initial value constraints and solve the singularity problem in existing works. Secondly, based on dynamic surface control methods, controllers with or without approximating structures are established to guarantee that the tracking error achieves prescribed transient performance and converges into a prescribed bounded set within prescribed time. In particular, the settling time and initial value of the prescribed performance function are completely independent of initial conditions of the tracking error and system parameters, which improves existing results. Moreover, with a novel Lyapunov-like energy function, not only the differential explosion problem frequently occurring in backstepping techniques is solved, but the drawback of the semi-global boundedness of tracking error induced by dynamic surface control can be overcome. The validity and effectiveness of the main results are verified by numerical simulations on practical examples.

eess.SY↗

arXiv2021

A Distributed Parallel Optimization Algorithm via Alternating Direction Method of Multipliers

Alternating Direction Method of Multipliers (ADMM) algorithm has been widely adopted for solving the distributed optimization problem (DOP). In this paper, a new distributed parallel ADMM algorithm is proposed, which allows the agents to update their local states and dual variables in a completely distributed and parallel manner by modifying the existing distributed sequential ADMM. Moreover, the updating rules and storage method for variables are illustrated. It is shown that all the agents can reach a consensus by asymptotically converging to the optimal solution. Besides, the global cost function will converge to the optimal value at a rate of O(1/k). Simulation results on a numerical example are given to show the effectiveness of the proposed algorithm.

math.OC↗

arXiv2021

Stabilization of continuous-time Markov/semi-Markov jump linear systems via finite data-rate feedback

This paper investigates almost sure exponential stabilization of continuous-time Markov jump linear systems (MJLSs) under communication data-rate constraints by introducing sampling and quantization into the feedback control. Different from previous works, the sampling times and the jump times are independent of each other in this paper. The quantization is recursively adjusted on the sampling time, and its updating strategy does not depend on the switching in a sampling interval. In other words, the explicit value of the switching signal in a sampling interval is not necessary. The numerically testable condition is developed to ensure almost sure exponential stabilization of MJLSs under the proposed communication and control protocols. We also drop the assumption of stabilizability of all individual modes required in previous works about the switched systems. Moreover, we extend the result to the case of continuous-time semi-Markov jump linear systems (semi-MJLSs) via the semi-Markov kernel approach. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed communication and control protocols.

math.DS↗

arXiv2018

Adaptive Diffusion Processes of Time-Varying Local Information on Networks

This paper mainly discusses the diffusion on complex networks with time-varying couplings. We propose a model to describe the adaptive diffusion process of local topological and dynamical information, and find that the Barabasi-Albert scale-free network (BA network) is beneficial to the diffusion and leads nodes to arrive at a larger state value than other networks do. The ability of diffusion for a node is related to its own degree. Specifically, nodes with smaller degrees are more likely to change their states and reach larger values, while those with larger degrees tend to stick to their original states. We introduce state entropy to analyze the thermodynamic mechanism of the diffusion process, and interestingly find that this kind of diffusion process is a minimization process of state entropy. We use the inequality constrained optimization method to reveal the restriction function of the minimization and find that it has the same form as the Gibbs free energy. The thermodynamical concept allows us to understand dynamical processes on complex networks from a brand-new perspective. The result provides a convenient means of optimizing relevant dynamical processes on practical circuits as well as related complex systems.

physics.soc-ph↗

arXiv2017

Master stability functions for complete, intra-layer and inter-layer synchronization in multiplex networks

Synchronization phenomena are of broad interest across disciplines and increasingly of interest in a multiplex network setting. Here we show how the Master Stability Function, a celebrated framework for analyzing synchronization on a single network, can be extended to certain classes of multiplex networks with different intra-layer and inter-layer coupling functions. We derive three master stability equations that determine respectively the necessary regions of complete synchronization, intra-layer synchronization and inter-layer synchronization. We calculate these three regions explicitly for the case of a two-layer network of R{ö}ssler oscillators and show that the overlap of the regions determines the type of synchronization achieved. In particular, if the inter- or intra-layer coupling function is such that the inter-layer or intra-layer synchronization region is empty, complete synchronization cannot be achieved regardless of the coupling strength. Furthermore, for any given nodal dynamics and network structure, the occurrence of intra-layer and inter-layer synchronization depend mainly on the coupling functions of nodes within a layer and across layers, respectively. Our mathematical analysis requires that the intra- and inter-layer supra-Laplacians commute. But we show this is only a sufficient, and not necessary, condition and that the results can be applied more generally.

nlin.CD↗

arXiv2017

Phase Synchronization on Spacially Embeded Duplex Networks with Total Cost Constraint

Synchronization on multiplex networks have attracted increasing attention in the past few years. We investigate collective behaviors of Kuramoto oscillators on single layer and duplex spacial networks with total cost restriction, which was introduced by Li et. al [Li G., Reis S. D., Moreira A. A., Havlin S., Stanley H. E. and Jr A. J., {\it Phys. Rev. Lett.} 104, 018701 (2010)] and termed as the Li network afterwards. In the Li network model, with the increase of its spacial exponent, the network's structure will vary from the random type to the small-world one, and finally to the regular lattice.We first explore how the spacial exponent influences the synchronizability of Kuramoto oscillators on single layer Li networks and find that the closer the Li network is to a regular lattice, the more difficult for it to evolve into synchronization. Then we investigate synchronizability of duplex Li networks and find that the existence of inter-layer interaction can greatly enhance inter-layer and global synchronizability. When the inter-layer coupling strength is larger than a certain critical value, whatever the intra-layer coupling strength is, the inter-layer synchronization will always occur. Furthermore, on single layer Li networks, nodes with larger degrees more easily reach global synchronization, while on duplex Li networks, this phenomenon becomes much less obvious. Finally, we study the impact of inter-link density on global synchronization and obtain that sparse inter-links can lead to the emergence of global synchronization for duplex Li networks just as dense inter-links do. In a word, inter-layer interaction plays a vital role in determining synchronizability for duplex spacial networks with total cost constraint.

nlin.CD↗

arXiv2017

Cooperative epidemic spreading on a two-layered interconnected network

This study is concerned with the dynamical behaviors of epidemic spreading over a two-layered interconnected network. Three models in different levels are proposed to describe cooperative spreading processes over the interconnected network, wherein the disease in one network can spread to the other. Theoretical analysis is provided for each model to reveal that the global epidemic threshold in the interconnected network is not larger than the epidemic thresholds for the two isolated layered networks. In particular, in an interconnected homogenous network, detailed theoretical analysis is presented, which allows quick and accurate calculations of the global epidemic threshold. Moreover, in an interconnected heterogeneous network with inter-layer correlation between node degrees, it is found that the inter-layer correlation coefficient has little impact on the epidemic threshold, but has significant impact on the total prevalence. Simulations further verify the analytical results, showing that cooperative epidemic processes promote the spreading of diseases.

physics.soc-ph↗

arXiv2016

Inferring topologies via driving-based generalized synchronization of two-layer networks

The interaction topology among the constituents of a complex network plays a crucial role in the network's evolutionary mechanisms and functional behaviors. However, some network topologies are usually unknown or uncertain. Meanwhile, coupling delay are ubiquitous in various man-made and natural networks. Hence, it is necessary to gain knowledge of the whole or partial topology of a complex dynamical network by taking into consideration communication delay. In this paper, topology identification of complex dynamical networks is investigated via generalized synchronization of a two-layer network. Particularly, based on the LaSalle-type invariance principle of stochastic differential delay equations, an adaptive control technique is proposed by constructing an auxiliary layer and designing proper control input and updating laws so that the unknown topology can be recovered upon successful generalized synchronization. Numerical simulations are provided to illustrate the effectiveness of the proposed method. The technique provides a certain theoretical basis for topology inference of complex networks. In particular, when the considered network is composed of systems with high-dimension or complicated dynamics, a simpler response layer can be constructed, which is conducive to circuit design. Moreover, it is practical to take into consideration perturbations caused by control input. Finally, the method is applicable to infer topology of a subnetwork embedded within a complex system and locate hidden sources. We hope the results can provide basic insight into further research endeavors on understanding practical and economical topology inference of networks.

nlin.CD↗

arXiv2015

Counterpart synchronization of duplex networks with delayed nodes and noise perturbation

In the real world, many complex systems are represented not by single networks but rather by sets of interdependent ones. In these specific networks, nodes in one network mutually interact with nodes in other networks. This paper focuses on a simple representative case of two-layer networks (the so-called duplex networks) with unidirectional inter-layer couplings. That is, each node in one network depends on a counterpart in the other network. Accordingly, the former network is called the response layer and the latter network is the drive layer. Specifically, synchronization between each node in the drive layer and its counterpart in the response layer (counterpart synchronization, or CS) of this sort of duplex networks with delayed nodes and noise perturbation is investigated. Based on the LaSalle-type invariance principle, a control technique is proposed and a sufficient condition is developed for realizing counterpart synchronization of duplex networks. Furthermore, two corollaries are derived as special cases. In addition, node dynamics within each layer can be various and topologies of the two layers are not necessarily identical. Therefore, the proposed synchronization method can be applied to a wide range of multiplex networks. Numerical examples are provided to illustrate the feasibility and effectiveness of the results.

nlin.CD↗