6 citations · 11 across the 17 of their papers we have counts for
10 papers · 1 filter
Online Edge Coloring via Tree Recurrences and Correlation Decay
Janardhan Kulkarni, Yang P. Liu, Ashwin Sah +2
We give an online algorithm that with high probability computes a edge coloring on a graph with maximum degree under online…
Note on random Latin squares and the triangle removal process
Matthew Kwan, Ashwin Sah, Mehtaab Sawhney
This is a companion note to the paper "Almost all Steiner triple systems have perfect matchings (arXiv:1611.02246). That paper contains several general lemmas about random Steiner…
Approximate counting and sampling via local central limit theorems
Vishesh Jain, Will Perkins, Ashwin Sah +1
We give an FPTAS for computing the number of matchings of size in a graph of maximum degree on vertices, for all , where is fixed and $m^*(…
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Asaf Ferber, Vishesh Jain, Ashwin Sah +1
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric -matrix is irreducible. This addr…
Friendly bisections of random graphs
Asaf Ferber, Matthew Kwan, Bhargav Narayanan +2
Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph admits a friendly bisection of its vertex set, i.e., a partition of its…
Majority Dynamics: The Power of One
Ashwin Sah, Mehtaab Sawhney
Consider individuals, where , with individuals holding an opinion and holding an opinion . Suppose that the individuals communicate via an u…