{"title":"线性区室模型可识别性数据库","authors":"Natali Gogishvili","doi":"arxiv-2406.16132","DOIUrl":null,"url":null,"abstract":"Structural identifiability is an important property of parametric ODE models.\nWhen conducting an experiment and inferring the parameter value from the\ntime-series data, we want to know if the value is globally, locally, or\nnon-identifiable. Global identifiability of the parameter indicates that there\nexists only one possible solution to the inference problem, local\nidentifiability suggests that there could be several (but finitely many)\npossibilities, while non-identifiability implies that there are infinitely many\npossibilities for the value. Having this information is useful since, one\nwould, for example, only perform inferences for the parameters which are\nidentifiable. Given the current significance and widespread research conducted\nin this area, we decided to create a database of linear compartment models and\ntheir identifiability results. This facilitates the process of checking\ntheorems and conjectures and drawing conclusions on identifiability. By only\nstoring models up to symmetries and isomorphisms, we optimize memory efficiency\nand reduce query time. We conclude by applying our database to real problems.\nWe tested a conjecture about deleting one leak of the model states in the paper\n'Linear compartmental models: Input-output equations and operations that\npreserve identifiability' by E. Gross et al., and managed to produce a\ncounterexample. We also compute some interesting statistics related to the\nidentifiability of linear compartment model parameters.","PeriodicalId":501216,"journal":{"name":"arXiv - CS - Discrete Mathematics","volume":"25 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Database for identifiability properties of linear compartmental models\",\"authors\":\"Natali Gogishvili\",\"doi\":\"arxiv-2406.16132\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Structural identifiability is an important property of parametric ODE models.\\nWhen conducting an experiment and inferring the parameter value from the\\ntime-series data, we want to know if the value is globally, locally, or\\nnon-identifiable. Global identifiability of the parameter indicates that there\\nexists only one possible solution to the inference problem, local\\nidentifiability suggests that there could be several (but finitely many)\\npossibilities, while non-identifiability implies that there are infinitely many\\npossibilities for the value. Having this information is useful since, one\\nwould, for example, only perform inferences for the parameters which are\\nidentifiable. Given the current significance and widespread research conducted\\nin this area, we decided to create a database of linear compartment models and\\ntheir identifiability results. This facilitates the process of checking\\ntheorems and conjectures and drawing conclusions on identifiability. By only\\nstoring models up to symmetries and isomorphisms, we optimize memory efficiency\\nand reduce query time. We conclude by applying our database to real problems.\\nWe tested a conjecture about deleting one leak of the model states in the paper\\n'Linear compartmental models: Input-output equations and operations that\\npreserve identifiability' by E. Gross et al., and managed to produce a\\ncounterexample. We also compute some interesting statistics related to the\\nidentifiability of linear compartment model parameters.\",\"PeriodicalId\":501216,\"journal\":{\"name\":\"arXiv - CS - Discrete Mathematics\",\"volume\":\"25 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.16132\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.16132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Database for identifiability properties of linear compartmental models
Structural identifiability is an important property of parametric ODE models.
When conducting an experiment and inferring the parameter value from the
time-series data, we want to know if the value is globally, locally, or
non-identifiable. Global identifiability of the parameter indicates that there
exists only one possible solution to the inference problem, local
identifiability suggests that there could be several (but finitely many)
possibilities, while non-identifiability implies that there are infinitely many
possibilities for the value. Having this information is useful since, one
would, for example, only perform inferences for the parameters which are
identifiable. Given the current significance and widespread research conducted
in this area, we decided to create a database of linear compartment models and
their identifiability results. This facilitates the process of checking
theorems and conjectures and drawing conclusions on identifiability. By only
storing models up to symmetries and isomorphisms, we optimize memory efficiency
and reduce query time. We conclude by applying our database to real problems.
We tested a conjecture about deleting one leak of the model states in the paper
'Linear compartmental models: Input-output equations and operations that
preserve identifiability' by E. Gross et al., and managed to produce a
counterexample. We also compute some interesting statistics related to the
identifiability of linear compartment model parameters.