Random preferential attachment hypergraph-Reference-Cited by-同舟云学术

Random preferential attachment hypergraph

Published:2019-08-27 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
language:
Short-container-title:

Author:

Avin Chen¹,Lotker Zvi¹,Nahum Yinon²,Peleg David²

Affiliation:

1. Ben-Gurion University of the Negev, Be'er-Sheva, Israel

2. Weizmann Institute of Science, Rehovot, Israel

Funder

Israel Science Foundation

I-CORE program of the Israel PBC and ISF

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3341161.3342867

Reference19 articles.

1. Radio cover time in hyper-graphs

2. Chen Avin Zvi Lotker and David Peleg. Random preferential attachment hypergraphs. CoRR abs/1502.02401 2015. Chen Avin Zvi Lotker and David Peleg. Random preferential attachment hypergraphs. CoRR abs/1502.02401 2015.

3. Emergence of Scaling in Random Networks

4. Complex Graphs and Networks

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generating preferential attachment graphs via a Pólya urn with expanding colors;Network Science;2024-04-08

2. The simpliciality of higher-order networks;EPJ Data Science;2024-03-07

3. The Art of Active Listening;Proceedings of the International Conference on Advances in Social Networks Analysis and Mining;2023-11-06

4. Preferential Attachment Hypergraph with Vertex Deactivation;2023 31st International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS);2023-10-16

5. Neighborhood-Based Hypergraph Core Decomposition;Proceedings of the VLDB Endowment;2023-05