3 citations · 11 across the 8 of their papers we have counts for
4 papers · 1 filter
Thresholds in random motif graphs
Michael Anastos, Peleg Michaeli, Samantha Petti
We introduce a natural generalization of the Erdős-Rényi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H…
Approximating Sparse Graphs: The Random Overlapping Communities Model
Samantha Petti, Santosh S. Vempala
How can we approximate sparse graphs and sequences of sparse graphs (with unbounded average degree)? We consider convergence in the first moments of the graph spectrum (equival…
The covertime of a biased random walk on
Colin Cooper, Alan Frieze, Samantha Petti
We analyze the covertime of a biased random walk on the random graph . The walk is biased towards visiting vertices of low degree and this makes the covertime less than in…
A Space of Phylogenetic Networks
Satyan L. Devadoss, Samantha Petti
A classic problem in computational biology is constructing a phylogenetic tree given a set of distances between n species. In most cases, a tree structure is too constraining. We c…