12 citations · 18 across the 5 of their papers we have counts for
9 papers
Bond Percolation in Small-World Graphs with Power-Law Distribution
Luca Becchetti, Andrea Clementi, Francesco Pasquale +2
\emph{Full-bond percolation} with parameter is the process in which, given a graph, for every edge independently, we delete the edge with probability . Bond percolation is…
Biased Opinion Dynamics: When the Devil Is in the Details
Aris Anagnostopoulos, Luca Becchetti, Emilio Cruciani +2
We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Star…
Expansion and Flooding in Dynamic Random Networks with Node Churn
Luca Becchetti, Andrea Clementi, Francesco Pasquale +2
We study expansion and information diffusion in dynamic networks, that is in networks in which nodes and edges are continuously created and destroyed. We consider information diffu…
Finding a Bounded-Degree Expander Inside a Dense One
Luca Becchetti, Andrea Clementi, Emanuele Natale +2
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if is a -regular dense expander then there is an edge-induced subgraph $H=(V…
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise
Andrea Clementi, Luciano Gualà, Emanuele Natale +3
Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast,…
Rumor Spreading in Random Evolving Graphs
Andrea Clementi, Pierluigi Crescenzi, Carola Doerr +5
Randomized gossip is one of the most popular way of disseminating information in large scale networks. This method is appreciated for its simplicity, robustness, and efficiency. In…