TTERGM models improve social network predictions by incorporating triadic relationships.
problem Lack of models capturing triadic relationships and social learning theories in temporal network data.
method Introduced TTERGM, a generative model that includes triadic relationships and social learning theory as additional probability distributions. Parameters are estimated via Monte Carlo maximum likelihood.
result TTERGM achieves improved accuracy and fidelity compared to existing models on social network data.
TG-GAN models dynamic graph evolution for continuous-time temporal graphs.
problem Challenges in modeling dynamic temporal graphs, especially in continuous time.
method Temporal Graph Generative Adversarial Network (TG-GAN) that models truncated edge sequences, time budgets, and node attributes.
result TG-GAN significantly outperforms existing methods in efficiency and effectiveness.
We propose a family of statistical models for social network evolution over time, which represents an extension of Exponential Random Graph Models (ERGMs). Many of the methods for ERGMs are readily adapted for these models, including maximum likelihood estimation algorithms. We discuss models of this type and their pro…
Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving networks. However, due to significant comput…
Spatial-temporal graph modeling is an important task to analyze the spatial relations and temporal trends of components in a system. Existing approaches mostly capture the spatial dependency on a fixed graph structure, assuming that the underlying relation between entities is pre-determined. However, the explicit graph…
IDPGs extend RDPGs with a Poisson process for random latent positions.
problem Modeling randomness in latent positions for graph structure.
method Introduce IDPGs using Poisson point processes on latent Euclidean space.
result Continuous analogues of adjacency matrices link latent structure to observed graphs.
We introduce a new framework for comparing parametric network families.
problem Comparing and analyzing data modeled as parameterized families of networks.
method A Gromov-Wasserstein variant of optimal transport for defining distances.
result Established foundational properties and theoretical approximation guarantees for the new distances.
Representing networks in a low dimensional latent space is a crucial task with many interesting applications in graph learning problems, such as link prediction and node classification. A widely applied network representation learning paradigm is based on the combination of random walks for sampling context nodes and t…
Polynomial-time algorithm estimates edge density of random graphs with privacy and robustness.
problem Estimating edge density of random graphs while maintaining privacy and robustness.
method Sum-of-squares algorithm for robust edge density estimation and reduction from privacy to robustness.
result Optimal error rate up to logarithmic factors, matching theoretical lower bounds.
TGNN4I model forecasts irregularly observed graph data using ODEs.
problem Forecasting graph-structured data with irregular time steps and partial observations.
method Introduces a time-continuous latent state in each node using ODEs and GRUs, integrating graph neural network layers.
result Validated usefulness of graph structure and time-continuous dynamics in irregular observation settings.
Study evaluates RKHS choices for assessing graph models using KSD tests.
problem Effect of RKHS choice on KSD tests for graph model assessment.
method Investigated power performance and computational runtime of KSD tests for ERGMs and synthetic graph generators.
result Different RKHS choices affect KSD test performance and computational runtime.
SteinGen generates diverse graph samples from a single example.
problem Generating graphs with characteristic structures and diversity from a single example.
method Combines Stein's method and MCMC with Glauber dynamics and re-estimation of the Stein operator.
result High distributional similarity to the original data, combined with high sample diversity.
HYPA-DBGNN detects anomalous sequential patterns in temporal graphs.
problem Modeling temporal patterns in dynamic graphs, especially considering deviations from random shuffling.
method Two-step approach combining null model inference and neural message passing.
result HYPA-DBGNN outperforms baseline methods in static node classification tasks.
The paper shows that relaxing assumptions about causal graphs can lead to exponentially large equivalence classes.
problem The size of Markov equivalence classes under relaxed assumptions.
method Analytical proofs for three settings: sparse random directed acyclic graphs, uniformly random acyclic directed mixed graphs, and uniformly random directed cyclic graphs.
result Exponentially large lower bounds for the expected size of Markov equivalence classes.
For highly sensitive real-world predictive analytic applications such as healthcare and medicine, having good prediction accuracy alone is often not enough. These kinds of applications require a decision making process which uses uncertainty estimation as input whenever possible. Quality of uncertainty estimation is a …
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. By utilizing fast matrix block-approximation techniques, we propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions, w…
Algorithm estimates parameters over time-varying graphs without special assumptions.
problem Estimating parameters over time-varying graphs without assuming independence.
method Decentralized online regularized learning with innovation, consensus, and regularization terms.
result Estimations converge almost surely under certain conditions.
There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with difficulties in computing maximum likelihood estimates. The issues associated with these difficulties relate to the bro…
We propose a novel approach for density estimation with exponential families for the case when the true density may not fall within the chosen family. Our approach augments the sufficient statistics with features designed to accumulate probability mass in the neighborhood of the observed points, resulting in a non-para…
New method models aptamer libraries as Boltzmann-weighted graph ensembles for better affinity predictions.
problem Anomalous candidates in SELEX datasets obscure true aptamer-ligand affinity.
method Boltzmann graph ensemble embeddings for thermodynamically parameterized exponential-family random graphs.
result Proposed embedding enables robust community detection and subgraph-level explanations for aptamer ligand affinity.
We propose a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute features of graphs in Euclidean space, our approach obtains features on a surface of a hypersphere. We then utilize a von Mises-Fisher distribution, an exponential family distribution on the surface …
Analyzing the temporal behavior of nodes in time-varying graphs is useful for many applications such as targeted advertising, community evolution and outlier detection. In this paper, we present a novel approach, STWalk, for learning trajectory representations of nodes in temporal graphs. The proposed framework makes u…
A novel algorithm minimizes regret in a multi-agent bandit problem with time-varying random graphs and heterogeneous rewards.
problem Minimizing regret in a multi-agent multi-armed bandit problem with time-varying random graphs and heterogeneous rewards.
method Introduces a novel algorithmic framework combining averaging-based consensus with a weighting technique and upper confidence bound.
result Derives optimal instance-dependent regret upper bounds of order logT in both sub-gaussian and sub-exponential environments. Framework for dynamic node embeddings from graph streams.
problem Temporal prediction-based applications using graph stream data.
method ε-graph time-series representation, temporal reachability graphs, weighted temporal summary graphs.
result Dynamic embedding methods achieve better predictive performance.
A new growth model for dynamic networks using Markovian latent points.
problem Modeling temporal dynamic networks with latent points and distances.
method Markovian latent space dynamic with Euclidean Sphere sampling and connection probabilities based on geodesic distances.
result Theoretical guarantees for non-parametric estimation of the latitude and envelope functions.
TGR rewires temporal graphs to improve TGNN performance.
problem Temporal graphs in evolving networks can suffer from under-reaching and over-squashing issues.
method TGR uses expander graph propagation to create message-passing highways between temporally distant nodes.
result TGR achieves state-of-the-art results on temporal graph benchmarks.
Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.
problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.
New graph kernels capture spatio-temporal interactions.
problem Lack of justified spatio-temporal graph kernels for graph problems.
method Derive graph kernels via SPDEs for spatio-temporal modelling.
result Non-separable spatio-temporal graph kernels outperform existing ones.
The spatio-temporal graph learning is becoming an increasingly important object of graph study. Many application domains involve highly dynamic graphs where temporal information is crucial, e.g. traffic networks and financial transaction graphs. Despite the constant progress made on learning structured data, there is s…
Enhanced GNN with expanded attention window and partially random embeddings.
problem Limited expressivity of traditional GNNs in distinguishing non-isomorphic graphs.
method Graph attention network with expanding attention window and partially random initial embeddings. Head dropout for regularization.
result Improved ability to differentiate between non-isomorphic graphs.
GTEA learns node representations in temporal interaction graphs.
problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.
Combines CNN and LSTM for spatio-temporal graph networks.
problem Improving spatio-temporal feature extraction.
method Proposes a new architecture combining CNN and LSTM temporal blocks.
result Empirical comparison shows our model outperforms existing models.
We propose a mathematical framework for the study of a family of random fields--called forward performances--which arise as numerical representation of certain rational preference relations in mathematical finance. Their spatial structure corresponds to that of utility functions, while the temporal one reflects a Nisio…
In this work we introduce a time- and memory-efficient method for structured prediction that couples neuron decisions across both space at time. We show that we are able to perform exact and efficient inference on a densely connected spatio-temporal graph by capitalizing on recent advances on deep Gaussian Conditional …
A new test assesses how well observed networks fit a specified ERGM model.
problem Testing the goodness of fit for ERGMs with a single network observation.
method Kernel Stein discrepancy combined with a discrete Stein operator for ERGMs, Monte Carlo simulation.
result The test provides theoretical and practical support for assessing ERGM fit.
We model GitHub interactions as a temporal knowledge graph for software engineering questions.
problem Insufficient performance of existing temporal models on extrapolated queries and time prediction.
method Introduced an extension to current temporal models using relative temporal information.
result Improved performance on extrapolated queries and time prediction.
Linear time algorithm for random walk kernels on sparse graphs.
problem Efficient computation of general random walk kernels for large graphs.
method Sample dependent random walks to compute graph embeddings without direct graph product.
result Up to 27x faster and scalable to 128x larger graphs than previous methods.
Study improves understanding of network degree distributions using non-linear ERGs.
problem Lack of models capable of accounting for the variance of empirical degree distributions.
method Defined a fitness-induced variant of the two-star model to reproduce sample variance.
result Non-linear ERGs can reproduce the sample variance of empirical degree distributions.
The methods of statistical physics are widely used for modelling complex networks. Building on the recently proposed Equilibrium Expectation approach, we derive a simple and efficient algorithm for maximum likelihood estimation (MLE) of parameters of exponential family distributions - a family of statistical models, th…
Method analyzes large-scale network data to detect communication pattern shifts.
problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.
Spatiotemporal forecasting has various applications in neuroscience, climate and transportation domain. Traffic forecasting is one canonical example of such learning task. The task is challenging due to (1) complex spatial dependency on road networks, (2) non-linear temporal dynamics with changing road conditions and (…
Study examines how COVID-19 affects bond yields using network filtering methods.
problem Impact of COVID-19 on sovereign bond yields.
method Network filtering methods applied to a correlation matrix of sovereign bond yields.
result Mean correlation decreases across all filtering methods during the COVID-19 period.
SRR detects early signs of financial crises using multi-layer graphs.
problem Predicting systemic financial transitions from evolving market interactions.
method Systemic Risk Radar (SRR) models financial markets as multi-layer graphs.
result Graph-derived features provide useful early-warning signals compared to feature-based models.
Graph Neural Networks improve volatility prediction in financial markets.
problem Traditional models struggle with complex, non-linear interdependencies in financial markets.
method Temporal Graph Attention Network (Temporal GAT) combines GCNs and GATs to capture dynamic graph structures.
result Temporal GAT outperforms traditional GARCH models in volatility forecasting, especially for short- to mid-term predictions.
Conditional probabilistic graphical models provide a powerful framework for structured regression in spatio-temporal datasets with complex correlation patterns. However, in real-life applications a large fraction of observations is often missing, which can severely limit the representational power of these models. In t…
New algorithms bound graph structure sampling and learning high-dimensional graphical models.
problem Learning high-dimensional graphical models and efficient graph structure sampling.
method Online learning framework with exponentially weighted average (EWA) or randomized weighted majority (RWM) forecasters using log loss function.
result New sample complexity bounds and efficient algorithms for learning Bayes nets, including trees and chordal skeletons.
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 clusters evolving networks using spatio-temporal graph Laplacian.
problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.