Bicolored graph partitioning, or: gerrymandering at its worst
نویسندگان
چکیده
منابع مشابه
Bicolored graph partitioning: or, how to win elections
This study is motivated by an electoral application where we look into the following question: how much biased can the assignment of parliament seats be in a majority system under the effect of vicious gerrymandering when the two competing parties have the same electoral strength? To give a first theoretical answer to this question, we introduce a stylized combinatorial model, where the territo...
متن کاملMedical Crime: Occupational Crime At Its Worst
Crime is a topic that is often discussed among law-makers as well as members of the general public. That being said, there is an overwhelming focus on street crimes (e.g., theft, drug offences). Those crimes which occur in professional settings are not given as much attention. In this paper, one particular type of occupational crime is discussed. Medical crime is a type of occupational crime wh...
متن کاملSuccessful Pressing Sequences for a Bicolored Graph and Binary Matrices
We apply matrix theory over F2 to understand the nature of socalled “successful pressing sequences” of black-and-white vertex-colored graphs. These sequences arise in computational phylogenetics, where, by a celebrated result of Hannenhalli and Pevzner, the space of sortingsby-reversal of a signed permutation can be described by pressing sequences. In particular, we offer several alternative li...
متن کاملCS369N: Beyond Worst-Case Analysis Lecture #3: Deterministic Planted Models for Clustering and Graph Partitioning∗
Last lecture motivated the need for a model of data to gain insight into the relative merits of different online paging algorithms. In this lecture and the next, we explore models of data for clustering and graph partitioning problems. We cover deterministic data models in this lecture, and probabilistic ones in the next. In some optimization problems, the objective function can be taken quite ...
متن کاملCS369N: Beyond Worst-Case Analysis Lecture #4: Probabilistic and Semirandom Models for Clustering and Graph Partitioning∗
1.1 Learning Mixtures of Gaussians We consider k distributions D1, D2, . . . , Dk on Rn. Suppose that Di has a mixing weight wi, where the mixing weights are nonnegative and sum to 1. We consider the following 2-stage sampling procedure (see Figure 1): first, we pick a distribution Di randomly according to the mixing weights; then we pick a random point x ∈ Rn according to Di. To illustrate the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.06.016