activity
20032026
most citedLarge graph limit for an SIR process in random network with heterogeneous connectivity

86 citations · 383 across the 61 of their papers we have counts for

collaborators
Showing 2007Show all

2 papers · 1 filter

math.PR2007

Upper bound of loss probability in an OFDMA system with randomly located users

Laurent Decreusefond, Eduardo Ferraz, Philippe Martins

For OFDMA systems, we find a rough but easily computed upper bound for the probability of loosing communications by insufficient number of sub-channels on downlink. We consider as…

math.PR2007

Rubinstein distance on configurations spaces

Laurent Decreusefond, Nicolas Savy

By a method inspired of the Stein's method, we derive an upper-bound of the Rubinstein distance between two absolutely continuous probability measures on configurations space. As a…