activity
20062013
most citedLearning Multiple Belief Propagation Fixed Points for Real Time Inference

12 citations · 56 across the 15 of their papers we have counts for

collaborators
Showing math.PRShow all

10 papers · 1 filter

math.PR2013★ 3 cited

Using Latent Binary Variables for Online Reconstruction of Large Scale Systems

Victorin Martin, Jean-Marc Lasgouttes, Cyril Furtlehner

We propose a probabilistic graphical model realizing a minimal encoding of real variables dependencies based on possibly incomplete observation and an empirical cumulative distribu…

math.PR2012

Modeling a Case of Herding Behavior in a Multi-Player Game

Guy Fayolle, Jean-Marc Lasgouttes

The system mentioned in the title belongs to the family of the so-called massively multi-player online social games (MMOSG). It features a scoring system for the elements of the ga…

math.PR2012★ 3 cited

Waiting time asymptotics in the single server queue with service in random order

Onno Boxma, Sergey Foss, Jean-Marc Lasgouttes +1

We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting…

math.PR2012★ 3 cited

Birth and death processes on certain random trees: Classification and stationary laws

Guy Fayolle, Maxim Krikun, Jean-Marc Lasgouttes

The main substance of the paper concerns the growth rate and the classification (ergodicity, transience) of a family of random trees. In the basic model, new edges appear according…

math.PR2012★ 1 cited

Best-effort networks: modeling and performance analysis via large networks asymptotics

Guy Fayolle, Arnaud De La Fortelle, Jean-Marc Lasgouttes +2

In this paper we introduce a class of Markov models, termed best-effort networks, designed to capture performance indices such as mean transfer times in data networks with best-eff…

math.PR2012

A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network

Guy Fayolle, Jean-Marc Lasgouttes

We consider a symmetrical star-shaped network, in which bandwidth is shared among the active connections according to the "min" policy. Starting from a chaos propagation hypothesis…