4 papers · 1 filter
k-Anonymity by Partitions Maximizes Perfect Matchings
Ewa J. Infeld
The number of perfect matchings in a user-behavior bipartite graph is a natural measure of anonymity: more matchings mean greater uncertainty for an attacker. A fundamental questio…
Common adversaries form alliances: modelling complex networks via anti-transitivity
Anthony Bonato, Ewa Infeld, Hari Pokhrel +1
Anti-transitivity captures the notion that enemies of enemies are friends, and arises naturally in the study of adversaries in social networks and in the study of conflicting natio…
The Total Acquisition Number of Random Geometric Graphs
Ewa Infeld, Dieter Mitsche, Pawel Pralat
Let be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex to a neighbouring vertex can be moved, provided that the weight on $v…
Counting Restricted Dyck Paths Through Random Walks
Ewa J. Infeld
We show connection between Dyck paths with peaks of bounded height and random walks. The correspondence between a certain class of random walks and such Dyck paths allows us to dev…