We solve learning mixtures of graphs from epidemic cascades, establishing conditions and algorithms.
problem Learning the weighted edges of a balanced mixture of two undirected graphs from epidemic cascades.
method Established necessary and sufficient conditions for polynomial-time solvability, provided efficient algorithms with optimal sample complexity.
result First rigorous conditions and algorithms for learning graph mixtures from epidemic cascades.
We consider the problem of finding the graph on which an epidemic cascade spreads, given only the times when each node gets infected. While this is a problem of importance in several contexts -- offline and online social networks, e-commerce, epidemiology, vulnerabilities in infrastructure networks -- there has been ve…
Algorithm learns graph structure and weights from noisy epidemic cascade data.
problem Learning graph structure and weights from noisy infection times of multiple epidemics.
method Developed algorithms for two noisy settings: limited-noise and extreme-noise, with polynomial time complexity.
result Optimal sample complexity and efficient algorithms for various graph types.
The credit crisis roiling the world's financial markets will likely take years and entire careers to fully understand and analyze. A short empirical investigation of the current trends, however, demonstrates that the losses in certain markets, in this case the US equity markets, follow a cascade or epidemic flow like m…
We introduce a probabilistic framework that represents stylized banking networks with the aim of predicting the size of contagion events. Most previous work on random financial networks assumes independent connections between banks, whereas our framework explicitly allows for (dis)assortative edge probabilities (e.g., …
A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between banks, the possibility of disassortative edge probabilities (an above average tende…
We introduce a general framework for models of cascade and contagion processes on networks, to identify their commonalities and differences. In particular, models of social and financial cascades, as well as the fiber bundle model, the voter model, and models of epidemic spreading are recovered as special cases. To uni…
Seq2Seq models speed up epidemic model predictions.
problem Complex epidemic models are computationally expensive.
method Used deep seq2seq models as surrogates for complex models.
result Surrogates predict scenarios up to several thousand times faster.
New algorithm estimates past and future diffusion processes on networks.
problem Estimating past and future states of concurrent diffusion processes on networks.
method Extension of independent-cascade model, Belief-Propagation algorithm.
result Scalable and convergent algorithm for estimating diffusion processes.
Koopman-PINN framework improves epidemic model parameter inference and forecasting
problem Epidemic model parameter inference and forecasting
method Combining Koopman operator theory and physics-informed learning
result More accurate parameter estimation, trajectory reconstruction, and long-term forecasting
GPR models epidemic spread on logarithmic scale.
problem Modeling and predicting epidemic spread for policy decisions.
method Gaussian process regression (GPR) on logarithmic scale of infected cases.
result GPR predictions have high probability of being within 95% confidence interval for 94.29% of data.
Study improves epidemic forecasting with a sparsified GSRNN.
problem Epidemic forecasting on real-world health data.
method Graph-structured recurrent neural network (GSRNN) with sparsification via transformed-ℓ1 penalty. result Maintained prediction accuracy with 70% of network weights being zero.
Model for valuing options on epidemic spread.
problem Valuation of options on epidemic spread during an outbreak.
method Stochastic differential SIR model for epidemic dynamics.
result Parsimonious model for option valuation on epidemic spread.
Recently, the behavior of different epidemic models and their relation both to different types of geometries and to some biological models has been revisited . Path equations representing the behavior of epidemic models and their corresponding deviation vectors are examined. A comparison between paths and their deviati…
Study on stock market volatility and return dispersion during COVID-19.
problem Impact of COVID-19 on stock market volatility and return dispersion.
method Used Google index to proxy epidemic impact, modeled volatility, and analyzed influencing factors of log-return.
result Volatility significantly affected by epidemic and cross-sectional return dispersion, with positive coefficients.
New model captures long-term memory effects in epidemic dynamics.
problem Identifying memory effects in disease progression and recovery.
method Physics-informed neural networks (PINN) with fractional SEIRD model.
result Fractional memory order α improves predictive performance over classical models. Financial networks reveal systemic risk, suggesting new regulatory strategies.
problem Global financial interconnectedness and inadequacy of traditional risk models.
method Network-based models of financial systems to understand contagion and risk.
result Financial networks exhibit 'robust-yet-fragile' properties, informing cost-effective regulation.
Deep models forecast epidemics with uncertainty quantification.
problem Accurate probabilistic forecasting of epidemics is challenging due to nonlinear temporal dependencies and spatial interactions.
method Deep spatiotemporal engression methods with geometric ergodicity and asymptotic stationarity.
result Proposed methods outperform benchmarks in point and probabilistic forecasting.
Model predicts COVID-19 cases with high accuracy using mobility data.
problem Accurate forecasting of COVID-19 cases for resource management.
method Heterogeneous infection rate model with human mobility, linearization, weighted least squares.
result Extremely accurate predictions of confirmed cases at country and state levels.
Paper proposes a graph neural network for accurate long-term ILI prediction.
problem Limited long-term prediction performance and spatio-temporal dependency in existing models.
method Cross-location attention based graph neural network (Cola-GNN) for time series embeddings and location aware attentions.
result Proposed method shows strong predictive performance and interpretable results for long-term epidemic predictions.
New control strategy minimizes infected individuals in SIS epidemics.
problem Developing effective control strategies for SIS epidemics.
method Stochastic optimal control of SDEs with jumps, using treatment intensities.
result Control strategy consistently outperforms alternatives in synthetic data.
New method combines neural nets with epidemic models for better prediction.
problem Improving epidemic prediction and forecasting using deep neural networks.
method Integrates machine learning with compartmental disease models for data-driven analysis.
result Data augmentation strategy improves neural network reliability for epidemic forecasting.
Paper uses RL to optimize ICU load during COVID-19.
problem Optimizing ICU load during a pandemic.
method Combines epidemic model, Bayesian inference, and RL for adaptive intervention levels.
result RL policies reduce ICU burden compared to historical interventions.
Paper introduces a new method to model epidemic dynamics with varying parameters.
problem Capturing discontinuous variations in epidemic model parameters.
method Total variation regularization with Iterated Nelder--Mead optimization.
result The method accurately models epidemic dynamics with instant changes.
Unified model bridges mechanistic and non-mechanistic epidemic approaches.
problem Understanding the dynamics of epidemics with flexibility and interpretability.
method A mixture-based model representing time series as Gaussian mixtures, derived from a networked SIR framework.
result The model provides interpretable parameters and low prediction error, validating its use in understanding interventions.
On many social networking web sites such as Facebook and Twitter, resharing or reposting functionality allows users to share others' content with their own friends or followers. As content is reshared from user to user, large cascades of reshares can form. While a growing body of research has focused on analyzing and c…
Unified model predicts disease spread using EMD and ensemble learning.
problem Predicting fluctuating disease spread and individual behavior.
method SEIS-A framework, EMD decomposition, ensemble learning, on-line query data.
result The method outperforms other methods in predicting HFMD consultation rates.
Unified model forecasts epidemics with spatial and temporal dynamics.
problem Limited accuracy in traditional models and lack of interpretability in deep learning models.
method CSTGNN integrates Spatio-Contact SIR model with Graph Neural Networks.
result Effective spatiotemporal epidemic forecasting with interpretability.
New method for epidemic model inference using multinomial approximations.
problem Inference in stochastic epidemic models with partial observations.
method Recursive multinomial approximations to integrate over unobserved variables.
result Accuracy demonstrated through real and simulated data.
Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs. We propose a new spectral partitioning method that exploi…
It is the main purpose of this paper to introduce a graph-valued stochastic process in order to model the spread of a communicable infectious disease. The major novelty of the SIR model we promote lies in the fact that the social network on which the epidemics is taking place is not specified in advance but evolves thr…
Method predicts diffusion reach probabilities using node embeddings.
problem Estimating diffusion reach probabilities with limited cascades and network information.
method Representation learning on node embeddings for cascade prediction.
result Proposed method outperforms using available cascade data.
This paper optimizes power grid protection settings to maximize network degradation due to cascading attacks.
problem Cascading attacks on power grids and their undetected nature.
method Constrained Bayesian Optimization applied to transmission line protection settings.
result Even limited misconfiguration of protection settings can cause severe cascading attacks.
Model infers diffusion networks from heterogeneous cascade data.
problem Understanding and predicting diffusion processes in interconnected populations.
method Double mixture directed graph model with layer-specific constraints.
result Convex formulation allows for statistical and computational guarantees.
New insights into cascade feedback linearization of control systems.
problem Obtaining a cascade feedback linearization for invariant control systems.
method Introducing truncated versions of operators from the calculus of variations to prove new theorems.
result Established new geometry and foundational theorems for future work.
Study fairness in vaccine allocation in social networks.
problem Fairness implications of vaccine allocation strategies in social networks.
method Defined precision disease control problem, used ML Fairness Gym to simulate and analyze.
result Different treatment strategies distribute disease burden differently across subgroups.
PySR method automates discovering equations from data in chaotic dynamics and epidemics.
problem Discovering equations from complex data in dynamical systems.
method Symbolic regression methods, focusing on PySR.
result PySR method efficiently infers equations from chaotic dynamics and epidemic models, matching original forms.
Modeling cascading behavior in complex systems using CTBNs.
problem Understanding which states trigger cascading events in complex systems.
method Continuous-time Bayesian networks (CTBNs) for modeling and identifying likely sentry states.
result Identification of likely sentry states that may lead to cascading behavior.
Motivated by the pressing need for efficient optimization in online recommender systems, we revisit the cascading bandit model proposed by Kveton et al. (2015). While Thompson sampling (TS) algorithms have been shown to be empirically superior to Upper Confidence Bound (UCB) algorithms for cascading bandits, theoretica…
Robust model detects outliers in spatiotemporal epidemic data.
problem Outliers in epidemic data can mislead public health decisions.
method RST-GAM with mean-shift, adaptive Lasso, splines, and proximal algorithm.
result Demonstrates effectiveness in real-world COVID-19 data analysis.
Predicting epidemic dynamics is of great value in understanding and controlling diffusion processes, such as infectious disease spread and information propagation. This task is intractable, especially when surveillance resources are very limited. To address the challenge, we study the problem of active surveillance, i.…
Study historical cholera epidemics and simulate long-term mortality impacts.
problem Long-term impacts of mortality shocks on longevity.
method Historical analysis of cholera epidemics and mathematical modeling of stochastic Individual-Based models.
result Simulated long-term mortality impacts following a mortality shock.
Graph Mixture Density Networks model multimodal data on graphs.
problem Challenging conditional density estimation problems with structured data.
method Combining mixture models and graph representation learning.
result Significant improvement in likelihood of epidemic outcomes.
How big is the risk that a few initial failures of nodes in a network amplify to large cascades that span a substantial share of all nodes? Predicting the final cascade size is critical to ensure the functioning of a system as a whole. Yet, this task is hampered by uncertain or changing parameters and missing informati…
Study on information cascade fragility under mismatched revealing probabilities.
problem Analyzing the fragility of information cascades in decision-making processes with imperfect knowledge of revealing probabilities.
method Examined sequential decision-making models with players having private information and imitating previous decisions. Studied the effect of a mismatch between players' beliefs and actual revealing probabilities.
result Derived closed-form expressions for optimal learning rates and identified phase transitions in the behavior of asymptotic learning rates.
A search engine usually outputs a list of K web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the obje…
Paper uses RL to mitigate cascading failures in power systems.
problem Mitigating multi-stage cascading failures in power grids.
method Reinforcement Learning applied to DC-OPF for power flow optimization.
result Reduced system collapse rates through RL-based optimization.
Study bounds deepfake detection error probability using robust statistics.
problem Limiting error in deepfake detection.
method Formulated as hypothesis testing, uses robust statistics and Euclidean approximation.
result Established relationships between error probability and network thresholds.