DYOGENE - 2017 - Annual activity report

DYOGENE

DYOGENE - 2017

Project-Team Dyogene

Personnel

Overall Objectives

Research Program

Initial research axes
Distributed network control and smart-grids
Mathematics of wireless cellular networks
High-dimensional statistical inference for social networks

Application Domains

Physical communication networks
Abstract networks
Power grids

Highlights of the Year

New Software and Platforms

CloNES
Platforms

New Results

Reversibility and further properties of FCFS infinite bipartite matching
Point-map-probabilities of a point process and Mecke’s invariant measure equation
Gibbsian on-line distributed content caching strategy for cellular networks
State estimation for the individual and the population in mean field control with application to demand dispatch
Distributed spectrum management in TV white space networks
A spectral method for community detection in moderately sparse degree-corrected stochastic block models
Non-backtracking spectrum of degree-corrected stochastic block models
A spectral algorithm with additive clustering for the recovery of overlapping communities in networks
Optimal geographic caching in cellular networks with linear content coding
Online mobile user speed estimation: performance and tradeoff considerations
Self-similarity in urban wireless networks: Hyperfractals
Optimizing spatial throughput in device-to-device networks
Demand dispatch with heterogeneous intelligent loads
Energy savings for virtual MISO in fractal sensor networks
Distributed control of a fleet of batteries
Exact Computation and bounds for the coupling time in queueing systems
An online disaggregation algorithm and its application to demand control
Multiple local community detection
A Streaming Algorithm for Graph Clustering
Discrete probability models and methods: probability on graphs and trees, markov chains and random fields, entropy and coding
Distributed control design for balancing the grid using flexible loads
Un classificateur non-supervisé utilisant les complexes simpliciaux avec une application à la stylométrie
Phase transitions, optimal errors and optimality of message-passing in generalized linear models
Lecture notes on random geometric models — random graphs, point processes and stochastic geometry
Energy trade-offs for end-to-end communications in urban vehicular networks exploiting an hyperfractal model
Fundamental limits of low-rank matrix estimation: the non-symmetric case

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry
Bilateral Grants with Industry

Partnerships and Cooperations

Regional Initiatives
National Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries

Bibliography

Major publications
Publications of the year

Previous |

Home | Next next

Section: New Results

Exact Computation and bounds for the coupling time in queueing systems

[23] This paper is a work in progress on the exact computation and bounds of the expected coupling time for finite-state Markov chains. We give an exact formula in terms of generating series. We show how this may help to bound the expected coupling time for queueing networks.

Previous |

Home | Next next