activity
20132026
most citedGradient Estimation with Simultaneous Perturbation and Compressive Sensing

4 citations · 6 across the 8 of their papers we have counts for

collaborators
Showing math.PRShow all

5 papers · 1 filter

math.PR2026

Opinion Dynamics with Memory Loss and Communication Delays

Somya Singh, Sharayu Moharir, Neeraja Sahasrabudhe

We propose a novel framework for modeling binary opinions (0 or 1) of individuals connected through a weighted directed network, where edge weights quantify interpersonal influence…

math.PR2026

Tampered Memory Elephant Random Walk on One-Dimensional Integer Lattice

Vinita Mulay, Neeraja Sahasrabudhe, Debleena Thacker

One of the outstanding questions in the theory of elephant random walks as observed by Gut and Stadtmüller (2023), is to determine how much memory is needed for a phase transition…

math.PR2023★ 1 cited

Interacting Urns on Directed Networks with Node-Dependent Sampling and Reinforcement

Gursharn Kaur, Neeraja Sahasrabudhe

We consider interacting urns on a finite directed network, where both sampling and reinforcement processes depend on the nodes of the network. This extends previous research by inc…

math.PR2023★ 1 cited

Urns with Multiple Drawings and Graph-Based Interaction

Yogesh Dahiya, Neeraja Sahasrabudhe

Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that…

math.PR2019

Interacting Urns on a Finite Directed Graph

Gursharn Kaur, Neeraja Sahasrabudhe

We introduce a general two colour interacting urn model on a finite directed graph, where each urn at a node, reinforces all the urns in its out-neighbours according to a fixed, no…