Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The parameters of a linear compartment model are usually estimated from experimental input-output data. A problem arises when infinitely many parameter values can yield the same result; such a model is called unidentifiable. In this case, one can search for an identifiable reparametrization of the model---a map which reduces the number of parameters such that the reduced model is identifiable.  study a specific class of models which are known to be unidentifiable. Using algebraic geometry and graph theory,  translate a criterion given by Meshkat and Sullivant for the existence of an identifiable scaling reparametrization to a new criterion based on the rank of a ighted adjacency matrix of a certain bipartite graph. This allows us to derive several new constructions to obtain graphs with an identifiable scaling reparametrization. Using these constructions, a large subclass of such graphs is obtained. Finally,  present a procedure for subdividing or deleting edges to ensure that a model has an ident...
['Ja Jasmijn Baaijens', 'Jan Draisma']
I am writing a research paper on a idea On the existence of identifiable reparametrizations for linear compartment models
[{"from": "human", "value": "I am writing a research paper on a idea On the existence of identifiable reparametrizations for linear compartment models"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The parameters of a linear compartment model are usually estimated from experimental input-output data. A problem arises when infinitely many parameter values can yield the same result; such a model is called unidentifiable. In this case, one can search for an identifiable reparametrization of the model---a map which reduces the number of parameters such that the reduced model is identifiable.  study a specific class of models which are known to be unidentifiable. Using algebraic geometry and graph theory,  translate a criterion given by Meshkat and Sullivant for the existence of an identifiable scaling reparametrization to a new criterion based on the rank of a ighted adjacency matrix of a certain bipartite graph. This allows us to derive several new constructions to obtain graphs with an identifiable scaling reparametrization. Using these constructions, a large subclass of such graphs is obtained. Finally,  present a procedure for subdividing or deleting edges to ensure that a model has an ident..."}]