arXiv subjects

Xiangrong Wang

Publications and source records attributed to Xiangrong Wang.

33 records · Page 2Linked to original sources

arXiv2021

Sparse Array Transceiver Design for Enhanced Adaptive Beamforming in MIMO Radar

Sparse array design aided by emerging fast sensor switching technologies can lower the overall system overhead by reducing the number of expensive transceiver chains. In this paper, we examine the active sparse array design enabling the maximum signal to interference plus noise ratio (MaxSINR) beamforming at the MIMO radar receiver. The proposed approach entails an entwined design, i.e., jointly selecting the optimum transmit and receive sensor locations for accomplishing MaxSINR receive beamforming. Specifically, we consider a co-located multiple-input multiple-output (MIMO) radar platform with orthogonal transmitted waveforms, and examine antenna selections at the transmit and receive arrays. The optimum active sparse array transceiver design problem is formulated as successive convex approximation (SCA) alongside the two-dimensional group sparsity promoting regularization. Several examples are provided to demonstrate the effectiveness of the proposed approach in utilizing the given transmit/receive array aperture and degrees of freedom for achieving MaxSINR beamforming.

eess.SP↗

arXiv2021

Interspecific competition shapes the structural stability of mutualistic networks

Mutualistic networks have attracted increasing attention in the ecological literature in the last decades as they play a key role in the maintenance of biodiversity. Here, we develop an analytical framework to study the structural stability of these networks including both mutualistic and competitive interactions. Analytical and numerical analyses show that the structure of the competitive network fundamentally alters the necessary conditions for species coexistence in communities. Using 50 real mutualistic networks, we show that when the relative importance of shared partners is incorporated via weighted competition, the feasibility area in the parameter space is highly correlated with May's stability criteria and can be predicted by a functional relationship between the number of species, the network connectance and the average interaction strength in the community. Our work reopens a decade-long debate about the complexity-stability relationship in ecological communities, and highlights the role of the relative structures of different interaction types.

physics.soc-ph↗

arXiv2020

Induced Percolation on Networked Systems

Percolation theory has been widely used to study phase transitions in complex networked systems. It has also successfully explained several macroscopic phenomena across different fields. Yet, the existent theoretical framework for percolation places the focus on the direct interactions among the system's components, while recent empirical observations have shown that indirect interactions are common in many systems like ecological and social networks, among others. Here, we propose a new percolation framework that accounts for indirect interactions, which allows to generalize the current theoretical body and understand the role of the underlying indirect influence of the components of a networked system on its macroscopic behavior. We report a rich phenomenology in which first-order, second-order or hybrid phase transitions are possible depending on whether the links of the substrate network are directed, undirected or a mix, respectively. We also present an analytical framework to characterize the proposed induced percolation, paving the way to further understand network dynamics with indirect interactions.

physics.soc-ph↗

arXiv2020

Unique superdiffusion induced by directionality in multiplex networks

The multilayer network framework has served to describe and uncover a number of novel and unforeseen physical behaviors and regimes in interacting complex systems. However, the majority of existing studies are built on undirected multilayer networks while most complex systems in nature exhibit directed interactions. Here, we propose a framework to analyze diffusive dynamics on multilayer networks consisting of at least one directed layer. We rigorously demonstrate that directionality in multilayer networks can fundamentally change the behavior of diffusive dynamics: from monotonic (in undirected systems) to non-monotonic diffusion with respect to the interlayer coupling strength. Moreover, for certain multilayer network configurations, the directionality can induce a unique superdiffusion regime for intermediate values of the interlayer coupling, wherein the diffusion is even faster than that corresponding to the theoretical limit for undirected systems, i.e., the diffusion in the integrated network obtained from the aggregation of each layer. We theoretically and numerically show that the existence of superdiffusion is fully determined by the directionality of each layer and the topological overlap between layers. We further provide a formulation of multilayer networks displaying superdiffusion. Our results highlight the significance of incorporating the interacting directionality in multilevel networked systems and provide a framework to analyze dynamical processes on interconnected complex systems with directionality.

