activity
20142026
most citedA Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks

57 citations · 336 across the 51 of their papers we have counts for

collaborators
Showing 2018Show all

6 papers · 1 filter

q-bio.MN2018

Networks of ribosome flow models for modeling and analyzing intracellular traffic

Itzik Nanikashvili, Yoram Zarai, Alexander Ovseevich +2

The ribosome flow model with input and output (RFMIO) is a deterministic dynamical system that has been used to study the flow of ribosomes during mRNA translation. The RFMIO and i…

math.DS2018

On the spectral properties of nonsingular matrices that are strictly sign-regular for some order with applications to totally positive discrete-time systems

Rola Alseidi, Michael Margaliot, Jürgen Garloff

A matrix is called strictly sign-regular of order (denoted by ) if all its minors are non-zero and have the same sign. For example, totally positive matrices…

math.DS2018★ 3 cited

A Generalization of Smillie's Theorem on Strongly Cooperative Tridiagonal Systems

Eyal Weiss, Michael Margaliot

Smillie (1984) proved an interesting result on the stability of nonlinear, time-invariant, strongly cooperative, and tridiagonal dynamical systems. This result has found many appli…

math.OC2018★ 21 cited

Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm

Eyal Weiss, Michael Margaliot

Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: th…

math.DS2018★ 2 cited

Dynamical Systems with a Cyclic Sign Variation Diminishing Property

Tsuff Ben-Avraham, Guy Sharon, Yoram Zarai +1

Several studies analyzed certain nonlinear dynamical systems by showing that the cyclic number of sign variations in the vector of derivatives is an integer-valued Lyapunov functio…

math.DS2018

Revisiting Totally Positive Differential Systems: A Tutorial and New Results

Michael Margaliot, Eduardo D. Sontag

A matrix is called totally nonnegative (TN) if all its minors are nonnegative, and totally positive (TP) if all its minors are positive. Multiplying a vector by a TN matrix does no…