Frédéric Gilbert
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
Research Subjects
Frédéric Gilbert has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Fabien Jourdan
Toxalim (Research Centre in Food Toxicology), Université de Toulouse, INRAE, ENVT, INP-Purpan, UPS, Toulouse, France
2 shared publications - Faraz Zaidi
UMR 5800 LaBRI CNRS INRIA Bordeaux -Sud Ouest 351, cours de la Libération 33405 Talence cedex FRANCE
2 shared publications - Mariusz Woźniak
AGH University of Science and Technology
2 shared publications - Olivier Baudon
LaBRI Université de Bordeaux 351, cours de la Libération 33405 Talence Cedex France
2 shared publications - Paolo Simonetto
CNRS UMR5800 LaBRI and INRIA Bordeaux-Sud Ouest
2 shared publications - Romain Bourqui
University of Bordeaux
2 shared publications
Latest Publications
- Open Access
Communities and Hierarchical Structures in Dynamic Social Networks: Analysis and Visualization
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.
Open AccessCommunities and Hierarchical Structures in Dynamic Social Networks: Analysis and Visualization
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.
- Open Access
Recursively arbitrarily vertex-decomposable graphs
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.
Open AccessRecursively arbitrarily vertex-decomposable graphs
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.
- 5 October 2010
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 1 (2) , 83-95
Communities and hierarchical structures in dynamic social networks: analysis and visualization
- 5 October 2010
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 1 (2) , 83-95
Communities and hierarchical structures in dynamic social networks: analysis and visualization
- Open Access
Recursively Arbitrarily Vertex Decomposable Suns
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.
Open AccessRecursively Arbitrarily Vertex Decomposable Suns
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.