output
20202024
most citedCharacterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks

63 citations

10 papers

math.CO2024

Enumerating runs, valleys, and peaks in Catalan words

Jean-Luc Baril, Pamela E. Harris, Kimberly J. Harry +2

We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (desce…

math.CO20241 cited

Asymptotic probability for connectedness

Thierry Monteil, Khaydar Nurligareev

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are int…

math.CO2022

Grand Dyck paths with air pockets

Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal +1

Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the -axis. We present enumerative results on GDAP (or t…

math.CO2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

Jean-Christophe Godin, Rémi Grisot, Olivier Togni

We consider the following list coloring with separation problem: Given a graph and integers , find the largest integer such that for any list assignment of wit…

cs.SI202258 cited

Comparative evaluation of community-aware centrality measures

Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1

Influential nodes play a critical role in boosting or curbing spreading phenomena in complex networks. Numerous centrality measures have been proposed for identifying and ranking t…

cs.SI20227 cited

Identifying Influential Nodes Using Overlapping Modularity Vitality

Stephany Rajeh, Marinette Savonnet, Eric Leclercq +1

It is of paramount importance to uncover influential nodes to control diffusion phenomena in a network. In recent works, there is a growing trend to investigate the role of the com…