5 papers
On a Centrality Maximization Game
Maria Castaldo, Costanza Catalano, Giacomo Como +1
The Bonacich centrality is a well-known measure of the relative importance of nodes in a network. This notion is, for example, at the core of Google's PageRank algorithm. In this p…
A linear bound on the k-rendezvous time for primitive sets of NZ matrices
Costanza Catalano, Umer Azfar, Ludovic Charlier +1
A set of nonnegative matrices is called primitive if there exists a product of these matrices that is entrywise positive. Motivated by recent results relating synchronizing automat…
On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs
Costanza Catalano, Raphaël M. Jungers
We tackle the problem of the randomized generation of slowly synchronizing deterministic automata (DFAs) by generating random primitive sets of matrices. We show that when the rand…
On randomized generation of slowly synchronizing automata
Costanza Catalano, Raphaël M. Jungers
Motivated by the randomized generation of slowly synchronizing automata, we study automata made of permutation letters and a merging letter of rank . We present a constr…
The Synchronizing Probability Function for Primitive Sets of Matrices
Costanza Catalano, Raphaël M. Jungers
Motivated by recent results relating synchronizing DFAs and primitive sets, we tackle the synchronization process and the related longstanding Černý conjecture by studying the prim…