Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Catalano, Costanza"'
Autor:
Bellomarini, Luigi, Catalano, Costanza, Coletta, Andrea, Iezzi, Michela, Samarati, Pierangela
Knowledge Graphs (KGs) have recently gained relevant attention in many application domains, from healthcare to biotechnology, from logistics to finance. Financial organisations, central banks, economic research entities, and national supervision auth
Externí odkaz:
http://arxiv.org/abs/2410.12418
In this work we extend the concept of out/in-branchings spanning the vertices of a digraph (also called directed spanning trees) to temporal graphs, which are digraphs where arcs are available only at prescribed times. While the literature has focuse
Externí odkaz:
http://arxiv.org/abs/2312.11390
We study a network formation game where $n$ players, identified with the nodes of a directed graph to be formed, choose where to wire their outgoing links in order to maximize their PageRank centrality. Specifically, the action of every player $i$ co
Externí odkaz:
http://arxiv.org/abs/2211.03685
Publikováno v:
In Journal of Computer and System Sciences March 2025 148
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 paper we study a network formation game where each player corresponds t
Externí odkaz:
http://arxiv.org/abs/1911.06737
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 automata and primitive sets, we study the length of the shortest product of a
Externí odkaz:
http://arxiv.org/abs/1903.10421
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 randomized procedure is too simple the exponent of the generated sets is O
Externí odkaz:
http://arxiv.org/abs/1810.11323
Motivated by recent results relating synchronizing DFAs and primitive sets, we tackle the synchronization process and the related longstanding \v{C}ern\'{y} conjecture by studying the primitivity phenomenon for sets of nonnegative matrices having nei
Externí odkaz:
http://arxiv.org/abs/1805.06685