57 citations · 140 across the 9 of their papers we have counts for
5 papers · 1 filter
Probabilistic Causal Analysis of Social Influence
Francesco Bonchi, Francesco Gullo, Bud Mishra +1
Mastering the dynamics of social influence requires separating, in a database of information propagation traces, the genuine causal processes from temporal correlation, i.e., homop…
Mining (maximal) span-cores from temporal networks
Edoardo Galimberti, Alain Barrat, Francesco Bonchi +2
When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their…
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
We study the problem of extracting a selective connector for a given set of query vertices in a graph . A selective connector is a subgraph of which…
Conditional Reliability in Uncertain Graphs
Arijit Khan, Francesco Bonchi, Francesco Gullo +1
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i…
The Minimum Wiener Connector
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector:…