Skip to content
conftrace_

random graph

56 papers

Papers

A Phase Transition for Opinion Dynamics with Competing Biases AAAI 2026 Node Regression on Latent Position Random Graphs via Local Averaging JMLR 2026 Recovery of Planted Subgraphs COLT 2026 Statistical Inference of Random Graphs With a Surrogate Likelihood Function JMLR 2025 Valid Bootstraps for Network Embeddings with Applications to Network Visualisation UAI 2025 Convergence of Message-Passing Graph Neural Networks with Generic Aggregation on Large Random Graphs JMLR 2024 Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph: Extended Abstract COLT 2024 Low-degree phase transitions for detecting a planted clique in sublinear time COLT 2024 Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust NeurIPS 2024 A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks ICLR 2023 Complexity of Probabilistic Inference in Random Dichotomous Hedonic Games AAAI 2023 Contextual Stochastic Block Model: Sharp Thresholds and Contiguity JMLR 2023 Expectation-Complete Graph Representations with Homomorphisms ICML 2023 Sharp thresholds in inference of planted subgraphs COLT 2023 Synthetic Data Generation of Many-to-Many Datasets via Random Graph Generation ICLR 2023 What functions can Graph Neural Networks compute on random graphs? The role of Positional Encoding NeurIPS 2023 AgraSSt: Approximate Graph Stein Statistics for Interpretable Assessment of Implicit Graph Generators NeurIPS 2022 Community Recovery in the Degree-Heterogeneous Stochastic Block Model COLT 2022 Generalization Analysis of Message Passing Neural Networks on Large Random Graphs NeurIPS 2022 Robust Estimation for Random Graphs COLT 2022 Sparse Hypergraph Community Detection Thresholds in Stochastic Block Model NeurIPS 2022 Generalized Kings and Single-Elimination Winners in Random Tournaments IJCAI 2021 Iterative Connecting Probability Estimation for Networks NeurIPS 2021 Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites IJCAI 2021 Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm NeurIPS 2021