17 citations · 67 across the 24 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.PR2019★ 8 cited
Sampling random graph homomorphisms and applications to network data analysis
Hanbaek Lyu, Facundo Memoli, David Sivakoff
A graph homomorphism is a map between two graphs that preserves adjacency relations. We consider the problem of sampling a random graph homomorphism from a graph into a large netwo…
math.PR2019
Two-type annihilating systems on the complete and star graph
Irina Cristali, Yufeng Jiang, Matthew Junge +3
Red and blue particles are placed in equal proportion through-out either the complete or star graph and iteratively sampled to take simple random walk steps. Mutual annihilation oc…