Jacob Calvert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Jacob Calvert has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Jana Hoffman
Dascena, Inc., Houston, TX, United States
10 shared publications - Ritankar Das
Montera, Inc. dba Forta, 548 Market St, PMB 89605, San Francisco, CA 94104-5401, USA
10 shared publications - Qingqing Mao
Montera, Inc. dba Forta, 548 Market St, PMB 89605, San Francisco, CA 94104-5401, USA
8 shared publications - Gina Barnes
Montera, Inc. dba Forta, 548 Market St, PMB 89605, San Francisco, CA 94104-5401, USA
7 shared publications - Abigail Green-Saxena
Dascena, Inc., Houston, TX, United States
6 shared publications - Emily Pellegrini
Dascena, Inc., Houston, TX, United States
6 shared publications
Latest Publications
- 9 November 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (5)
Boltzmann-like occupation of nonequilibrium steady states on dense disordered networks
- 9 November 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 114 (5)
Boltzmann-like occupation of nonequilibrium steady states on dense disordered networks
- 16 December 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (6) , 064122
Correlation thresholds in the steady states of particle systems and spin glasses
A growing body of theoretical and empirical evidence shows that the global steady-state distributions of many equilibrium and nonequilibrium systems approximately satisfy an analog of the Boltzmann distribution, with a local dynamical property of states playing the role of energy. The correlation between the effective potential of the steady-state distribution and the logarithm of the exit rates determines the quality of this approximation. We demonstrate and explain this phenomenon in a simple one-dimensional particle system and in random dynamics of the Sherrington-Kirkpatrick spin glass by providing the first explicit estimates of this correlation. We find that, as parameters of the dynamics vary, each system exhibits a threshold above and below which the correlation dramatically differs. We explain how these thresholds arise from underlying transitions in the relationship between the local and global "parts" of the effective potential.
- 16 December 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 112 (6) , 064122
Correlation thresholds in the steady states of particle systems and spin glasses
A growing body of theoretical and empirical evidence shows that the global steady-state distributions of many equilibrium and nonequilibrium systems approximately satisfy an analog of the Boltzmann distribution, with a local dynamical property of states playing the role of energy. The correlation between the effective potential of the steady-state distribution and the logarithm of the exit rates determines the quality of this approximation. We demonstrate and explain this phenomenon in a simple one-dimensional particle system and in random dynamics of the Sherrington-Kirkpatrick spin glass by providing the first explicit estimates of this correlation. We find that, as parameters of the dynamics vary, each system exhibits a threshold above and below which the correlation dramatically differs. We explain how these thresholds arise from underlying transitions in the relationship between the local and global "parts" of the effective potential.
- Open Access
- 11 October 2024
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 121 (42)
A local–global principle for nonequilibrium steady states
The global steady state of a system in thermal equilibrium exponentially favors configurations with lesser energy. This principle is a powerful explanation of self-organization because energy is a local property of configurations. For nonequilibrium systems, there is no such property for which an analogous principle holds, hence no common explanation of the diverse forms of self-organization they exhibit. However, a flurry of recent empirical results has shown that a local property of configurations called “rattling” predicts the steady states of some nonequilibrium systems, leading to claims of a far-reaching principle of nonequilibrium self-organization. But for which nonequilibrium systems is rattling accurate, and why? We develop a theory of rattling in terms of Markov processes that gives simple and precise answers to these key questions. Our results show that rattling predicts a broader class of nonequilibrium steady states than has been claimed and for different reasons than have been suggested. Its predictions hold to an extent determined by the relative variance of, and correlation between, the local and global “parts” of a steady state. We show how these quantities characterize the local-global relationships of various random walks on random graphs, spin-glass dynamics, and models of animal collective behavior. Surprisingly, we find that the core idea of rattling is so general as to apply to equilibrium and nonequilibrium systems alike.
- 11 October 2024
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 121 (42)
Open AccessA local–global principle for nonequilibrium steady states
The global steady state of a system in thermal equilibrium exponentially favors configurations with lesser energy. This principle is a powerful explanation of self-organization because energy is a local property of configurations. For nonequilibrium systems, there is no such property for which an analogous principle holds, hence no common explanation of the diverse forms of self-organization they exhibit. However, a flurry of recent empirical results has shown that a local property of configurations called “rattling” predicts the steady states of some nonequilibrium systems, leading to claims of a far-reaching principle of nonequilibrium self-organization. But for which nonequilibrium systems is rattling accurate, and why? We develop a theory of rattling in terms of Markov processes that gives simple and precise answers to these key questions. Our results show that rattling predicts a broader class of nonequilibrium steady states than has been claimed and for different reasons than have been suggested. Its predictions hold to an extent determined by the relative variance of, and correlation between, the local and global “parts” of a steady state. We show how these quantities characterize the local-global relationships of various random walks on random graphs, spin-glass dynamics, and models of animal collective behavior. Surprisingly, we find that the core idea of rattling is so general as to apply to equilibrium and nonequilibrium systems alike.
- Open Access
- 27 September 2023
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 11
Collapse and diffusion in harmonic activation and transport
For an n-element subset U of $\mathbb {Z}^2$ , select x from U according to harmonic measure from infinity, remove x from U and start a random walk from x. If the walk leaves from y when it first enters the rest of U, add y to it. Iterating this procedure constitutes the process we call harmonic activation and transport (HAT). HAT exhibits a phenomenon we refer to as collapse: Informally, the diameter shrinks to its logarithm over a number of steps which is comparable to this logarithm. Collapse implies the existence of the stationary distribution of HAT, where configurations are viewed up to translation, and the exponential tightness of diameter at stationarity. Additionally, collapse produces a renewal structure with which we establish that the center of mass process, properly rescaled, converges in distribution to two-dimensional Brownian motion. To characterize the phenomenon of collapse, we address fundamental questions about the extremal behavior of harmonic measure and escape probabilities. Among n-element subsets of $\mathbb {Z}^2$ , what is the least positive value of harmonic measure? What is the probability of escape from the set to a distance of, say, d? Concerning the former, examples abound for which the harmonic measure is exponentially small in n. We prove that it can be no smaller than exponential in $n \log n$ . Regarding the latter, the escape probability is at most the reciprocal of $\log d$ , up to a constant factor. We prove it is always at least this much, up to an n-dependent factor.- 27 September 2023
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 11
Open AccessCollapse and diffusion in harmonic activation and transport
For an n-element subset U of $\mathbb {Z}^2$ , select x from U according to harmonic measure from infinity, remove x from U and start a random walk from x. If the walk leaves from y when it first enters the rest of U, add y to it. Iterating this procedure constitutes the process we call harmonic activation and transport (HAT). HAT exhibits a phenomenon we refer to as collapse: Informally, the diameter shrinks to its logarithm over a number of steps which is comparable to this logarithm. Collapse implies the existence of the stationary distribution of HAT, where configurations are viewed up to translation, and the exponential tightness of diameter at stationarity. Additionally, collapse produces a renewal structure with which we establish that the center of mass process, properly rescaled, converges in distribution to two-dimensional Brownian motion. To characterize the phenomenon of collapse, we address fundamental questions about the extremal behavior of harmonic measure and escape probabilities. Among n-element subsets of $\mathbb {Z}^2$ , what is the least positive value of harmonic measure? What is the probability of escape from the set to a distance of, say, d? Concerning the former, examples abound for which the harmonic measure is exponentially small in n. We prove that it can be no smaller than exponential in $n \log n$ . Regarding the latter, the escape probability is at most the reciprocal of $\log d$ , up to a constant factor. We prove it is always at least this much, up to an n-dependent factor. - Open Access
Critical numerosity in collective behavior
Natural collectives, despite comprising individuals who may not know their numerosity, can exhibit behaviors that depend sensitively on it. This paper proves that the collective behavior of number-oblivious individuals can even have a critical numerosity, above and below which it qualitatively differs. We formalize the concept of critical numerosity in terms of a family of zero--one laws and introduce a model of collective motion, called chain activation and transport (CAT), that has one. CAT describes the collective motion of $n \geq 2$ individuals as a Markov chain that rearranges $n$-element subsets of the $d$-dimensional grid, $m < n$ elements at a time. According to the individuals' dynamics, with each step, CAT removes $m$ elements from the set and then progressively adds $m$ elements to the boundary of what remains, in a way that favors the consecutive addition and removal of nearby elements. This paper proves that, if $d \geq 3$, then CAT has a critical numerosity of $n_c = 2m+2$ with respect to the behavior of its diameter. Specifically, if $n < n_c$, then the elements form one "cluster," the diameter of which has an a.s.--finite limit infimum. However, if $n \geq n_c$, then there is an a.s.--finite time at which the set consists of clusters of between $m+1$ and $2m+1$ elements, and forever after which these clusters grow apart, resulting in unchecked diameter growth. The existence of critical numerosities means that collectives can exhibit "phase transitions" that are governed purely by their numerosity and not, for example, their density or the strength of their interactions. This fact challenges prevalent beliefs about collective behavior and suggests new functionality for programmable matter. More broadly, it demonstrates an opportunity to explore the possible behaviors collectives through the study of random processes that rearrange sets.Open AccessCritical numerosity in collective behavior
Natural collectives, despite comprising individuals who may not know their numerosity, can exhibit behaviors that depend sensitively on it. This paper proves that the collective behavior of number-oblivious individuals can even have a critical numerosity, above and below which it qualitatively differs. We formalize the concept of critical numerosity in terms of a family of zero--one laws and introduce a model of collective motion, called chain activation and transport (CAT), that has one. CAT describes the collective motion of $n \geq 2$ individuals as a Markov chain that rearranges $n$-element subsets of the $d$-dimensional grid, $m < n$ elements at a time. According to the individuals' dynamics, with each step, CAT removes $m$ elements from the set and then progressively adds $m$ elements to the boundary of what remains, in a way that favors the consecutive addition and removal of nearby elements. This paper proves that, if $d \geq 3$, then CAT has a critical numerosity of $n_c = 2m+2$ with respect to the behavior of its diameter. Specifically, if $n < n_c$, then the elements form one "cluster," the diameter of which has an a.s.--finite limit infimum. However, if $n \geq n_c$, then there is an a.s.--finite time at which the set consists of clusters of between $m+1$ and $2m+1$ elements, and forever after which these clusters grow apart, resulting in unchecked diameter growth. The existence of critical numerosities means that collectives can exhibit "phase transitions" that are governed purely by their numerosity and not, for example, their density or the strength of their interactions. This fact challenges prevalent beliefs about collective behavior and suggests new functionality for programmable matter. More broadly, it demonstrates an opportunity to explore the possible behaviors collectives through the study of random processes that rearrange sets. - Open Access
- 4 August 2022
- Published by Frontiers Media SA in Frontiers in Pediatrics
- Vol. 10, 886212
Machine learning early prediction of respiratory syncytial virus in pediatric hospitalized patients
Respiratory syncytial virus (RSV) causes millions of infections among children in the US each year and can cause severe disease or death. Infections that are not promptly detected can cause outbreaks that put other hospitalized patients at risk. No tools besides diagnostic testing are available to rapidly and reliably predict RSV infections among hospitalized patients. We conducted a retrospective study from pediatric electronic health record (EHR) data and built a machine learning model to predict whether a patient will test positive to RSV by nucleic acid amplification test during their stay. Our model demonstrated excellent discrimination with an area under the receiver-operating curve of 0.919, a sensitivity of 0.802, and specificity of 0.876. Our model can help clinicians identify patients who may have RSV infections rapidly and cost-effectively. Successfully integrating this model into routine pediatric inpatient care may assist efforts in patient care and infection control.
- 4 August 2022
- Published by Frontiers Media SA in Frontiers in Pediatrics
- Vol. 10, 886212
Open AccessMachine learning early prediction of respiratory syncytial virus in pediatric hospitalized patients
Respiratory syncytial virus (RSV) causes millions of infections among children in the US each year and can cause severe disease or death. Infections that are not promptly detected can cause outbreaks that put other hospitalized patients at risk. No tools besides diagnostic testing are available to rapidly and reliably predict RSV infections among hospitalized patients. We conducted a retrospective study from pediatric electronic health record (EHR) data and built a machine learning model to predict whether a patient will test positive to RSV by nucleic acid amplification test during their stay. Our model demonstrated excellent discrimination with an area under the receiver-operating curve of 0.919, a sensitivity of 0.802, and specificity of 0.876. Our model can help clinicians identify patients who may have RSV infections rapidly and cost-effectively. Successfully integrating this model into routine pediatric inpatient care may assist efforts in patient care and infection control.
- Open Access
- 1 April 2022
- Published by JMIR Publications Inc. in JMIR Aging
- Vol. 5 (2) , e35373
Predicting Falls in Long-term Care Facilities: Machine Learning Study
Background: Short-term fall prediction models that use electronic health records (EHRs) may enable the implementation of dynamic care practices that specifically address changes in individualized fall risk within senior care facilities. Objective: The aim of this study is to implement machine learning (ML) algorithms that use EHR data to predict a 3-month fall risk in residents from a variety of senior care facilities providing different levels of care. Methods: This retrospective study obtained EHR data (2007-2021) from Juniper Communities’ proprietary database of 2785 individuals primarily residing in skilled nursing facilities, independent living facilities, and assisted living facilities across the United States. We assessed the performance of 3 ML-based fall prediction models and the Juniper Communities’ fall risk assessment. Additional analyses were conducted to examine how changes in the input features, training data sets, and prediction windows affected the performance of these models. Results: The Extreme Gradient Boosting model exhibited the highest performance, with an area under the receiver operating characteristic curve of 0.846 (95% CI 0.794-0.894), specificity of 0.848, diagnostic odds ratio of 13.40, and sensitivity of 0.706, while achieving the best trade-off in balancing true positive and negative rates. The number of active medications was the most significant feature associated with fall risk, followed by a resident’s number of active diseases and several variables associated with vital signs, including diastolic blood pressure and changes in weight and respiratory rates. The combination of vital signs with traditional risk factors as input features achieved higher prediction accuracy than using either group of features alone. Conclusions: This study shows that the Extreme Gradient Boosting technique can use a large number of features from EHR data to make short-term fall predictions with a better performance than that of conventional fall risk assessments and other ML models. The integration of routinely collected EHR data, particularly vital signs, into fall prediction models may generate more accurate fall risk surveillance than models without vital signs. Our data support the use of ML models for dynamic, cost-effective, and automated fall predictions in different types of senior care facilities.
- 1 April 2022
- Published by JMIR Publications Inc. in JMIR Aging
- Vol. 5 (2) , e35373
Open AccessPredicting Falls in Long-term Care Facilities: Machine Learning Study
Background: Short-term fall prediction models that use electronic health records (EHRs) may enable the implementation of dynamic care practices that specifically address changes in individualized fall risk within senior care facilities. Objective: The aim of this study is to implement machine learning (ML) algorithms that use EHR data to predict a 3-month fall risk in residents from a variety of senior care facilities providing different levels of care. Methods: This retrospective study obtained EHR data (2007-2021) from Juniper Communities’ proprietary database of 2785 individuals primarily residing in skilled nursing facilities, independent living facilities, and assisted living facilities across the United States. We assessed the performance of 3 ML-based fall prediction models and the Juniper Communities’ fall risk assessment. Additional analyses were conducted to examine how changes in the input features, training data sets, and prediction windows affected the performance of these models. Results: The Extreme Gradient Boosting model exhibited the highest performance, with an area under the receiver operating characteristic curve of 0.846 (95% CI 0.794-0.894), specificity of 0.848, diagnostic odds ratio of 13.40, and sensitivity of 0.706, while achieving the best trade-off in balancing true positive and negative rates. The number of active medications was the most significant feature associated with fall risk, followed by a resident’s number of active diseases and several variables associated with vital signs, including diastolic blood pressure and changes in weight and respiratory rates. The combination of vital signs with traditional risk factors as input features achieved higher prediction accuracy than using either group of features alone. Conclusions: This study shows that the Extreme Gradient Boosting technique can use a large number of features from EHR data to make short-term fall predictions with a better performance than that of conventional fall risk assessments and other ML models. The integration of routinely collected EHR data, particularly vital signs, into fall prediction models may generate more accurate fall risk surveillance than models without vital signs. Our data support the use of ML models for dynamic, cost-effective, and automated fall predictions in different types of senior care facilities.
- Open Access
- 2 December 2021
- Published by JMIR Publications Inc. in JMIR Preprints
Predicting Falls in Long-term Care Facilities: Machine Learning Study (Preprint)
BACKGROUND Short-term fall prediction models that use electronic health records (EHRs) may enable the implementation of dynamic care practices that specifically address changes in individualized fall risk within senior care facilities. OBJECTIVE The aim of this study is to implement machine learning (ML) algorithms that use EHR data to predict a 3-month fall risk in residents from a variety of senior care facilities providing different levels of care. METHODS This retrospective study obtained EHR data (2007-2021) from Juniper Communities’ proprietary database of 2785 individuals primarily residing in skilled nursing facilities, independent living facilities, and assisted living facilities across the United States. We assessed the performance of 3 ML-based fall prediction models and the Juniper Communities’ fall risk assessment. Additional analyses were conducted to examine how changes in the input features, training data sets, and prediction windows affected the performance of these models. RESULTS The Extreme Gradient Boosting model exhibited the highest performance, with an area under the receiver operating characteristic curve of 0.846 (95% CI 0.794-0.894), specificity of 0.848, diagnostic odds ratio of 13.40, and sensitivity of 0.706, while achieving the best trade-off in balancing true positive and negative rates. The number of active medications was the most significant feature associated with fall risk, followed by a resident’s number of active diseases and several variables associated with vital signs, including diastolic blood pressure and changes in weight and respiratory rates. The combination of vital signs with traditional risk factors as input features achieved higher prediction accuracy than using either group of features alone. CONCLUSIONS This study shows that the Extreme Gradient Boosting technique can use a large number of features from EHR data to make short-term fall predictions with a better performance than that of conventional fall risk assessments and other ML models. The integration of routinely collected EHR data, particularly vital signs, into fall prediction models may generate more accurate fall risk surveillance than models without vital signs. Our data support the use of ML models for dynamic, cost-effective, and automated fall predictions in different types of senior care facilities. CLINICALTRIAL
- 2 December 2021
- Published by JMIR Publications Inc. in JMIR Preprints
Open AccessPredicting Falls in Long-term Care Facilities: Machine Learning Study (Preprint)
BACKGROUND Short-term fall prediction models that use electronic health records (EHRs) may enable the implementation of dynamic care practices that specifically address changes in individualized fall risk within senior care facilities. OBJECTIVE The aim of this study is to implement machine learning (ML) algorithms that use EHR data to predict a 3-month fall risk in residents from a variety of senior care facilities providing different levels of care. METHODS This retrospective study obtained EHR data (2007-2021) from Juniper Communities’ proprietary database of 2785 individuals primarily residing in skilled nursing facilities, independent living facilities, and assisted living facilities across the United States. We assessed the performance of 3 ML-based fall prediction models and the Juniper Communities’ fall risk assessment. Additional analyses were conducted to examine how changes in the input features, training data sets, and prediction windows affected the performance of these models. RESULTS The Extreme Gradient Boosting model exhibited the highest performance, with an area under the receiver operating characteristic curve of 0.846 (95% CI 0.794-0.894), specificity of 0.848, diagnostic odds ratio of 13.40, and sensitivity of 0.706, while achieving the best trade-off in balancing true positive and negative rates. The number of active medications was the most significant feature associated with fall risk, followed by a resident’s number of active diseases and several variables associated with vital signs, including diastolic blood pressure and changes in weight and respiratory rates. The combination of vital signs with traditional risk factors as input features achieved higher prediction accuracy than using either group of features alone. CONCLUSIONS This study shows that the Extreme Gradient Boosting technique can use a large number of features from EHR data to make short-term fall predictions with a better performance than that of conventional fall risk assessments and other ML models. The integration of routinely collected EHR data, particularly vital signs, into fall prediction models may generate more accurate fall risk surveillance than models without vital signs. Our data support the use of ML models for dynamic, cost-effective, and automated fall predictions in different types of senior care facilities. CLINICALTRIAL
- Open Access
- 14 September 2021
- Published by JMIR Publications Inc. in JMIR Formative Research
- Vol. 5 (9) , e28028
Semisupervised Deep Learning Techniques for Predicting Acute Respiratory Distress Syndrome From Time-Series Clinical Data: Model Development and Validation Study
Background: A high number of patients who are hospitalized with COVID-19 develop acute respiratory distress syndrome (ARDS). Objective: In response to the need for clinical decision support tools to help manage the next pandemic during the early stages (ie, when limited labeled data are present), we developed machine learning algorithms that use semisupervised learning (SSL) techniques to predict ARDS development in general and COVID-19 populations based on limited labeled data. Methods: SSL techniques were applied to 29,127 encounters with patients who were admitted to 7 US hospitals from May 1, 2019, to May 1, 2021. A recurrent neural network that used a time series of electronic health record data was applied to data that were collected when a patient’s peripheral oxygen saturation level fell below the normal range (<97%) to predict the subsequent development of ARDS during the remaining duration of patients’ hospital stay. Model performance was assessed with the area under the receiver operating characteristic curve and area under the precision recall curve of an external hold-out test set. Results: For the whole data set, the median time between the first peripheral oxygen saturation measurement of <97% and subsequent respiratory failure was 21 hours. The area under the receiver operating characteristic curve for predicting subsequent ARDS development was 0.73 when the model was trained on a labeled data set of 6930 patients, 0.78 when the model was trained on the labeled data set that had been augmented with the unlabeled data set of 16,173 patients by using SSL techniques, and 0.84 when the model was trained on the entire training set of 23,103 labeled patients. Conclusions: In the context of using time-series inpatient data and a careful model training design, unlabeled data can be used to improve the performance of machine learning models when labeled data for predicting ARDS development are scarce or expensive.
- 14 September 2021
- Published by JMIR Publications Inc. in JMIR Formative Research
- Vol. 5 (9) , e28028
Open AccessSemisupervised Deep Learning Techniques for Predicting Acute Respiratory Distress Syndrome From Time-Series Clinical Data: Model Development and Validation Study
Background: A high number of patients who are hospitalized with COVID-19 develop acute respiratory distress syndrome (ARDS). Objective: In response to the need for clinical decision support tools to help manage the next pandemic during the early stages (ie, when limited labeled data are present), we developed machine learning algorithms that use semisupervised learning (SSL) techniques to predict ARDS development in general and COVID-19 populations based on limited labeled data. Methods: SSL techniques were applied to 29,127 encounters with patients who were admitted to 7 US hospitals from May 1, 2019, to May 1, 2021. A recurrent neural network that used a time series of electronic health record data was applied to data that were collected when a patient’s peripheral oxygen saturation level fell below the normal range (<97%) to predict the subsequent development of ARDS during the remaining duration of patients’ hospital stay. Model performance was assessed with the area under the receiver operating characteristic curve and area under the precision recall curve of an external hold-out test set. Results: For the whole data set, the median time between the first peripheral oxygen saturation measurement of <97% and subsequent respiratory failure was 21 hours. The area under the receiver operating characteristic curve for predicting subsequent ARDS development was 0.73 when the model was trained on a labeled data set of 6930 patients, 0.78 when the model was trained on the labeled data set that had been augmented with the unlabeled data set of 16,173 patients by using SSL techniques, and 0.84 when the model was trained on the entire training set of 23,103 labeled patients. Conclusions: In the context of using time-series inpatient data and a careful model training design, unlabeled data can be used to improve the performance of machine learning models when labeled data for predicting ARDS development are scarce or expensive.
- Open Access
- 1 September 2021
- Published by Elsevier in Health Policy and Technology
- Vol. 10 (3) , 100554
Personalized stratification of hospitalization risk amidst COVID-19: A machine learning approach
- 1 September 2021
- Published by Elsevier in Health Policy and Technology
- Vol. 10 (3) , 100554
Open AccessPersonalized stratification of hospitalization risk amidst COVID-19: A machine learning approach