Target observation of complex networks

Sun, Yifan; Sun, Zhenjie

doi:10.1016/j.physa.2018.11.015

Cited by 3 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, it will be expected that our discussion is applied to other MP equations for such as the minimum dominating set [18] or community detection [19]. Instead of the cluster variation method [6] for a loopy network, the extended development of MP by considering primitive cycles [19] may be useful even with complex calculations to treat the independence more accurately for finding an unique solution.…”

Section: Discussionmentioning

confidence: 99%

Fast convergence to an approximate solution by message-passing for complex optimizations

Hayashi

2024

NOLTA

View full text Add to dashboard Cite

Message-passing (MP) is a powerful tool for finding an approximate solution in optimization. We generalize it to nonlinear product-sum form, and numerically show the fast convergence for the minimum feedback vertex set and the minimum vertex cover known as NP-hard problems. From the linearity of MP in a logarithmic space, it is derived that an equilibrium solution exists in a neighborhood of random initial values. These results will give one of the reason why the convergence is very fast in collective computation based on a common mathematical background.

show abstract

Section: Discussionmentioning

confidence: 99%

Fast convergence to an approximate solution by message-passing for complex optimizations

Hayashi

2024

NOLTA

View full text Add to dashboard Cite

show abstract

“…It will be expected that our discussion is applied to other MP equations for such as the minimum dominating set [Sun and Sun(2019)] or community detection [Newman(2023)]. Instead of the cluster variation method [Yedidia et al(2001)] for a loopy network, the extended development of MP by considering primitive cycles [Newman(2023)] may be useful even with complex calculations to treat the independence more accurately for finding an unique solution.…”

Section: Discussionmentioning

confidence: 99%

Fast convergence to an approximate solution by message-passing for complex optimizations

Hayashi

2023

Preprint

View full text Add to dashboard Cite

Message-passing (MP) is a powerful tool for finding an approximate solution in optimization. We generalize it in product-sum form, and numerically show the fast convergence. From the linearity of MP in a logarithmic space, it is derived that an equilibrium solution exists in a neighborhood of random initial values. These results will give one of the reason why the convergence is very fast in collective computation based on a common mathematical background.

show abstract

Dynamical Analysis and Synchronization of Complex Network Dynamic Systems under Continuous-Time

Yang,

Tian,

Wang

et al. 2024

Symmetry

View full text Add to dashboard Cite

In multilayer complex networks, the uncertainty in node states leads to intricate behaviors. It is, therefore, of great importance to be able to estimate the states of target nodes in these systems, both for theoretical advancements and practical applications. This paper introduces a state observer-based approach for the state estimation of such networks, focusing specifically on a class of complex dynamic networks with nodes that correspond one-to-one. Initially, a chaotic system is employed to model the dynamics of each node and highlight the essential state components for analysis and derivation. A network state observer is then constructed using a unique diagonal matrix, which underpins the driver and response-layer networks. By integrating control theory and stability function analysis, the effectiveness of the observer in achieving synchronization between complex dynamic networks and target systems is confirmed. Additionally, the efficacy and precision of the proposed method are validated through simulation.

show abstract

Target observation of complex networks

Cited by 3 publications

References 32 publications

Fast convergence to an approximate solution by message-passing for complex optimizations

Fast convergence to an approximate solution by message-passing for complex optimizations

Fast convergence to an approximate solution by message-passing for complex optimizations

Dynamical Analysis and Synchronization of Complex Network Dynamic Systems under Continuous-Time

Contact Info

Product

Resources

About