Saved in:
| Main Authors: | Gösgens, Martijn, Dreveton, Maximilien |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.01663 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Why the Metric Backbone Preserves Community Structure
by: Dreveton, Maximilien, et al.
Published: (2024)
by: Dreveton, Maximilien, et al.
Published: (2024)
When Does Bottom-up Beat Top-down in Hierarchical Community Detection?
by: Dreveton, Maximilien, et al.
Published: (2023)
by: Dreveton, Maximilien, et al.
Published: (2023)
Community Recovery on Noisy Stochastic Block Models
by: Anan, Washieu, et al.
Published: (2025)
by: Anan, Washieu, et al.
Published: (2025)
Exact Community Recovery in the Geometric SBM
by: Gaudio, Julia, et al.
Published: (2023)
by: Gaudio, Julia, et al.
Published: (2023)
Robust estimation of a Markov chain transition matrix from multiple sample paths
by: Leskelä, Lasse, et al.
Published: (2025)
by: Leskelä, Lasse, et al.
Published: (2025)
A Law of Large Numbers for SIR on the Stochastic Block Model: A Proof via Herd Immunity
by: Borgs, Christian, et al.
Published: (2024)
by: Borgs, Christian, et al.
Published: (2024)
Local Limits of Small World Networks
by: Alimohammadi, Yeganeh, et al.
Published: (2025)
by: Alimohammadi, Yeganeh, et al.
Published: (2025)
Statistical Analysis of Networks
by: Avrachenkov, Konstantin, et al.
Published: (2023)
by: Avrachenkov, Konstantin, et al.
Published: (2023)
Direct Paths in the Temporal Hypercube
by: Eide, Austin, et al.
Published: (2025)
by: Eide, Austin, et al.
Published: (2025)
Sharp exact recovery threshold for two-community Euclidean random graphs
by: Gaudio, Julia, et al.
Published: (2025)
by: Gaudio, Julia, et al.
Published: (2025)
Assortativity in geometric and scale-free networks
by: Kaufmann, Marc, et al.
Published: (2025)
by: Kaufmann, Marc, et al.
Published: (2025)
The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
by: Benjert, Zylan, et al.
Published: (2025)
by: Benjert, Zylan, et al.
Published: (2025)
A Phase Transition for Opinion Dynamics with Competing Biases
by: Capannoli, Federico, et al.
Published: (2025)
by: Capannoli, Federico, et al.
Published: (2025)
The Generalized Friendship Paradox for Spectral Centralities
by: Hazra, Rajat Subhra, et al.
Published: (2025)
by: Hazra, Rajat Subhra, et al.
Published: (2025)
Is this correct? Let's check!
by: Ben-Eliezer, Omri, et al.
Published: (2022)
by: Ben-Eliezer, Omri, et al.
Published: (2022)
Exact Label Recovery in Euclidean Random Graphs
by: Gaudio, Julia, et al.
Published: (2024)
by: Gaudio, Julia, et al.
Published: (2024)
Pólya Thresholds Graphs
by: Yu, Jinghan, et al.
Published: (2026)
by: Yu, Jinghan, et al.
Published: (2026)
Harnessing Multiple Correlated Networks for Exact Community Recovery
by: Rácz, Miklós Z., et al.
Published: (2024)
by: Rácz, Miklós Z., et al.
Published: (2024)
Recovering Fairness Directly from Modularity: a New Way for Fair Community Partitioning
by: Wang, Yufeng, et al.
Published: (2025)
by: Wang, Yufeng, et al.
Published: (2025)
Multi-Community Spectral Clustering for Geometric Graphs
by: Allem, Luiz Emilio, et al.
Published: (2025)
by: Allem, Luiz Emilio, et al.
Published: (2025)
LLY Ricci Reweighting in Stochastic Block Models: Uniform Curvature Concentration and Finite-Horizon Tracking
by: Kotharkar, Varun
Published: (2026)
by: Kotharkar, Varun
Published: (2026)
Balanced Bidirectional Breadth-First Search on Scale-Free Networks
by: Cerf, Sacha, et al.
Published: (2024)
by: Cerf, Sacha, et al.
Published: (2024)
Influence Maximization in Ising Models
by: Chen, Zongchen, et al.
Published: (2023)
by: Chen, Zongchen, et al.
Published: (2023)
The Spectral Barycentre of a Set of Graphs with Community Structure
by: Meyer, François G.
Published: (2025)
by: Meyer, François G.
Published: (2025)
Finding Super-spreaders in Network Cascades
by: Mossel, Elchanan, et al.
Published: (2024)
by: Mossel, Elchanan, et al.
Published: (2024)
Random geometric graphs with smooth kernels: sharp detection threshold and a spectral conjecture
by: Mao, Cheng, et al.
Published: (2026)
by: Mao, Cheng, et al.
Published: (2026)
Stationary distribution of node2vec random walks on household models
by: Schroeder, Lars, et al.
Published: (2025)
by: Schroeder, Lars, et al.
Published: (2025)
Statistics of leaves in growing random trees
by: Hartle, Harrison, et al.
Published: (2025)
by: Hartle, Harrison, et al.
Published: (2025)
Stochastic block models with many communities and the Kesten--Stigum bound
by: Chin, Byron, et al.
Published: (2025)
by: Chin, Byron, et al.
Published: (2025)
Limiting behaviour of Branching Processes and Online Social Networks
by: Agarwal, Khushboo
Published: (2024)
by: Agarwal, Khushboo
Published: (2024)
Correlated uniform attachment trees
by: Bäumler, Johannes, et al.
Published: (2026)
by: Bäumler, Johannes, et al.
Published: (2026)
Learning the mechanisms of network growth
by: Touwen, Lourens, et al.
Published: (2024)
by: Touwen, Lourens, et al.
Published: (2024)
Detecting hyperbolic geometry in networks: why triangles are not enough
by: Michielan, Riccardo, et al.
Published: (2022)
by: Michielan, Riccardo, et al.
Published: (2022)
Finding Super-spreaders in SIS Epidemics
by: Sridhar, Anirudh, et al.
Published: (2026)
by: Sridhar, Anirudh, et al.
Published: (2026)
Structural Measures of Resilience for Supply Chains
by: Papachristou, Marios, et al.
Published: (2023)
by: Papachristou, Marios, et al.
Published: (2023)
Degree-dependent and distance-dependent contact rates interpolate between explosive, exponential and polynomial epidemic growth
by: Benjert, Zylan, et al.
Published: (2026)
by: Benjert, Zylan, et al.
Published: (2026)
Bringing order to network centrality measures
by: Exarchakos, G., et al.
Published: (2026)
by: Exarchakos, G., et al.
Published: (2026)
Message-Passing on Hypergraphs: Detectability, Phase Transitions and Higher-Order Information
by: Ruggeri, Nicolò, et al.
Published: (2023)
by: Ruggeri, Nicolò, et al.
Published: (2023)
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)
by: Mossel, Elchanan, et al.
Published: (2024)
The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)
by: Lee, Daniel, et al.
Published: (2025)
Similar Items
-
Why the Metric Backbone Preserves Community Structure
by: Dreveton, Maximilien, et al.
Published: (2024) -
When Does Bottom-up Beat Top-down in Hierarchical Community Detection?
by: Dreveton, Maximilien, et al.
Published: (2023) -
Community Recovery on Noisy Stochastic Block Models
by: Anan, Washieu, et al.
Published: (2025) -
Exact Community Recovery in the Geometric SBM
by: Gaudio, Julia, et al.
Published: (2023) -
Robust estimation of a Markov chain transition matrix from multiple sample paths
by: Leskelä, Lasse, et al.
Published: (2025)