Triangle counting in networks under LDP (Local Differential Privacy) is a
fundamental task for analyzing connection patterns or calculating a clustering
coefficient while strongly protecting sensitive friendships from a central
server. In particular, a recent study proposes an algorithm for this task that
uses two rounds of interaction between users and the server to significantly
reduce estimation error. However, this algorithm suffers from a prohibitively
large communication cost due to a large noisy graph each user needs to

360 Mobile Vision - North & South Carolina Security products and Systems Installations for Commercial and Residential - $55 Hourly Rate. ACCESS CONTROL, INTRUSION ALARM, ACCESS CONTROLLED GATES, INTERCOMS AND CCTV INSTALL OR REPAIR 360 Mobile Vision - is committed to excellence in every aspect of our business. We uphold a standard of integrity bound by fairness, honesty and personal responsibility. Our distinction is the quality of service we bring to our customers. Accurate knowledge of our trade combined with ability is what makes us true professionals. Above all, we are watchful of our customers interests, and make their concerns the basis of our business.

In this work, we propose triangle counting algorithms under LDP with a small
estimation error and communication cost. We first propose two-round algorithms
consisting of edge sampling and carefully selecting edges each user downloads
so that the estimation error is small. Then we propose a double clipping
technique, which clips the number of edges and then the number of noisy
triangles, to significantly reduce the sensitivity of each user’s query.
Through comprehensive evaluation, we show that our algorithms dramatically
reduce the communication cost of the existing algorithm, e.g., from 6 hours to
8 seconds or less at 20 Mbps download rate, while keeping a small estimation

By admin