arXiv subjects

Nicolas Tremblay

Publications and source records attributed to Nicolas Tremblay.

39 records · Page 3Linked to original sources

arXiv2015

Accelerated Spectral Clustering Using Graph Filtering Of Random Signals

We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the first k eigenvectors of the similarity matrix' Laplacian, whose computation cost, even for sparse matrices, becomes prohibitive for large datasets. We show that we can estimate the spectral clustering distance matrix without computing these eigenvectors: by graph filtering random signals. Also, we take advantage of the stochasticity of these random vectors to estimate the number of clusters k. We compare our method to classical spectral clustering on synthetic data, and show that it reaches equal performance while being faster by a factor at least two for large datasets.

cs.SI↗

arXiv2013

Multiscale Community Mining in Networks Using Spectral Graph Wavelets

For data represented by networks, the community structure of the underlying graph is of great interest. A classical clustering problem is to uncover the overall ``best'' partition of nodes in communities. Here, a more elaborate description is proposed in which community structures are identified at different scales. To this end, we take advantage of the local and scale-dependent information encoded in graph wavelets. After new developments for the practical use of graph wavelets, studying proper scale boundaries and parameters and introducing scaling functions, we propose a method to mine for communities in complex networks in a scale-dependent manner. It relies on classifying nodes according to their wavelets or scaling functions, using a scale-dependent modularity function. An example on a graph benchmark having hierarchical communities shows that we estimate successfully its multiscale structure.

physics.soc-ph↗

arXiv2013

Bootstrapping under constraint for the assessment of group behavior in human contact networks

The increasing availability of time --and space-- resolved data describing human activities and interactions gives insights into both static and dynamic properties of human behavior. In practice, nevertheless, real-world datasets can often be considered as only one realisation of a particular event. This highlights a key issue in social network analysis: the statistical significance of estimated properties. In this context, we focus here on the assessment of quantitative features of specific subset of nodes in empirical networks. We present a method of statistical resampling based on bootstrapping groups of nodes under constraints within the empirical network. The method enables us to define acceptance intervals for various Null Hypotheses concerning relevant properties of the subset of nodes under consideration, in order to characterize by a statistical test its behavior as ``normal'' or not. We apply this method to a high resolution dataset describing the face-to-face proximity of individuals during two co-located scientific conferences. As a case study, we show how to probe whether co-locating the two conferences succeeded in bringing together the two corresponding groups of scientists.

physics.soc-ph↗