Related papers: Random unfriendly seating arrangement in a dining …
The paper derives new results on the marginal likelihood of a two-way table which clarify the conditions under which Ecological inference is possible and lead to an efficient algorithm for maximizing the exact multinomial likelihood. The…
The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…
In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…
Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…
This paper proposes a two-time scale neurodynamic duplex approach to solve distributionally robust geometric joint chance-constrained optimization problems. The probability distributions of the row vectors are not known in advance and…
We consider equilibrium one-on-one conversations between neighbors on a circular table, with the goal of assessing the likelihood of a (perhaps) familiar situation: sitting at a table where both of your neighbors are talking to someone…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
In the paper we develop an approach to asymptotic normality through factorial cumulants. Factorial cumulants arise in the same manner from factorial moments, as do (ordinary) cumulants from (ordinary) moments. Another tool we exploit is a…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
We consider the random deposition of objects of variable width and height over a line. The successive additions of these structures create a random interface. We focus on the regime of heavy tailed distributions of the structure width. When…
An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
Consider the task of generating samples from a tilted distribution of a random vector whose underlying distribution is unknown, but samples from it are available. This finds applications in fields such as finance and climate science, and in…
We consider statistical inference in high-dimensional regression problems under affine constraints on the parameter space. The theoretical study of this is motivated by the study of genetic determinants of diseases, such as diabetes, using…
Travel decisions tend to exhibit sensitivity to uncertainty and information processing constraints. These behavioural conditions can be characterized by a generative learning process. We propose a data-driven generative model version of…
We consider two-player random extensive form games where the payoffs at the leaves are independently drawn uniformly at random from a given feasible set C. We study the asymptotic distribution of the subgame perfect equilibrium outcome for…
Given data generated by an observable stochastic process, we study how to construct statistically optimal decisions for general stochastic optimization problems. Our setting encompasses non-standard data structures, including data…
The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent…
This paper concerns random bipartite planar maps which are defined by assigning weights to their faces. The paper presents a threefold contribution to the theory. Firstly, we prove the existence of the local limit for all choices of weights…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…