Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1307.2642

Structure controllability of complex network based on preferential matching

Xizhe Zhang·Tianyang Lv·Xueying Yang·Bin Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.

Explore related subjects

math-phcs.SImath.MPphysics.soc-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xizhe Zhang, Tianyang Lv, Xueying Yang, Bin Zhang. 2014-11-21. Structure controllability of complex network based on preferential matching. https://doi.org/10.1371/journal.pone.0112039

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How to Recover Oscillation-Free Pressure in Real Fluids: The RFQC Method and Its Liquid-Upwind Anomaly

From the perspective of continuum thermodynamics, we revisit the pressure oscillation problem in finite-volume methods for multiphase real fluids and clarify the physical counterpart of the Real Fluid Quasi-Conservative (RFQC) method. The pressure oscillation in conservative finite-volume methods originates from their implicit thermodynamic equilibrium assumption, whereas recovering an oscillation-free pressure requires additional physical information. The RFQC method achieves this by evolving the affine parameters xi and E0 of the isentropic internal-energy-pressure relation along pathlines, while the thermodynamic re-projection converts the deviation from the isentropic trajectory into an internal-energy error, thereby ensuring the thermodynamic consistency and numerical stability of the method. We then investigate the applicability limit of the RFQC method and identify a Liquid-upwind Anomaly (LUA) in extreme phase-change cases. For a Riemann problem involving liquid-vapor phase change, a numerical anomaly may occur if a liquid-upwind translational velocity is initially superimposed. Theoretical analysis reveals that this anomaly is initiated by the jump in the affine slope xi during phase change, which delays pressure rise in the downstream vapor cell. Concurrently, the re-projection removes the positive pressure increment, repeatedly generating large internal-energy errors and trapping the vapor cell in a cycle of delayed pressure recovery. The analysis indicates that the LUA is a start-up anomaly, which can be resolved by introducing a regularization strategy at the initial discontinuity. With the proposed regularization strategy, the RFQC method is equipped with enhanced accuracy and robustness for extreme thermodynamic flows, such as sonic phase-change jets.

math-ph↗
arXiv2026

Finite Rodriguez-Villegas Approximants to the Riemann $ξ$-Function

We construct a sequence of finite Rodriguez-Villegas transforms converging locally uniformly to the Riemann $ξ$-function in the critical strip. The input is a positive symmetric profile on the unit interval obtained from the Riemann theta kernel through convolution with the hyperbolic-secant kernel and the logistic coordinate. The profile is a Stieltjes function of $x(1-x)$. Its Bernstein polynomials produce reciprocal numerators and exact finite functional equations. The same numerators admit an exact realization as fermionic supertraces, while the Bernstein polynomials are normalized Gibbs traces.

math-ph↗
arXiv2026

Finite images of braid group representations and algebraic solutions of KZ-type equations

Finite monodromy provides a bridge between group representations and algebraic solutions of differential equations. We study this connection for the Katz-Long-Moody construction, which transforms representations of the semidirect product of a free group and a braid group into new representations of the same group and is related to Knizhnik-Zamolodchikov (KZ)-type equations. For a fixed finite-image input, we classify the parameter values for which the resulting representations have finite image, both on the semidirect product and on its free-group and braid-group subgroups. In particular, finiteness of the braid-group image is independent of the admissible parameter. These results give necessary and sufficient conditions for all solutions of the corresponding regular-singular KZ-type equations to be algebraic. On restriction to the free group, they also characterize finite monodromy and algebraicity of all solutions of the associated Fuchsian systems, connecting the classification to classical questions about algebraic hypergeometric functions.

math-ph↗