1 citations · 1 across the 12 of their papers we have counts for
7 papers · 1 filter
Distance flexibility in spatial matching: the value of concentration
Taha Ameen, Sophie H. Yu
In spatial matching markets, a supply unit's flexibility is measured by its service radius, the maximum distance at which it can serve demand. In dimensions , we study ho…
Converse bounds for multiple graph alignment and correlation detection based on last matching
Taha Ameen, Bruce Hajek
The paper focuses on information theoretic converse bounds for the alignment of correlated graphs and for the detection of correlation among graphs. A simple idea for $m\ge…
Estimating Community Boundaries in Geometric Random Graphs
Taha Ameen, Neeladri Maitra
The unit square is divided into two rectangles by the vertical line , where . Consider independent uniformly distributed points on , which we int…
Optimality of a Threshold Policy for a Queueing System with One Fast Server and Two Identical Slow Servers
Weina Wang, Taha Ameen, Yudong Chen +3
This paper studies the optimal control problem of a queueing system with three servers: one fast server and two identical slow servers. The two-server version of this problem, with…
Flexibility allocation in random bipartite matching markets: exact matching rates and dominance regimes
Taha Ameen, Flore Sentenac, Sophie H. Yu
This paper studies how a fixed flexibility budget should be allocated across the two sides of a balanced bipartite matching market. We model compatibilities via a sparse bipartite…
A uniformity principle for spatial matching
Taha Ameen, Flore Sentenac, Sophie H. Yu
Platforms matching spatially distributed supply to demand face a fundamental design choice: given a fixed total budget of service range, how should it be allocated across supply no…
Detecting Planted Structure in Circular Data
Taha Ameen, Bruce Hajek
Hypothesis testing problems for circular data are formulated, where observations take values on the unit circle and may contain a hidden, phase-coherent structure. Under the null,…