Vital node identification is the problem of finding nodes of highest importance in complex
networks. This problem has crucial applications in various contexts such as viral marketing …

Recommender systems typically suggest to users content similar to what they consumed in
the past. If a user happens to be exposed to strongly polarized content, she might …

In order to maximize the use of results from high-throughput experimental studies, eg GWAS,
for identification and diagnostics of new disease-associated genes, it is important to have …

Most media content consumed today is provided by digital platforms that aggregate input
from diverse sources, where access to information is mediated by recommendation …

The problem of selecting a group of vertices under certain constraints that maximize their
joint centrality arises in many practical scenarios. In this paper, we extend the notion of …

Centrality measures allow to measure the relative importance of a node or an edge in a
graph wrt~ other nodes or edges. Several measures of centrality have been developed in …

Given that the Internet and sophisticated transportation networks have made an increasingly
huge number of products and services available to the public, consumers are unable to …

For random walks on graph with vertices and edges, the mean hitting time from a vertex
chosen from the stationary distribution to vertex measures the importance for, while the …

For an undirected graph, its Kemeny's constant is defined as the mean hitting time of random
walks from one vertex to another chosen randomly according to the stationary distribution …

For random walks on a graph, the mean hitting time H_j from a vertex i chosen from the
stationary distribution to the target vertex j can be used as a measure of importance for …