What type of study is this?

This is a Quantitative Study study.

October 2, 2025Open Access

Expanders in Models of Social Networks

View Full Paper

Ask AI

Bookmark

Minimum-Component Distance GIRGs demonstrate strong expanding properties for social networks with dimension d ≥ 2.
A suitable constant shows that induced subgraphs with vertices of degree at least (log n)^C form expanders.
The expansion factor depends on the choice of constant C, being ω(1) for most vertex sets.
These findings indicate faster algorithms and mixing processes on expander graphs.

No takes yet. Share an insight, caveat, or question.

Analysis reveals that minimum-component distance girgs exhibit strong expander properties, suggesting new implications for social network modeling.

Kaufmann et al. (2025) studied this question.

View Full Paper

Ask AI

Bookmark

Analysis reveals that minimum-component distance girgs exhibit strong expander properties, suggesting new implications for social network modeling.