activity
20172026
most citedA note on the folklore of free independence

3 citations · 5 across the 9 of their papers we have counts for

collaborators

14 papers

math.PR2026

On the Properties of a Bernoulli--Uniform Boolean Convolution Family

Sukrit Chakraborty

We introduce and study a one-parameter family of probability measures defined by the Boolean additive convolution , where is the symmetric…

math.AC2026

Ideal Zero-Product Probability in Finite Commutative Rings

Sukrit Chakraborty, Sourav Kanti Patra

We introduce the \emph{ideal zero-product probability}, a new probabilistic invariant associated with a finite commutative ring , defined by \[ ζ_k(R) = \frac{ |\{(I_1,\ldots,I_…

math.CO2025

Random Finite Sumsets and Product Sets in Subsets of the Natural Numbers

Sukrit Chakraborty, Sayan Goswami, Sourav Kanti Patra

We investigate the occurrence of additive and multiplicative structures in random subsets of the natural numbers. Specifically, for a Bernoulli random subset of where…

math.CO2025

The Moore Bound for Regular Simplicial Complexes

Sukrit Chakraborty

We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.

cs.DM2025

Shortest Paths in a Weighted Simplicial Complex

Sukrit Chakraborty, Prasanta Choudhury, Arindam Mukherjee

Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical dist…

math.CO2022

Shotgun Assembly of Linial-Meshulam Model

Kartick Adhikari, Sukrit Chakraborty

In a recent paper [6], J. Gaudio and E. Mossel studied the shotgun assembly of the Erdős-Rényi graph with , and showed that the graph is reconstruct…

math.PR2022★ 2 cited

Shotgun Assembly of Random Geometric Graphs

Kartick Adhikari, Sukrit Chakraborty

In a recent work, Huang and Tikhomirov considered the shotgun assembly for Erd\H os-Rényi graphs with , and showed that the graph is reconstructable…

math.PR2021

Length of stationary Gaussian excursions

Arijit Chakrabarty, Manish Pandey, Sukrit Chakraborty

Given that a stationary Gaussian process is above a high threshold, the length of time it spends before going below that threshold is studied. The asymptotic order is determined by…

math.PR2019

Eigenvalues outside the bulk of inhomogeneous Erdős-Rënyi random graphs

Arijit Chakrabarty, Sukrit Chakraborty, Rajat Subhra Hazra

The article considers an inhomogeneous Erdős-Rënyi random graph on , where an edge is placed between vertices and with probability $\varepsilon_N f(i/N,j/N…

math.PR2018

Regular variation and free regular infinitely divisible laws

Arijit Chakrabarty, Sukrit Chakraborty, Rajat Subhra Hazra

In this article the relation between the tail behaviours of a free regular infinitely divisible (positively supported) probability measure and its Lévy measure is studied. An impor…

math.CO2018

Infinite image partition regular matrices - Solution in C-sets

Sukrit Chakraborty, Sourav Kanti Patra

A finite or infinite matrix is image partition regular provided that whenever is finitely colored, there must be some with entries from…

math.GN2018

C-image partition regularity near zero

Sourav Kanti Patra, Sukrit Chakraborty

In \cite{dehind1}, the concept of image partition regularity near zero was first instigated. In contrast to the finite case , infinite image partition regular matrices near zero ar…

math.PR2018★ 3 cited

A note on the folklore of free independence

Arijit Chakrabarty, Sukrit Chakraborty, Rajat Subhra Hazra

It is shown that a Wishart matrix of standard complex normal random variables is asymptotically freely independent of an independent random matrix, under minimal conditions, in two…

math.PR2017

Boolean convolutions and regular variation

Sukrit Chakraborty, Rajat Subhra Hazra

In this article we study the influence of regularly varying probability measures on additive and multiplicative Boolean convolutions. We introduce the notion of Boolean subexponent…