Limit theorems for distributions invariant under groups of transformations
变换群不变分布的极限定理AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要明确列出网络模型及可交换随机结构的应用,其他内容主要属于通用群不变概率理论。
变换群不变分布的极限定理AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory implies a law of large numbers for such invariant distributions: If the group satisfies suitable conditions, expectations can be estimated by averaging over subsets of transformations, and these estimators are strongly consistent. We show that, if a mixing condition holds, the averages also satisfy a central limit theorem, a Berry–Esseen bound, and concentration. These are extended further to apply to triangular arrays, to randomly subsampled averages, and to a generalization of U-statistics. As applications, we obtain a general limit theorem for exchangeable random structures, and new results on stationary random fields, network models, and a class of marked point processes. We also establish asymptotic normality of the empirical entropy for a large class of processes. Some known results are recovered as special cases, and can hence be interpreted as an outcome of symmetry. The proofs adapt Stein’s method.
社会网络数据中处理效应的识别与估计:当社会连接存在混杂时
In observational network data, the adoption of a treatment and the formation of social ties often depend on the same characteristics that affect outcomes. We propose a generalized propensity score for each unit's effective treatment, built from a model for treatment assignment and a dyadic model for network formation, which may include latent node heterogeneity. The score is marginalized over the network given covariates rather than conditioned on the realized network, and…
双重高维线性混合模型下异质图模型的推断
Inferring the structure of population-level functional connectivity networks from multi-subject functional magnetic resonance imaging data is essential for understanding the connectivity patterns underlying cognitive and behavioral functions. Graphical models provide a formal statistical framework for inferring the graph structure. However, the multi-level nature of functional magnetic resonance imaging data---where each level corresponds, for instance, to a…
复杂(准)实验设计下的简单标准误
We develop standard errors for estimates of causal effects in settings where the distribution of treatment exposures is known but potentially exhibits complicated dependence patterns across units. Such dependence arises, for example, in settings with spillovers/interference across units or when the treatment assignment is spatially correlated. Our variance estimator generalizes several properties of the Neyman variance estimator for completely randomized experiments to…
We develop inference for complete dyadic samples with spatial dependence governed by geographic distances between nodes, covering settings beyond the scope of existing dyadic inference theory. We propose spatial variance and corrected block jackknife estimators consistent in nondegenerate and degenerate Gaussian cases. Under degeneracy, spatial subsampling consistently estimates possibly non-Gaussian limits. Combining the jackknife with subsampling yields the max…
边处理与节点结果的网络实验
We present a methodology for analyzing node-level outcomes while experimenting with edge-level treatments in a population connected by an undirected graph. Under our design, nodes are randomly assigned to test or control, and each edge inherits the treatment of its endpoints, with conflicts resolved by randomization. We use each node's assigned status as an instrument for its treatment exposure. We show that the Wald estimator is consistent for the global average treatment…
小噪声下维度发散的网络随机微分方程推断
We consider inference for network stochastic differential equations in a small-noise, high-dimensional regime, where the diffusion coefficient vanishes with $\ep\to0$ while the network size and parameter dimension may diverge. We develop a minimum-distance estimation framework based on a deterministic measurement model that may omit nuisance terms in the drift, and derive a non-asymptotic error bound decomposing the estimation error into stochastic fluctuation, nuisance…