Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 58 min ago
PreprintarXiv licencearXiv

Activity-Conditioned Residual Association from Aggregated Relational Data

Abstract

Aggregated relational data (ARD) record how many ties sampled respondents have to prespecified groups without revealing individual dyads. We develop a conditional test for prespecified cross-group concordance beyond an additive-activity network model. When the groups form an exhaustive partition, respondent degree is observed exactly. For arbitrary fixed activity values under an independent-Bernoulli additive-logit null, conditioning two respondents on equal degree yields a finite nonpositive sign restriction for their two disjoint group-count differences. Analyst-randomized pair thinning gives a conservative baseline. Under a stronger fixed-cell design with group-specific smooth activity profiles and positive cross-role overlap, an observable clipped full-pair statistic gives conservative one-network inference with graph-independent sampled respondents. Finite and growing matched-law constructions establish that the target contains bivariate information absent from a collapsed binary count. The full-pair procedure is uniformly consistent on a primitive relative-open neighborhood of a specified rank-one alternative. Fixed-dimensional lattice local limits make the conditioning and availability requirements explicit.

Related

  1. Community Detection from Aggregated Relational Data: Identifiability and Spectral Recovery
    Andrew Davison, Owen G. Ward
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Network recovery from aggregated relational data: An impossibility theorem
    Yen-hsuan Tseng
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. PREF-VG: Topology-Conditioned Residual Adaptation for Probabilistic Multi-Horizon Student Engagement Forecasting
    Jinfeng Xu, Yancun Jiang, Qianxin Xie +1
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  4. Cauchy-Aggregated Ridge Tests for High-Dimensional Factor Pricing Models
    Ping Zhao, Dan Zhuang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Score-Based Generative Data Assimilation for Integrating Aggregated Surveillance Data into Agent-Based Models in Epidemic Tracking
    Siming Liang, Jacob Hauck, Minglei Yang +3
BibTeX
@misc{tseng2026activityconditioned,
  title = {{Activity-Conditioned Residual Association from Aggregated Relational Data}},
  author = {Yen-hsuan Tseng},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2608.27599},
  eprint = {2608.27599},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.27599},
}
RIS
TY  - UNPB
TI  - Activity-Conditioned Residual Association from Aggregated Relational Data
AU  - Yen-hsuan Tseng
PY  - 2026
DA  - 2026/09/09
PB  - arXiv
DO  - 10.48550/arxiv.2608.27599
UR  - https://arxiv.org/abs/2608.27599
AB  - Aggregated relational data (ARD) record how many ties sampled respondents have to prespecified groups without revealing individual dyads. We develop a conditional test for prespecified cross-group concordance beyond an additive-activity network model. When the groups form an exhaustive partition, respondent degree is observed exactly. For arbitrary fixed activity values under an independent-Bernoulli additive-logit null, conditioning two respondents on equal degree yields a finite nonpositive sign restriction for their two disjoint group-count differences. Analyst-randomized pair thinning gives a conservative baseline. Under a stronger fixed-cell design with group-specific smooth activity profiles and positive cross-role overlap, an observable clipped full-pair statistic gives conservative one-network inference with graph-independent sampled respondents. Finite and growing matched-law constructions establish that the target contains bivariate information absent from a collapsed binary count. The full-pair procedure is uniformly consistent on a primitive relative-open neighborhood of a specified rank-one alternative. Fixed-dimensional lattice local limits make the conditioning and availability requirements explicit.
ER  -