30 citations · 75 across the 31 of their papers we have counts for
5 papers · 1 filter
Connectivity of a Family of Bilateral Agreement Random Graphs
Hossein Dabirian, Vijay Subramanian
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with vertices in this model uses a (rand…
The Erlang Weighted Tree, A New Branching Process
Mehrdad Moharrami, Vijay Subramanian, Mingyan Liu +1
In this paper, we study a new discrete tree and the resulting branching process, which we call the \textbf{E}rlang \textbf{W}eighted \textbf{T}ree(\textbf{EWT}). The EWT appears as…
Derandomized Load Balancing using Random Walks on Expander Graphs
Dengwang Tang, Vijay G. Subramanian
In a computing center with a huge amount of machines, when a job arrives, a dispatcher need to decide which machine to route this job to based on limited information. A classical m…
Balanced Allocation with Random Walk Based Sampling
Dengwang Tang, Vijay G. Subramanian
In the standard ball-in-bins experiment, a well-known scheme is to sample bins independently and uniformly at random and put the ball into the least loaded bin. It can be shown…
Impact of Community Structure on Cascades
Mehrdad Moharrami, Vijay Subramanian, Mingyan Liu +1
We study cascades under the threshold model on sparse random graphs with community structure. In this model, individuals adopt the new behavior based on how many neighbors have alr…