Publications by authors named "Jean-Loup Guillaume"
Article Synopsis
- A new method called Information Complexity Ranking (ICR) is proposed to assess and rank visual complexity based on intrinsic complexity and similarity to other objects.
- The method was validated using 7200 randomly generated images and compared to existing complexity algorithms using a dataset of 1400 images across 7 categories.
- Results indicated that ICR outperformed many state-of-the-art algorithms in several categories, although it struggled with images that had a lot of semantic elements.
We consider local leaders in random uncorrelated networks, i.e., nodes whose degree is higher than or equal to the degree of all their neighbors.
View Article and Find Full Text PDFDistance distribution in random graphs and application to network exploration.
Phys Rev E Stat Nonlin Soft Matter Phys
December 2007
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Rényi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of determining the proportion of edges connecting nodes that are at identical distance from the source node. The evolution of this quantity with the probability of existence of the edges exhibits intriguing oscillatory behavior.
View Article and Find Full Text PDF