Search Results for author:
Found 3 papers, 0 papers with code
A note on the capacity of the binary perceptron
Determining the capacity $\alpha_c$ of the Binary Perceptron is a long-standing problem.
Exact Matching of Random Graphs with Constant Correlation
Let $G$ and $G'$ be $G(n, p)$ Erd\H{o}s--R\'enyi graphs marginally, identified with their adjacency matrices.
Random Graph Matching with Improved Noise Robustness
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
