5 citations · 15 across the 12 of their papers we have counts for
4 papers · 1 filter
Network homophily via tail inequalities
Nicola Apollonio, Paolo G. Franciosa, Daniele Santoni
Homophily is the principle whereby "similarity breeds connections". We give a quantitative formulation of this principle within networks. Given a network and a labeled partition of…
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs
Giorgio Ausiello, Lorenzo Balzotti, Paolo G. Franciosa +2
The vitality of an edge in a graph with respect to the maximum flow between two fixed vertices and is defined as the reduction of the maximum flow value caused by the remov…
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich +1
We prove that a deterministic n-person shortest path game has a Nash equlibrium in pure and stationary strategies if it is edge-symmetric (that is (u,v) is a move whenever (v,u) is…
How Vulnerable is an Undirected Planar Graph with respect to Max Flow
Lorenzo Balzotti, Paolo G. Franciosa
We study the problem of computing the vitality of edges and vertices with respect to the -max flow in undirected planar graphs, where the vitality of an edge/vertex is the …