Search Results for author:
Found 5 papers, 1 papers with code
On Complexity of Stability Analysis in Higher-order Ecological Networks through Tensor Decompositions
Complex ecological networks are often characterized by intricate interactions that extend beyond pairwise relationships.
Data Assimilation for Sign-indefinite Priors: A generalization of Sinkhorn's algorithm
The resulting algorithm generalizes the Sinkhorn algorithm in that it amounts to iterative scaling of the entries of the array along different coordinate directions.
Promotion/Inhibition Effects in Networks: A Model with Negative Probabilities
Herein we address the inverse problem to determine network edge-weights based on a sign-indefinite adjacency and expression levels at the nodes.
Monge-Kantorovich Optimal Transport Through Constrictions and Flow-rate Constraints
We quantify flow-rate constraints via a bound on a sought probability density of the times that mass-elements cross toll stations and cast the transportation scheduling in a Kantorovich-type of formalism.
Optimal transport through a toll
We provide a precise formulation which, in addition, is amenable to generalization in higher dimensions.
