Related papers: Enumerating Seating Arrangements that Obey Social …
We present a new optimization-based method for aggregating preferences in settings where each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial order is motivated by the observation that…
This paper considers metric spaces where distances between a pair of nodes are represented by distance intervals. The goal is to study methods for the determination of hierarchical clusters, i.e., a family of nested partitions indexed by a…
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…
In this work we investigate the behaviour of a human crowd in a cross-flow. We first analyse the results of a set of controlled experiments in which subjects were divided into two groups, in such a way to explore different density settings,…
Stochastic service systems describe situations in which customers compete for service from scarce resources. Think of check-in lines at airports, waiting rooms in hospitals or queues in supermarkets, where the scarce resource is human…
We introduce a class of paired binary matrices called admixed arrays, which arise in analyses of large-scale genetic data and can be viewed as weighted edge colorings of complete bipartite graphs. This combinatorial structure gives rise to…
Citizens' assemblies are an increasingly influential form of deliberative democracy, where randomly selected people discuss policy questions. The legitimacy of these assemblies hinges on their representation of the broader population, but…
In this article we introduce associative Look-Up Tables. With their help, pseudo sums are correctly determined. The set of limit distributions in a pseudo-summation scheme of i.i.d. random variables is described. Also, two special cases…
The classical linear ordering problem seeks a single ranking representing a given preference matrix. While suitable for homogeneous populations, it fails when observed preferences arise from several latent groups with distinct ranking…
We analyze the Schelling model of segregation in which a society of n individuals live in a ring. Each individual is one of two races and is only satisfied with his location so long as at least half his 2w nearest neighbors are of the same…
In this paper, we consider the problem of exploring structural regularities of networks by dividing the nodes of a network into groups such that the members of each group have similar patterns of connections to other groups. Specifically,…
We study a stochastic linear discrete metapolulation model to understand the effect of risk spreading by dispersion. We calculate analytically the stable distribution of populations that live in different habitats. The result shows that the…
Spaces with locally varying scale of measurement, like multidimensional structures with differently scaled dimensions, are pretty common in statistics and machine learning. Nevertheless, it is still understood as an open question how to…
This paper describes a new alignment algorithm for sequences that can be used for determination of deletions and substitutions. It provides several solutions out of which the best one can be chosen on the basis of minimization of gaps or…
Density based spatial clustering of points in $\mathbb{R}^n$ has a myriad of applications in a variety of industries. We generalise this problem to the density based clustering of lines in high-dimensional spaces, keeping in mind there…
Deep learning occupies an undisputed dominance in crowd counting. In this paper, we propose a novel convolutional neural network (CNN) architecture called SegCrowdNet. Despite the complex background in crowd scenes, the proposeSegCrowdNet…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
Spatial models where growth is limited to the edge of the expansions have been instrumental to understand the population dynamics and the clone size distribution in growing cellular populations, such as microbial colonies and avascular…
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting.…
This paper presents an extension of Naor's analysis on the join-or-balk problem in observable M/M/1 queues. While all other Markovian assumptions still hold, we explore this problem assuming uncertain arrival rates under the…