Saved in:
| Main Authors: | Marenco, Bernardo, Bermolen, Paola, Fiori, Marcelo, Larroca, Federico, Mateos, Gonzalo |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.03649 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Unified Framework of Hyperbolic Graph Representation Learning Methods
by: Casulo, Sofía Pérez, et al.
Published: (2026)
by: Casulo, Sofía Pérez, et al.
Published: (2026)
LASE: Learned Adjacency Spectral Embeddings
by: Casulo, Sofía Pérez, et al.
Published: (2024)
by: Casulo, Sofía Pérez, et al.
Published: (2024)
Efficiency of Parallel and Restart Exploration Strategies in Model Free Stochastic Simulations
by: Garcia, Ernesto, et al.
Published: (2025)
by: Garcia, Ernesto, et al.
Published: (2025)
Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025)
by: Elimelech, Dor, et al.
Published: (2025)
GNNs for Time Series Anomaly Detection: An Open-Source Framework and a Critical Evaluation
by: Bello, Federico, et al.
Published: (2026)
by: Bello, Federico, et al.
Published: (2026)
Graph Contrastive Learning for Connectome Classification
by: Schmidt, Martín, et al.
Published: (2025)
by: Schmidt, Martín, et al.
Published: (2025)
Spectral Structure in Finite Free Information Inequalities and $p$-Stam Phase Transitions
by: Hashemi, Baran
Published: (2026)
by: Hashemi, Baran
Published: (2026)
Holographic functions and neural networks
by: Szegedy, Balazs
Published: (2026)
by: Szegedy, Balazs
Published: (2026)
Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
by: da Cunha, Arthur, et al.
Published: (2023)
by: da Cunha, Arthur, et al.
Published: (2023)
A Note on Asynchronous Challenges: Unveiling Formulaic Bias and Data Loss in the Hayashi-Yoshida Estimator
by: Georgiadis, Evangelos
Published: (2024)
by: Georgiadis, Evangelos
Published: (2024)
Sparse random hypergraphs: Non-backtracking spectra and community detection
by: Stephan, Ludovic, et al.
Published: (2022)
by: Stephan, Ludovic, et al.
Published: (2022)
Complete Causal Identification from Ancestral Graphs under Selection Bias
by: Chen, Leihao, et al.
Published: (2026)
by: Chen, Leihao, et al.
Published: (2026)
Intensity Dot Product Graphs
by: Riva, Giulio Valentino Dalla, et al.
Published: (2026)
by: Riva, Giulio Valentino Dalla, et al.
Published: (2026)
The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
by: Dhawan, Abhishek, et al.
Published: (2024)
by: Dhawan, Abhishek, et al.
Published: (2024)
Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
by: Li, Rupert, et al.
Published: (2025)
by: Li, Rupert, et al.
Published: (2025)
Community detection with the Bethe-Hessian
by: Stephan, Ludovic, et al.
Published: (2024)
by: Stephan, Ludovic, et al.
Published: (2024)
Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model
by: Fernandez V, Manuel, et al.
Published: (2026)
by: Fernandez V, Manuel, et al.
Published: (2026)
Resilience of Rademacher chaos of low degree
by: Aigner-Horev, Elad, et al.
Published: (2024)
by: Aigner-Horev, Elad, et al.
Published: (2024)
On the Color Discrepancy of Spanning Trees in Random and Randomly Perturbed Graphs
by: Chen, Wenchong, et al.
Published: (2025)
by: Chen, Wenchong, et al.
Published: (2025)
Average Jaccard Index of Random Graphs
by: Feng, Qunqiang, et al.
Published: (2023)
by: Feng, Qunqiang, et al.
Published: (2023)
Dirac-type Theorems for Inhomogenous Random Graphs
by: Ganesan, Ghurumuruhan
Published: (2024)
by: Ganesan, Ghurumuruhan
Published: (2024)
A Jump of the Saturation Number in Random Graphs?
by: Diskin, Sahar, et al.
Published: (2023)
by: Diskin, Sahar, et al.
Published: (2023)
Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)
by: Marcussen, Cassandra, et al.
Published: (2025)
Limit Laws for the Distance to Fréchet Means of Random Graphs
by: Feng, Qunqiang, et al.
Published: (2026)
by: Feng, Qunqiang, et al.
Published: (2026)
Minimum Number of Monochromatic Subgraphs of a Random Graph
by: Dandi, Yatin, et al.
Published: (2026)
by: Dandi, Yatin, et al.
Published: (2026)
Connectivity of a Family of Bilateral Agreement Random Graphs
by: Dabirian, Hossein, et al.
Published: (2022)
by: Dabirian, Hossein, et al.
Published: (2022)
The Erdős-Rényi Random Graph Conditioned on Every Component Being a Clique
by: Gösgens, Martijn, et al.
Published: (2024)
by: Gösgens, Martijn, et al.
Published: (2024)
Perfect t-Embeddings of Uniformly Weighted Generalized Tower Graphs
by: Keating, David, et al.
Published: (2025)
by: Keating, David, et al.
Published: (2025)
Perfect Matching in Product Graphs and in their Random Subgraphs
by: Diskin, Sahar, et al.
Published: (2024)
by: Diskin, Sahar, et al.
Published: (2024)
On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)
by: Chinyaev, Boris
Published: (2025)
Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph $G(n,m)$: The Lower Tail
by: Alvarado, José, et al.
Published: (2024)
by: Alvarado, José, et al.
Published: (2024)
Guarantees for Spontaneous Synchronization on Random Geometric Graphs
by: Abdalla, Pedro, et al.
Published: (2022)
by: Abdalla, Pedro, et al.
Published: (2022)
Limits of Weighted Graphs via Random Quotients
by: Levin, Eitan, et al.
Published: (2025)
by: Levin, Eitan, et al.
Published: (2025)
Evolution of discordant edges in the voter model on random sparse digraphs
by: Capannoli, Federico
Published: (2024)
by: Capannoli, Federico
Published: (2024)
Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
by: Kunisky, Dmitriy
Published: (2024)
by: Kunisky, Dmitriy
Published: (2024)
Maximal Entropy Random Walks in Z: Random and non-random environments
by: Thibaut, Duboux, et al.
Published: (2025)
by: Thibaut, Duboux, et al.
Published: (2025)
Saturation in Random Hypergraphs
by: Diskin, Sahar, et al.
Published: (2024)
by: Diskin, Sahar, et al.
Published: (2024)
Burning Random Trees
by: Devroye, Luc, et al.
Published: (2024)
by: Devroye, Luc, et al.
Published: (2024)
Detection and Reconstruction of a Random Hypergraph from Noisy Graph Projection
by: Gong, Shuyang, et al.
Published: (2025)
by: Gong, Shuyang, et al.
Published: (2025)
Reconstructing the Geometry of Random Geometric Graphs
by: Huang, Han, et al.
Published: (2024)
by: Huang, Han, et al.
Published: (2024)
Similar Items
-
A Unified Framework of Hyperbolic Graph Representation Learning Methods
by: Casulo, Sofía Pérez, et al.
Published: (2026) -
LASE: Learned Adjacency Spectral Embeddings
by: Casulo, Sofía Pérez, et al.
Published: (2024) -
Efficiency of Parallel and Restart Exploration Strategies in Model Free Stochastic Simulations
by: Garcia, Ernesto, et al.
Published: (2025) -
Detecting Arbitrary Planted Subgraphs in Random Graphs
by: Elimelech, Dor, et al.
Published: (2025) -
GNNs for Time Series Anomaly Detection: An Open-Source Framework and a Critical Evaluation
by: Bello, Federico, et al.
Published: (2026)