FGFrédéric Gilbert

Frédéric Gilbert

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Frédéric Gilbert has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Communities and Hierarchical Structures in Dynamic Social Networks: Analysis and Visualization

    by Frédéric Gilbert, Paolo Simonetto, Faraz Zaidi, Fabien Jourdan, Romain Bourqui

    Detection of community structures in social networks has attracted lots of attention in the domain of sociology and behavioral sciences. Social networks also exhibit dynamic nature as these networks change continuously with the passage of time. Social networks might also present a hierarchical structure led by individuals that play important roles in a society such as Managers and Decision Makers. Detection and Visualization of these networks changing over time is a challenging problem where communities change as a function of events taking place in the society and the role people play in it. In this paper we address these issues by presenting a system to analyze dynamic social networks. The proposed system is based on dynamic graph discretization and graph clustering. The system allows detection of major structural changes taking place in social communities over time and reveals hierarchies by identifying influential people in a social networks. We use two different data sets for the empirical evaluation and observe that our system helps to discover interesting facts about the social and hierarchical structures present in these social networks.

    • 6 February 2012
    • Published by HAL in HAL
    Open Access

    Recursively arbitrarily vertex-decomposable graphs

    by Olivier Baudon, Frédéric Gilbert, Mariusz Woźniak

    A graph G = (V, E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to |V|, there is a sequence of vertex-disjoints subsets of V whose orders are given by τ, and which induce connected graphs. The main aim of this paper is to study the recursive version of this problem. We present a solution for trees, suns, and partially for a class of 2-connected graphs called balloons.

  • Communities and hierarchical structures in dynamic social networks: analysis and visualization

    by Frédéric Gilbert, Paolo Simonetto, Faraz Zaidi, Fabien Jourdan, Romain Bourqui


    • 31 August 2010
    • Published by HAL in HAL
    Open Access

    Recursively Arbitrarily Vertex Decomposable Suns

    by Olivier Baudon, Frédéric Gilbert, Mariusz Woźniak, Woźniak Recursively Arbitrarily, Vertex Decomposable

    A graph G = (V, E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to |V|, there is a sequence of vertex-disjoints subsets of V whose orders are given by τ, and which induce connected graphs. The aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This report is a complement of the paper "Recursively Arbitrarily Vertex Decomposable Graphs", submitted to Discrete Mathematics.