1 citations · 2 across the 2 of their papers we have counts for
4 papers
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…
Random Overlapping Communities: Approximating Motif Densities of Large Graphs
Samantha Petti, Santosh Vempala
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neig…
Balanced Allocation Through Random Walk
Alan Frieze, Samantha Petti
We consider the allocation problem in which items are to be allocated to bins with capacity . The items arrive sequentially and when…
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…