physics.soc-ph↗

arXiv2020

Efficient algorithm based on non-backtracking matrix for community detection in signed networks

Community detection or clustering is a crucial task for understanding the structure of complex systems. In some networks, nodes are permitted to be linked by either "positive" or "negative" edges; such networks are called signed networks. Discovering communities in signed networks is more challenging than that in unsigned networks. In this study, we innovatively develop a non-backtracking matrix of signed networks, theoretically derive a detectability threshold for this matrix, and demonstrate the feasibility of using the matrix for community detection. We further improve the developed matrix by considering the balanced paths in the network (referred to as a balanced non-backtracking matrix). Simulation results demonstrate that the algorithm based on the balanced nonbacktracking matrix significantly outperforms those based on the adjacency matrix and the signed non-backtracking matrix. The proposed (improved) matrix shows great potential for detecting communities with or without overlap.

physics.soc-ph↗

arXiv2020

Backward magnetostatic surface spin waves in exchange coupled Co/FeNi bilayers

Propagation of backward magnetostatic surface spin waves (SWs) in exchange coupled Co/FeNi bilayers are studied by using Brillouin light scattering (BLS) technique. Two types of SWs modes were identified in our BLS measurements. They are magnetostatic surface waves (MSSWs) mode and perpendicular standing spin waves (PSSWs) mode. The dispersion relations of MSSWs obtained from the Stokes and Anti-Stokes measurements display respectively positive and negative group velocities. The Anti-Stokes branch with positive phase velocities and negative group velocities, known as backward magnetostatic surface mode originates from the magnetostatic interaction of the bilayer. The experimental data are in good agreement with the theoretical calculations. Our results are useful for understanding the SWs propagation and miniaturizing SWs storage devices.

cond-mat.mes-hall↗

arXiv2019

Switch-based Hybrid Beamforming for Massive MIMO Communications in mmWave Bands

Switch-based hybrid network is a promising implementation for beamforming in large-scale millimetre wave (mmWave) antenna arrays. By fully exploiting the sparse nature of the mmWave channel, such hybrid beamforming reduces complexity and power consumption when compared with a structure based on phase shifters. However, the difficulty of designing an optimum beamformer in the analog domain is prohibitive due to the binary nature of such a switch-based structure. Thus, here we propose a new method for designing a switch-based hybrid beamformer for massive MIMO communications in mmWave bands. We first propose a method for decoupling the joint optimization of analog and digital beamformers by confining the problem to a rank-constrained subspace. We then approximate the solution through two approaches: norm maximization (SHD-NM), and majorization (SHD-QRQU). In the norm maximization method, we propose a modified sequential convex programming (SCP) procedure that maximizes the mutual information while addressing the mismatch incurred from approximating the log-determinant by a Frobenius norm. In the second method, we employ a lower bound on the mutual information by QR factorization. We also introduce linear constraints in order to include frequently-used partially-connected structures. Finally, we show the feasibility, and effectiveness of the proposed methods through several numerical examples. The results demonstrate ability of the proposed methods to track closely the spectral efficiency provided by unconstrained optimal beamformer and phase shifting hybrid beamformer, and outperform a competitor switch-based hybrid beamformer.

eess.SP↗

arXiv2019

Memory-Attended Recurrent Network for Video Captioning

Typical techniques for video captioning follow the encoder-decoder framework, which can only focus on one source video being processed. A potential disadvantage of such design is that it cannot capture the multiple visual context information of a word appearing in more than one relevant videos in training data. To tackle this limitation, we propose the Memory-Attended Recurrent Network (MARN) for video captioning, in which a memory structure is designed to explore the full-spectrum correspondence between a word and its various similar visual contexts across videos in training data. Thus, our model is able to achieve a more comprehensive understanding for each word and yield higher captioning quality. Furthermore, the built memory structure enables our method to model the compatibility between adjacent words explicitly instead of asking the model to learn implicitly, as most existing models do. Extensive validation on two real-word datasets demonstrates that our MARN consistently outperforms state-of-the-art methods.

