Sayan Banerjee
YOU?
Author Swipe
View article: Network Evolution With Mesoscopic Delays
Network Evolution With Mesoscopic Delays Open
Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements…
View article: Strong existence, pathwise uniqueness and chains of collisions in infinite Brownian particle systems
Strong existence, pathwise uniqueness and chains of collisions in infinite Brownian particle systems Open
We study strong existence and pathwise uniqueness for a class of infinite-dimensional singular stochastic differential equations (SDE), with state space as the cone $\{x \in \mathbb{R}^{\mathbb{N}}: -\infty < x_1 \leq x_2 \leq \cdots\}$, r…
View article: D2C-WEBCRED
D2C-WEBCRED Open
Despite the fact that product and purchase related information on websites are one of the predominant factors in consumers’ decision-making processes to choose the right product, there exists limited research studies that assess the reliab…
View article: Dissipation-enhanced non-reciprocal superconductivity: application to multi-valley superconductors
Dissipation-enhanced non-reciprocal superconductivity: application to multi-valley superconductors Open
We here propose and study theoretically a non-equilibrium mechanism for the superconducting diode effect, which applies specifically to the case where time-reversal-symmetry -- a prerequisite for the diode effect -- is spontaneously broken…
View article: Network evolution with mesoscopic delay
Network evolution with mesoscopic delay Open
Owing to the influence of real-world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements…
View article: Improved Finite-Particle Convergence Rates for Stein Variational Gradient Descent
Improved Finite-Particle Convergence Rates for Stein Variational Gradient Descent Open
We provide finite-particle convergence rates for the Stein Variational Gradient Descent (SVGD) algorithm in the Kernelized Stein Discrepancy ($\mathsf{KSD}$) and Wasserstein-2 metrics. Our key insight is that the time derivative of the rel…
View article: Network evolution with Macroscopic Delays: asymptotics and condensation
Network evolution with Macroscopic Delays: asymptotics and condensation Open
Driven by the explosion of data and the impact of real-world networks, a wide array of mathematical models have been proposed to understand the structure and evolution of such systems, especially in the temporal context. Recent advances in…
View article: Transforming Food Systems
Transforming Food Systems Open
This study explores the use of digital technologies by food supply chain firms to enhance circular practices, aiming to boost the social, economic, and environmental sustainability of food supply chains. The literature on digital technolog…
View article: Sayan Banerjee’s contribution to the Discussion of “Root and community inference on the latent growth process of a network” by Crane and Xu
Sayan Banerjee’s contribution to the Discussion of “Root and community inference on the latent growth process of a network” by Crane and Xu Open
Sayan Banerjee’s contribution to the Discussion of “Root and community inference on the latent growth process of a network” by Harry Crane and Min Xu Sayan Banerjee University of North Carolina, Chapel Hill [email protected] I congratula…
View article: Sayan Banerjee’s contribution to the Discussion of ‘Root and community inference on the latent growth process of a network’ by Crane and Xu
Sayan Banerjee’s contribution to the Discussion of ‘Root and community inference on the latent growth process of a network’ by Crane and Xu Open
View article: Flocking under Fast and Large Jumps: Stability, Chaos, and Traveling Waves
Flocking under Fast and Large Jumps: Stability, Chaos, and Traveling Waves Open
We study a model for flocking given by a $n$-particle system under which each particle jumps forward by a random amount, independently sampled from a given distribution $θ$, with rate given by a non-increasing function $w$ of its signed di…
View article: Local weak convergence and its applications
Local weak convergence and its applications Open
Motivated in part by understanding average case analysis of fundamental algorithms in computer science, and in part by the wide array of network data available over the last decade, a variety of random graph models, with corresponding proc…
View article: Fluctuations of the Atlas model from inhomogeneous stationary profiles
Fluctuations of the Atlas model from inhomogeneous stationary profiles Open
The infinite Atlas model describes the evolution of a countable collection of Brownian particles on the real line, where the lowest particle is given a drift of $γ\in [0,\infty)$. We study equilibrium fluctuations for the Atlas model when …
View article: An Insight into the Computation of Performance Metrics and Ranking of Mutual Funds with Respect to an Indian Small Cap Equity Scheme
An Insight into the Computation of Performance Metrics and Ranking of Mutual Funds with Respect to an Indian Small Cap Equity Scheme Open
Due to relentless efforts of the sub brokers, corporate distributors, Asset Management Companies (AMCs) and also the commercial banks, mutual funds have emerged as the most sought after and lucrative alternative investment vehicle in India…
View article: Learning attribute and homophily measures through random walks
Learning attribute and homophily measures through random walks Open
We investigate the statistical learning of nodal attribute functionals in homophily networks using random walks. Attributes can be discrete or continuous. A generalization of various existing canonical models, based on preferential attachm…
View article: Attribute network models, stochastic approximation, and network sampling and ranking algorithms
Attribute network models, stochastic approximation, and network sampling and ranking algorithms Open
We analyze dynamic random network models where younger vertices connect to older ones with probabilities proportional to their degrees as well as a propensity kernel governed by their attribute types. Using stochastic approximation techniq…
View article: Enhanced Superconducting Diode Effect due to coexisting Phases
Enhanced Superconducting Diode Effect due to coexisting Phases Open
The superconducting diode effect refers to an asymmetry in the critical supercurrent $J_c(\hat{n})$ along opposite directions, $J_c(\hat{n})\neq J_c(-\hat{n})$. While the basic symmetry requirements for this effect are known, it is, for ju…
View article: PageRank Nibble on the sparse directed stochastic block model
PageRank Nibble on the sparse directed stochastic block model Open
We present new results on community recovery based on the PageRank Nibble algorithm on a sparse directed stochastic block model (dSBM). Our results are based on a characterization of the local weak limit of the dSBM and the limiting PageRa…
View article: Load Balancing in Parallel Queues and Rank-based Diffusions
Load Balancing in Parallel Queues and Rank-based Diffusions Open
Consider a system with $K$ parallel queues in which the server for each queue processes jobs at rate $n$ and the total arrival rate to the system is $nK-\upsilon \sqrt{n}$ where $\upsilon \in (0, \infty)$ and $n$ is large. We study rank-ba…
View article: Local weak limits for collapsed branching processes with random out-degrees
Local weak limits for collapsed branching processes with random out-degrees Open
We obtain local weak limits in probability for Collapsed Branching Processes (CBP), which are directed random networks obtained by collapsing random-sized families of individuals in a general continuous-time branching process. The local we…
View article: Degree centrality and root finding in growing random networks
Degree centrality and root finding in growing random networks Open
We consider growing random networks {Gn}n≥1 where, at each time, a new vertex attaches itself to a collection of existing vertices via a fixed number m≥1 of edges, with probability proportional to a function f (called attachment function) …
View article: Long Time Behavior of Finite and Infinite Dimensional Reflected Brownian Motions
Long Time Behavior of Finite and Infinite Dimensional Reflected Brownian Motions Open
This article presents a review of some old and new results on the long time behavior of reflected diffusions. First, we present a summary of prior results on construction, ergodicity and geometric ergodicity of reflected diffusions in the …
View article: Extremal Invariant Distributions of Infinite Brownian Particle Systems with Rank Dependent Drifts
Extremal Invariant Distributions of Infinite Brownian Particle Systems with Rank Dependent Drifts Open
\noindent Consider an infinite collection of particles on the real line moving according to independent Brownian motions and such that the $i$-th particle from the left gets the drift $g_{i-1}$. The case where $g_0=1$ and $g_{i}=0$ for all…
View article: Anomalous Fano factor as a signature of Bogoliubov Fermi surfaces
Anomalous Fano factor as a signature of Bogoliubov Fermi surfaces Open
Noise spectroscopy is a key technique to investigate the nature and dynamics of charge carriers in superconductors. The recently discovered superconducting hybrids with Bogoliubov Fermi surfaces exhibit a particularly intriguing and rich c…
View article: Co-evolving dynamic networks
Co-evolving dynamic networks Open
We propose a general class of co-evolving tree network models driven by local exploration where new vertices attach to the current network via randomly sampling a vertex and then exploring the graph for a random number of steps in the dire…
View article: Persistence of hubs in growing random networks
Persistence of hubs in growing random networks Open
View article: Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window
Many-server asymptotics for Join-the-Shortest Queue in the Super-Halfin-Whitt Scaling Window Open
The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server queueing systems due to its strong optimality properties. While the exact analysis of the JSQ policy is an open question to date, even und…
View article: Degree centrality and root finding in growing random networks
Degree centrality and root finding in growing random networks Open
We consider growing random networks $\{\mathcal G_n\}_{n \ge 1}$ where, at each time, a new vertex attaches itself to a collection of existing vertices via a fixed number $m \ge 1$ of edges, with probability proportional to an attachment f…
View article: Rates of convergence to equilibrium for potlatch and smoothing processes
Rates of convergence to equilibrium for potlatch and smoothing processes Open
We analyze the local and global smoothing rates of the smoothing process and obtain convergence rates to stationarity for the dual process known as the potlatch process. For general finite graphs, we connect the smoothing and convergence r…
View article: Domains of attraction of invariant distributions of the infinite Atlas model
Domains of attraction of invariant distributions of the infinite Atlas model Open
The infinite Atlas model describes a countable system of competing Brownian particles where the lowest particle gets a unit upward drift and the rest evolve as standard Brownian motions. The stochastic process of gaps between the particles…