2 citations · 4 across the 10 of their papers we have counts for
5 papers · 1 filter
Algorithms Using Local Graph Features to Predict Epidemics
Yeganeh Alimohammadi, Christian Borgs, Amin Saberi
We study a simple model of epidemics where an infected node transmits the infection to its neighbors independently with probability . This is also known as the independent casca…
Sequential importance sampling for estimating expectations over the space of perfect matchings
Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani +1
This paper makes three contributions to estimating the number of perfect matching in bipartite graphs. First, we prove that the popular sequential importance sampling algorithm wor…
The Value of Excess Supply in Spatial Matching Markets
Mohammad Akbarpour, Yeganeh Alimohammadi, Shengwu Li +1
We study dynamic matching in a spatial setting. Drivers are distributed at random on some interval. Riders arrive in some (possibly adversarial) order at randomly drawn points. The…
Locality of Random Digraphs on Expanders
Yeganeh Alimohammadi, Christian Borgs, Amin Saberi
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant str…
Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More
Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur +1
We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar,…