-
Small world networks and clustered small world networks with random connectivity
International audience -
The Chen-Stein method for Poisson functionals
18 pages; some small typos, in particular in the proof of Theorem 5.1, have been corrected. -
A mixture model for random graphs
{The Erdos-Rényi model of a network is simple and possesses many explicit expressions for average and asymptotic properties, but it does not fit well to real-word... -
Efficient application-level multicast on a network-aware self-organizing overlay
The growth of peer-to-peer applications on the Internet motivates interest in general purpose overlay networks. The construction of overlays connecting a large... -
Model selection and clustering in stochastic block models with the exact inte...
The stochastic block model (SBM) is a mixture model used for the clustering of nodes in networks. It has now been employed for more than a decade to analyze very... -
Stress testing the resilience of financial networks
International audience -
Convergence of multivariate belief propagation, with applications to cuckoo h...
International audience -
Bipartite graph structures for efficient balancing of heterogeneous loads
International audience -
The Average Size of Giant Components Between the Double-Jump
A paraître dans Algorithmica -
Spectra of large diluted but bushy random graphs
24 pages, 5 figures. -
Metric dimension for random graphs
International audience -
Emergent Behaviors over Signed Random Networks in Dynamical Environments
We study asymptotic dynamical patterns that emerge among a set of nodes that interact in a dynamically evolving signed random network. Node interactions take place at... -
Load-balancing and resource-provisioning in large distributed systems
The main theme of this thesis is load-balancing in large sparse random graphs. In the computer science context, a load-balancing problem occurs when we have a set of... -
Spectrum of Markov generators on sparse random graphs
Correction in Proposition 4.3. Final version. -
Clique versus Independent Set
International audience -
Paths of specified length in random k-partite graphs
International audience -
Type transition of simple random walks on randomly directed regular lattices
19 pages; accepté pour publication dans Journal of Applied Probability, décembre 2014. -
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r
Analysis of Algorithms -
Maximum edge-cuts in Cubic Graphs With Large Girth and in Random Cubic Graphs
International audience
