Search arXiv⌕ Search

arXiv subjects

Faraz Dadgostari

Publications and source records attributed to Faraz Dadgostari.

6 recordsLinked to original sources

Sparse-Observation Atmospheric Thermal Forecasting with Physics-Informed Neural Networks for Climate-Aware Digital Twins

Short-horizon forecasts of atmospheric temperature are needed to support climate-aware digital-twin systems, but such forecasts must be produced where thermal observations are incomplete. This study evaluates a physics-informed neural network for potential-temperature forecasting, constrained by a pressure-coordinate thermodynamic advection-source equation and a diabatic-source closure fit from the preceding 12-hour period and frozen before future-time training. Using hourly ERA5 reanalysis at three pressure levels, the model is evaluated as a conditional hindcast at lead times of one, two and three hours against persistence, local-trend, and two matched neural-network baselines, one of which receives the same future meteorological forcing as the PINN, helping distinguish the physical constraint from access to future forcing. In an Oklahoma development case, mean RMSE improvement over the strongest baseline grew from 8.1\% at one hour to 23.8\% at three hours; under an observation-density sweep down to 5\% of candidate locations, this 3-hour advantage remained 14.6--16.9\%, with no evidence that lower density improves performance. Under a fixed protocol transferred to an Alabama heat event with three virtual-observation layouts, three-hour improvement ranged 19.7-24.4\% with consistent origin-level wins. A parallel Montana stress test, in which fixed pressure levels intersected complex terrain, produced a three-hour degradation of roughly 17.5\%, identifying a terrain-related applicability limit of the formulation. Together, these results indicate that the physics constraint's benefit grows with forecast horizon, persists under severe observation sparsity, and transfers across regions, but is bounded by the validity of a fixed vertical-coordinate representation over complex terrain, evidence relevant to physics-constrained components of climate-aware forecasting and digital-twin systems.

cs.AI↗

Equilibrium Causal Digital Twins: Validation, Transport, and Identification Limits

Digital twins are often used to predict how a system would respond to an intervention. In systems with feedback, a twin must reproduce an equilibrium counterfactual, and a twin developed in one domain may fail after mechanisms change. We study when these predictions can be validated and transported. For equilibrium causal games, we give conditions on the mechanisms, equilibrium selection, and intervention design under which agreement with experimental distributions identifies the counterfactual of interest. We show why agreement of means and covariances is insufficient for distributional queries. We then introduce cyclic selection diagrams and derive criteria for direct reuse and for hybrid models that combine invariant source mechanisms with target information. An impossibility result constructs systems that agree under every experiment in a finite design but disagree on the target counterfactual, showing that validation requires structural assumptions. For linear models, we derive intervention requirements that depend on the mechanisms that changed, the observation model, and graph support. When point identification fails, we characterize the remaining range of query values. We also provide statistical tests for reconstructed means and covariances and illustrate the theory in synthetic feedback systems.

stat.ME↗

Equilibrium Causal Games: Separation, Identification, and the Identifiability of Cyclic Latent States

Power grids, markets, and interacting populations, settle into feedback driven equilibria observed through unknown sensors. Our Equilibrium Causal Game (ECG) joins a game to its cyclic causal model, hidden inputs, sensor map, and rules for interventions and equilibrium selection; interventions edit declared objects and recompute equilibrium. Under stated conditions, ECG-separation is sound but incomplete in our examples. Back-door/half-trek routes identify observed queries. Yet for an untouched rotationally symmetric Gaussian block, second moments determine only a source-frame rotation, across which distinct-variable effects generically change. Unknown sensing creates a separate ambiguity. In passive stable linear models without self-effects, unknown wiring and full-rank unknown sensing leave $B$ completely unidentified for $d\ge2$. Under LiNG, non-Gaussianity removes the source rotation; mechanism interventions separate sensing from interactions. With unknown support, invariant sensing, aligned responses, and well-posed single-target interventions identify $(H,B)$ up to declared equivalence. Of $d$ targets, $d-1$ suffice exactly when the sole untargeted node directly parents all others; otherwise $d$ are needed. Acquisition probes are excluded; known wiring gives no universal count. With nonlinear sensing, isotropic Gaussian source blocks admit hidden twists within and across blocks in labelled environments preserving required radial laws. Conversely, under stated positivity, informative one-block changes, rank, and irreducibility conditions, the finest independent source-block representation is identified within the stated alternative class up to block permutation and blockwise coordinate changes, but not downstream mechanisms or the sensor/interaction split. Together, these results show which causal conclusions equilibrium data support and which require targeted experiments.

math.OC↗

BESSIE: A Behavior and Epidemic Simulator for Use With Synthetic Populations

In this paper, we present BESSIE (Behavior and Epidemic Simulator for Synthetic Information Environments), an open source, agent-based simulator for COVID-type epidemics. BESSIE uses a synthetic population where each person has demographic attributes, belong to a household, and has a base activity- and visit schedule covering seven days. The simulated disease spreads through contacts that arise from joint visits to the locations where activities take place. The simulation model has a plugin-type programmable behavioral model where, based on the dynamics and observables tracked by the simulator, agents decide on actions such as wearing a mask, engaging in social distancing, or refraining from certain activity types by staying at home instead. The plugins are supplied as Python code. To the best of our knowledge, BESSIE is a unique simulator supporting this feature set, and most certainly as open software. To illustrate the use of BESSIE, we provide a COVID-relevant example demonstrating some of its capabilities. The example uses a synthetic population for the City of Charlottesville, Virginia. Both this population and the Python plugin modules used in the example are made available. The Python implementation, which can run on anything from a laptop to a cluster, is made available under the Apache 2.0 license (https://www.apache.org/licenses/LICENSE-2.0.html). The example population accompanying this publication is made available under the CC BY 4.0 license (https://creativecommons.org/licenses/by/4.0/).

cs.MA↗

Early Outbreak Detection for Proactive Crisis Management Using Twitter Data: COVID-19 a Case Study in the US

During a disease outbreak, timely non-medical interventions are critical in preventing the disease from growing into an epidemic and ultimately a pandemic. However, taking quick measures requires the capability to detect the early warning signs of the outbreak. This work collects Twitter posts surrounding the 2020 COVID-19 pandemic expressing the most common symptoms of COVID-19 including cough and fever, geolocated to the United States. Through examining the variation in Twitter activities at the state level, we observed a temporal lag between the rises in the number of symptom reporting tweets and officially reported positive cases which varies between 5 to 19 days.

cs.SI↗

Modeling and Developing Appropriate Algorithm to Solve Generalized Probabilistic Vehicle Routing Problem

This thesis introduces stochastic generalized routing problem model and proposes exact and heuristic algorithms to solve it efficiently, in a wide range of problem sizes. At first, the classic routing problem with its common variations in deterministic form is reviewed. Its mathematical models are demonstrated and exact and heuristic algorithms are described. Next, stochastic generalized routing problem is formalized and discussed. Since this problem is introducing for the first time in this thesis, it is necessary to review the required theoretical principles of the problem in terms of stochastic integer programming and linear algebra in discrete spaces. Thus before modeling the problem and developing exact and heuristic algorithms, the required bases to understand the proposed model and algorithms to solve it is discussed. In the next stage with regard to NP-Hard nature of the problem, heuristic algorithms are proposed to efficiently solve it in the large scale sizes. Finally, computational results in different sizes are analyzed. Keywords: Stochastic integer optimization, Stochastic Generalized Routing, Optimal Cut, L-Shape Method

math.OC↗