Score Driven Generalized Fitness Model for Sparse and Weighted Temporal Networks
稀疏加权时变网络的得分驱动广义适应度模型AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要以稀疏加权网络的连接、权重及网络动态建模为核心。
稀疏加权时变网络的得分驱动广义适应度模型AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
While the vast majority of the literature on models for temporal networks focuses on binary graphs, often one can associate a weight to each link. In such cases the data are better described by a weighted, or valued, network. An important well known fact is that real world weighted networks are typically sparse. We propose a novel time varying parameter model for sparse and weighted temporal networks as a combination of the fitness model, appropriately extended, and the score driven framework. We consider a zero augmented generalized linear model to handle the weights and an observation driven approach to describe time varying parameters. The result is a flexible approach where the probability of a link to exist is independent from its expected weight. This represents a crucial difference with alternative specifications proposed in the recent literature, with relevant implications for the flexibility of the model. Our approach also accommodates for the dependence of the network dynamics on external variables. We present a link forecasting analysis to data describing the overnight exposures in the Euro interbank market and investigate whether the influence of EONIA rates on the interbank network dynamics has changed over time.
GNAR-edge:时变边权网络的自回归模型
In economic and financial applications, there is often the need for analysing multivariate time series, comprising of time series for a range of quantities. In some applications such complex systems can be associated with some underlying network describing pairwise relationships among the quantities. Accounting for the underlying network structure for the analysis of this type of multivariate time series is required for assessing estimation error and can be particularly…
通过模型平均实现多层网络迁移学习的框架
Link prediction in multilayer networks is a key challenge in applications such as recommendation systems and protein-protein interaction prediction. While many techniques have been developed, most rely on assumptions about shared structures and require access to raw auxiliary data, limiting their practicality. To address these issues, we propose a novel transfer learning framework for multilayer networks using a bi-level model averaging method. A $K$-fold cross-validation…
具有动态异质溢出的矩阵值空间自回归
We introduce a new time-varying parameter spatial matrix autoregressive model that integrates matrix-valued time series, heterogeneous spillover effects, outlier robustness, and time-varying parameters in one unified framework. The model allows for separate dynamic spatial spillover effects across both the row and column dimensions of the matrix-valued observations. Robustness can be introduced via a matrix Student’s t distribution. The model can still be estimated…
具有分组边效应的降秩网络自回归
We propose the Edge-Grouped Reduced-Rank Network Autoregressive model (Edge-Grouped RRNAR) for multivariate time series observed over a network. The model allows transmission effects to vary across prespecified and economically interpretable groups of edges, while using a low-rank structure to capture cross-variable dynamics. This structure separates where network transmission occurs from which variables transmit and respond. We develop a topology-aware and block-specific…
含噪网络测量下时变网络构成与预测依赖的分离
A common question about networked time series is whether outcomes changed because shocks transmit more strongly or because the pattern of connections changed. Standard practice inserts a recorded network into an outcome regression and reads movements of the fitted coefficient as changes in transmission strength. When the network is latent, time varying, and measured with error, this reading fails: changes in strength and changes in composition can produce the same outcome…
时变网络估计中的装饰图极限
We propose a unified nonparametric framework for modeling time-evolving networks using decorated graphons (also known as probability-graphons): symmetric functions that assign to each node pair a probability distribution over binary edge time series. This generalizes the static decorated-graphon construction to dynamic graphs while preserving node exchangeability and allowing temporal dynamics such as memory and periodicity. Models in which edges evolve independently given…