This talk aims to introduce and explore the usefulness of a new algorithm, denoted as "network peeling", which is proposed to extend triad census in the case of weighted (and directed) networks. The algorithm is based on a nested sequence of binary sub-networks in which edges are "peeled out" each time of a unit value.
How to peel the network: an algorithm for weighted triad census / Rondinelli, Roberto; Ievoli, Riccardo; Palazzo, Lucio. - (2023). (Intervento presentato al convegno Statsitics@Naples tenutosi a Napoli nel 21 Giugno 2023).
How to peel the network: an algorithm for weighted triad census
roberto rondinelli;riccardo ievoli;lucio palazzo
2023
Abstract
This talk aims to introduce and explore the usefulness of a new algorithm, denoted as "network peeling", which is proposed to extend triad census in the case of weighted (and directed) networks. The algorithm is based on a nested sequence of binary sub-networks in which edges are "peeled out" each time of a unit value.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
