7 papers
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…
Echomix: a Strong Anonymity System with Messaging
Ewa J Infeld, David Stainton, Leif Ryge +1
Echomix is a practical mix network framework and a suite of associated protocols providing strong metadata privacy against realistic modern adversaries. It is distinguished from ot…
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…
Uniform Avoidance Coupling of Simple Random Walks
Ewa J. Infeld
We start by introducing avoidance coupling of Markov chains, with an overview of existing results. We then introduce and motivate a new notion, uniform avoidance coupling. We show…
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…