cs.CV↗

arXiv2019

Directionality reduces the impact of epidemics in multilayer networks

The study of how diseases spread has greatly benefited from advances in network modeling. Recently, a class of networks known as multilayer graphs has been shown to describe more accurately many real systems, making it possible to address more complex scenarios in epidemiology such as the interaction between different pathogens or multiple strains of the same disease. In this work, we study in depth a class of networks that have gone unnoticed up to now, despite of its relevance for spreading dynamics. Specifically, we focus on directed multilayer networks, characterized by the existence of directed links, either within the layers or across layers. Using the generating function approach and numerical simulations of a stochastic susceptible-infected-susceptible (SIS) model, we calculate the epidemic threshold for these networks for different degree distributions of the networks. Our results show that the main feature that determines the value of the epidemic threshold is the directionality of the links connecting different layers, regardless of the degree distribution chosen. Our findings are of utmost interest given the ubiquitous presence of directed multilayer networks and the widespread use of disease-like spreading processes in a broad range of phenomena such as diffusion processes in social and transportation systems.

physics.soc-ph↗

arXiv2018

Sparse Transmit Array Design for Dual-Function Radar Communications by Antenna Selection

Dual-function radar communications (DFRC) systems have recently been proposed to enable the coexistence of radar and wireless communications, which in turn alleviates the increased spectrum congestion crisis. In this paper, we consider the problem of sparse transmit array design for DFRC systems by antenna selection where same or different antennas are assigned to different functions. We consider three different types of DFRC systems which implement different simultaneous beamformers associated with single and different sparse arrays with shared aperture. We utilize the array configuration as an additional spatial degree of freedom (DoF) to suppress the cross-interference and facilitate the cohabitation of the two system functions. It is shown that the use of sparse arrays adds to improved angular resolution with well-controlled sidelobes on DFRC system paradigm. The utilization of sparse arrays in DFRC systems is validated using simulation examples.

eess.SP↗

arXiv2018

Dual-Function MIMO Radar Communications System Design Via Sparse Array Optimization

Spectrum congestion and competition over frequency bandwidth could be alleviated by deploying dual-function radar-communications systems, where the radar platform presents itself as a system of opportunity to secondary communication functions. In this paper, we propose a new technique for communication information embedding into the emission of multiple-input multiple-output (MIMO) radar using sparse antenna array configurations. The phases induced by antenna displacements in a sensor array are unique, which makes array configuration feasible for symbol embedding. We also exploit the fact that in a MIMO radar system, the association of independent waveforms with the transmit antennas can change over different pulse repetition periods without impacting the radar functionality. We show that by reconfiguring sparse transmit array through antenna selection and reordering waveform-antenna paring, a data rate of megabits per second can be achieved for a moderate number of transmit antennas. To counteract practical implementation issues, we propose a regularized antenna selection based signaling scheme. The possible data rate is analyzed and the symbol/bit error rates are derived. Simulation examples are provided for performance evaluations and to demonstrate the effectiveness of proposed DFRC techniques.

eess.SP↗

arXiv2018

Structural transition in interdependent networks with regular interconnections

