activity
20062021
most citedGuessing under source uncertainty

110 citations · 350 across the 44 of their papers we have counts for

collaborators
Showing math.PRShow all

7 papers · 1 filter

math.PR2021★ 1 cited

A sufficient condition for the quasipotential to be the rate function of the invariant measure of countable-state mean-field interacting particle systems

Sarath Yasodharan, Rajesh Sundaresan

This paper considers the family of invariant measures of Markovian mean-field interacting particle systems on a countably infinite state space and studies its large deviation asymp…

math.PR2020★ 1 cited

Large deviations of mean-field interacting particle systems in a fast varying environment

Sarath Yasodharan, Rajesh Sundaresan

This paper studies large deviations of a ``fully coupled" finite state mean-field interacting particle system in a fast varying environment. The empirical measure of the particles…

math.PR2020

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…

math.PR2019

Large Time Behaviour and the Second Eigenvalue Problem for Finite State Mean-Field Interacting Particle Systems

Sarath Yasodharan, Rajesh Sundaresan

This article examines large time behaviour of finite state mean-field interacting particle systems. Our first main result is a sharp estimate (in the exponential scale) on the time…

math.PR2018

Simultaneous Small Noise Limit for Singularly Perturbed Slow-Fast Coupled Diffusions

Siva R. Athreya, Vivek S. Borkar, K. Suresh Kumar +1

We consider a simultaneous small noise limit for a singularly perturbed coupled diffusion described by \begin{eqnarray*} dX^{\varepsilon}_t &=& b(X^{\varepsilon}_t, Y^{\varepsilon}…

math.PR2012★ 7 cited

Belief propagation for optimal edge cover in the random complete graph

Mustafa Khandwawala, Rajesh Sundaresan

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs.…