2 citations · 5 across the 7 of their papers we have counts for
6 papers · 1 filter
Small noise limits of Markov chains and the PageRank
Vivek S Borkar, S Sowmya, Raghavendra Tripathi
We recall the classical formulation of PageRank as the stationary distribution of a singularly perturbed irreducible Markov chain that is not irreducible when the perturbation para…
Path convergence of Markov chains on large graphs
Siva Athreya, Soumik Pal, Raghav Somani +1
We consider two classes of natural stochastic processes on finite unlabeled graphs. These are Euclidean stochastic optimization algorithms on the adjacency matrix of weighted graph…
Central limit theorem in complete feedback games
Andrea Ottolini, Raghavendra Tripathi
Consider a well-shuffled deck of cards of different types where each type occurs times. In a complete feedback game, a player is asked to guess the top card from the deck.…
Stochastic optimization on matrices and a graphon McKean-Vlasov limit
Zaid Harchaoui, Sewoong Oh, Soumik Pal +2
We consider stochastic gradient descents on the space of large symmetric matrices of suitable functions that are invariant under permuting the rows and columns using the same permu…
Gradient flows on graphons: existence, convergence, continuity equations
Sewoong Oh, Soumik Pal, Raghav Somani +1
Wasserstein gradient flows on probability measures have found a host of applications in various optimization problems. They typically arise as the continuum limit of exchangeable p…
Determinantal Processes and Stochastic Domination
Raghavendra Tripathi
We prove the stochastic domination for determinantal processes associated with finite rank projection kernels. The result was first proved by Lyons in discrete setting. We avoid th…