Alexander Moreira

4 citations · 4 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2021

On the Rank, Kernel, and Core of Sparse Random Graphs

Patrick DeMichele, Margalit Glasgow, Alexander Moreira

We study the rank of the adjacency matrix $A$ of a random Erdos Renyi graph $G \sim G (n, p)$ . It is well known that when $p = (lo g (n) - ω (1)) / n$ , with high probability, $A$ …

math.CO2019★ 4 cited

On the subgraph query problem

Ryan Alweiss, Chady Ben Hamida, Xiaoyu He +1

Given a fixed graph $H$ , a real number $p \in (0, 1)$ , and an infinite Erdős-Rényi graph $G \sim G (\infty, p)$ , how many adjacency queries do we have to make to find a copy of $H$ insid…