Networks are often made up of several layers that exhibit diverse degrees of interdependencies. A multilayer interdependent network consists of a set of graphs $G$ that are interconnected through a weighted interconnection matrix $ B $, where the weight of each inter-graph link is a non-negative real number $ p $. Various dynamical processes, such as synchronization, cascading failures in power grids, and diffusion processes, are described by the Laplacian matrix $ Q $ characterizing the whole system. For the case in which the multilayer graph is a multiplex, where the number of nodes in each layer is the same and the interconnection matrix $ B=pI $, being $ I $ the identity matrix, it has been shown that there exists a structural transition at some critical coupling, $ p^* $. This transition is such that dynamical processes are separated into two regimes: if $ p > p^* $, the network acts as a whole; whereas when $ p<p^* $, the network operates as if the graphs encoding the layers were isolated. In this paper, we extend and generalize the structural transition threshold $ p^* $ to a regular interconnection matrix $ B $ (constant row and column sum). Specifically, we provide upper and lower bounds for the transition threshold $ p^* $ in interdependent networks with a regular interconnection matrix $ B $ and derive the exact transition threshold for special scenarios using the formalism of quotient graphs. Additionally, we discuss the physical meaning of the transition threshold $ p^* $ in terms of the minimum cut and show, through a counter-example, that the structural transition does not always exist. Our results are one step forward on the characterization of more realistic multilayer networks and might be relevant for systems that deviate from the topological constrains imposed by multiplex networks.

physics.soc-ph↗

arXiv2015

Quantifying the robustness of metro networks

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical networks, metros can be viewed as network topological entities, and as such they possess measurable network properties. In this paper, by using network science and graph theoretical concepts, we investigate both theoretical and experimental robustness metrics (i.e., the robustness indicator, the effective graph conductance, and the critical thresholds) and their performance in quantifying the robustness of metro networks under random failures or targeted attacks. We find that the theoretical metrics quantify different aspects of the robustness of metro networks. In particular, the robustness indicator captures the number of alternative paths and the effective graph conductance focuses on the length of each path. Moreover, the high positive correlation between the theoretical metrics and experimental metrics and the negative correlation within the theoretical metrics provide significant insights for planners to design more robust system while accommodating for transit specificities (e.g., alternative paths, fast transferring).

physics.soc-ph↗

arXiv2015

A network approach for power grid robustness against cascading failures

Cascading failures are one of the main reasons for blackouts in electrical power grids. Stable power supply requires a robust design of the power grid topology. Currently, the impact of the grid structure on the grid robustness is mainly assessed by purely topological metrics, that fail to capture the fundamental properties of the electrical power grids such as power flow allocation according to Kirchhoff's laws. This paper deploys the effective graph resistance as a metric to relate the topology of a grid to its robustness against cascading failures. Specifically, the effective graph resistance is deployed as a metric for network expansions (by means of transmission line additions) of an existing power grid. Four strategies based on network properties are investigated to optimize the effective graph resistance, accordingly to improve the robustness, of a given power grid at a low computational complexity. Experimental results suggest the existence of Braess's paradox in power grids: bringing an additional line into the system occasionally results in decrease of the grid robustness. This paper further investigates the impact of the topology on the Braess's paradox, and identifies specific sub-structures whose existence results in Braess's paradox. Careful assessment of the design and expansion choices of grid topologies incorporating the insights provided by this paper optimizes the robustness of a power grid, while avoiding the Braess's paradox in the system.

physics.soc-ph↗

arXiv2013

On the Instabilities of the Walker Propagating Domain Wall Solution

A powerful mathematical method for front instability analysis that was recently developed in the field of nonlinear dynamics is applied to the 1+1 (spatial and time) dimensional Landau-Lifshitz-Gilbert (LLG) equation. From the essential spectrum of the LLG equation, it is shown that the famous Walker rigid body propagating domain wall (DW) is not stable against the spin wave emission. In the low field region only stern spin waves are emitted while both stern and bow waves are generated under high fields. By using the properties of the absolute spectrum of the LLG equation, it is concluded that in a high enough field, but below the Walker breakdown field, the Walker solution could be convective/absolute unstable if the transverse magnetic anisotropy is larger than a critical value, corresponding to a significant modification of the DW profile and DW propagating speed. Since the Walker solution of 1+1 dimensional LLG equation can be realized in experiments, our results could be also used to test the mathematical method in a controlled manner.

cond-mat.mes-hall↗