Ritesh Goenka

collaborators

4 papers

math.PR2026

Source localisation in simple random walks

Ritesh Goenka, Peter Keevash, Tomasz Przybyłowski

We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first $n$ steps. Conside…

math.PR2025

Cutoff for generalised Bernoulli-Laplace urn models

Ritesh Goenka, Jonathan Hermon, Dominik Schmid

We introduce a multi-colour multi-urn generalisation of the Bernoulli-Laplace urn model, consisting of $d$ urns, $m$ colours, and $d mn$ balls, with $d n$ balls of each colour and $m…

math.CO2025

On subsets of lattice cubes avoiding affine and spherical degeneracies

Anubhab Ghosal, Ritesh Goenka, Peter Keevash

For integers $1 < k < d - 1$ and $r \geq k + 2$ , we establish new lower bounds on the maximum number of points in $[n]^{d}$ such that no $r$ lie in a $k$ -dimensional affine (or linear) su…

math.CO2025

The maximum number of triangles in $K_{1, s, t}$ -free graphs

Asier Calbet, Ritesh Goenka

We consider the following generalized Turán problem: For $2 \leq s \leq t$ , what is the maximum number of triangles in a $K_{1, s, t}$ -free graph on $n$ vertices? The previously best k…

Source localisation in simple random walks

Cutoff for generalised Bernoulli-Laplace urn models

On subsets of lattice cubes avoiding affine and spherical degeneracies

The maximum number of triangles in K1,s,t​-free graphs

The maximum number of triangles in $K_{1, s, t}$ -free graphs