22 citations · 106 across the 24 of their papers we have counts for
6 papers · 1 filter
Freezing in the Infinite-Bin Model
Bastien Mallein, Sanjay Ramassamy, Arvind Singh
The infinite-bin model is a one-dimensional particle system on introduced by Foss and Konstantopoulos in relation with last passage percolation on complete directed ac…
Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
Sergey Foss, Takis Konstantopoulos, Bastien Mallein +1
We consider directed random graphs, the prototype of which being the Barak-Erdős graph , and study the way that long (or heavy, if weights are present) paths…
Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation
Sergey Foss, Takis Konstantopoulos, Bastien Mallein +1
Our object of study is the asymptotic growth of heaviest paths in a charged (weighted with signed weights) complete directed acyclic graph. Edge charges are i.i.d. random variables…
Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
Bastien Mallein, Sanjay Ramassamy
In this article, we prove that for any probability distribution on one can construct a two-sided stationary version of the infinite-bin model (an interacting parti…
The Hilbert-Galton board
Arvind Ayyer, Sanjay Ramassamy
We introduce the Hilbert-Galton board as a variant of the classical Galton board. Balls fall into a row of bins at a rate depending on the bin, and at random times, each bin gets s…
Barak-Erdős graphs and the infinite-bin model
Bastien Mallein, Sanjay Ramassamy
A Barak-Erdős graph is a directed acyclic version of the Erdős-Rényi random graph. It is obtained by performing independent bond percolation with parameter on the complete grap…