most citedData Assimilation for Sign-indefinite Priors: A generalization of Sinkhorn's algorithm

1 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

eess.SY2024

Controllability and Observability of Temporal Hypergraphs

Anqi Dong, Xin Mao, Can Chen

Numerous complex systems, such as those arisen in ecological networks, genomic contact networks, and social networks, exhibit higher-order and time-varying characteristics, which c…

math.OC20241 cited

Network Learning with Directional Sign Patterns

Anqi Dong, Can Chen, Tryphon T. Georgiou

Complex systems can be effectively modeled via graphs that encode networked interactions, where relations between entities or nodes are often quantified by signed edge weights, e.g…

eess.SY2024

On Complexity of Stability Analysis in Higher-order Ecological Networks through Tensor Decompositions

Anqi Dong, Can Chen

Complex ecological networks are often characterized by intricate interactions that extend beyond pairwise relationships. Understanding the stability of higher-order ecological netw…

stat.ML20231 cited

Data Assimilation for Sign-indefinite Priors: A generalization of Sinkhorn's algorithm

Anqi Dong, Tryphon T. Georgiou, Allen Tannenbaum

The purpose of this work is to develop a framework to calibrate signed datasets so as to be consistent with specified marginals by suitably extending the Schrödinger-Fortet-Sinkhor…

q-bio.MN20231 cited

Promotion/Inhibition Effects in Networks: A Model with Negative Probabilities

Anqi Dong, Tryphon T. Georgiou, Allen Tannenbaum

Biological networks often encapsulate promotion/inhibition as signed edge-weights of a graph. Nodes may correspond to genes assigned expression levels (mass) of respective proteins…