:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ben-Eliezer, Omri, Mikulincer, Dan, Mossel, Elchanan, Sudan, Madhu
Format:	Preprint
Published:	2022
Subjects:	Social and Information Networks Probability
Online Access:	https://arxiv.org/abs/2211.12301
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)

Errors are Robustly Tamed in Cumulative Knowledge Processes
by: Brandenberger, Anna, et al.
Published: (2023)

Finding Super-spreaders in Network Cascades
by: Mossel, Elchanan, et al.
Published: (2024)

Influence Maximization in Ising Models
by: Chen, Zongchen, 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)

Stochastic block models with many communities and the Kesten--Stigum bound
by: Chin, Byron, et al.
Published: (2025)

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees
by: Mossel, Elchanan, et al.
Published: (2022)

Gaussian Broadcast on Grids
by: Jiradilok, Pakawut, et al.
Published: (2024)

Low Degree Hardness for Broadcasting on Trees
by: Huang, Han, et al.
Published: (2024)

Optimal Low degree hardness for Broadcasting on Trees
by: Huang, Han, et al.
Published: (2025)

Two Agents, One Prompt, and Your Weight
by: Mossel, Elchanan, et al.
Published: (2025)

Some Theoretical Limitations of t-SNE
by: Li, Rupert, et al.
Published: (2026)

Detecting Mutual Excitations in Non-Stationary Hawkes Processes
by: Mossel, Elchanan, et al.
Published: (2026)

The Benefits of Temporal Correlations: SGD Learns k-Juntas from Random Walks Efficiently
by: Cornacchia, Elisabetta, et al.
Published: (2026)

Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions
by: Cornacchia, Elisabetta, et al.
Published: (2025)

On Algorithmic Robustness of Corrupted Markov Chains
by: Gaitonde, Jason, et al.
Published: (2025)

Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics
by: Gaitonde, Jason, et al.
Published: (2024)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
by: Li, Rupert, et al.
Published: (2025)

Communication with Imperfectly Shared Randomness
by: Canonne, Clément L., et al.
Published: (2014)

Multiplayer Games of War
by: Adjei, Axel, et al.
Published: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

Degree-corrected distribution-free model for community detection in weighted networks
by: Qing, Huan
Published: (2021)

Sharp exact recovery threshold for two-community Euclidean random graphs
by: Gaudio, Julia, et al.
Published: (2025)

Assortativity in geometric and scale-free networks
by: Kaufmann, Marc, et al.
Published: (2025)

The Diameter of (Threshold) Geometric Inhomogeneous Random Graphs
by: Benjert, Zylan, et al.
Published: (2025)

Recovering Small Communities in the Planted Partition Model
by: Gösgens, Martijn, et al.
Published: (2025)

A Phase Transition for Opinion Dynamics with Competing Biases
by: Capannoli, Federico, et al.
Published: (2025)

Community Recovery on Noisy Stochastic Block Models
by: Anan, Washieu, et al.
Published: (2025)

The Generalized Friendship Paradox for Spectral Centralities
by: Hazra, Rajat Subhra, 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)

Exact Label Recovery in Euclidean Random Graphs
by: Gaudio, Julia, et al.
Published: (2024)

Detecting Abrupt Changes in Point Processes: Fundamental Limits and Applications
by: Brandenberger, Anna, et al.
Published: (2025)

Denoising distances beyond the volumetric barrier
by: Huang, Han, et al.
Published: (2026)

Reconstructing the Geometry of Random Geometric Graphs
by: Huang, Han, et al.
Published: (2024)

Finding the Root in Random Nearest Neighbor Trees
by: Anna Brandenberger, et al.
Published: (2026)

Pólya Thresholds Graphs
by: Yu, Jinghan, et al.
Published: (2026)

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
by: Gamarnik, David, et al.
Published: (2023)

Monotonicity, Topology, and Convexity of Recurrence in Random Walks
by: Li, Rupert, et al.
Published: (2024)

Balanced Bidirectional Breadth-First Search on Scale-Free Networks
by: Cerf, Sacha, et al.
Published: (2024)

Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)