Related papers: Dirichlet draws are sparse with high probability
The likelihood for the parameters of a generalized linear mixed model involves an integral which may be of very high dimension. Because of this intractability, many approximations to the likelihood have been proposed, but all can fail when…
Stationary probability distributions of one-dimensional random walks on lattices with aperiodic disorder are investigated. The pattern of the distribution is closely related to the diffusional behavior, which depends on the wandering…
A popular approach within the signal processing and machine learning communities consists in modelling signals as sparse linear combinations of atoms selected from a learned dictionary. While this paradigm has led to numerous empirical…
What distribution of graphical degree sequence is invariant under ``scaling''? Are these graphs always power-law graphs? We show the answer is a surprising ``yes'' for sparse graphs if we ignore isolated vertices, or more generally, the…
For any $N\ge 2$ and $\alpha=(\alpha_1,\cdots, \alpha_{N+1})\in (0,\infty)^{N+1}$, let $\mu^{(N)}_{\alpha}$ be the Dirichlet distribution with parameter $\alpha$ on the set $\Delta^{ (N)}:= \{ x \in [0,1]^N:\ \sum_{1\le i\le N}x_i \le 1…
For data assumed to come from a finite mixture with an unknown number of components, it has become common to use Dirichlet process mixtures (DPMs) not only for density estimation, but also for inferences about the number of components. The…
A random graph order is a partial order obtained from a random graph on $[n]$ by taking the transitive closure of the adjacency relation. The dimension of the random graph orders from random bipartite graphs $B(n,n,p)$ and from $G(n,p)$…
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…
We consider the joint value distribution of Dirichlet $L$-functions in the critical strip $\frac{1}{2} < \sigma < 1$. We show that the values of distinct Dirichlet $L$-functions are dependent in the sense that they do not behave like…
In this paper, we propose a discrete circular distribution obtained by extending the wrapped Poisson distribution. This new distribution, the Invariant Wrapped Poisson (IWP), enjoys numerous advantages: simple tractable density,…
In this paper we give another proof of the fact that a random overlap array, which satisfies the Ghirlanda-Guerra identities and whose elements take values in a finite set, is ultrametric with probability one. The new proof bypasses random…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
This survey paper is a structured concise summary of four of our recent papers on the stochastic regularity of diffusions that are associated to regular strongly local (but not necessarily symmetric) Dirichlet forms. Here by stochastic…
In the present paper new light is shed on the non-central extensions of the Dirichlet distribution. Due to several probabilistic and inferential properties and to the easiness of parameter interpretation, the Dirichlet distribution proves…
Given connected graph $H$ which is not a star, we show that the number of copies of $H$ in a dense uniformly random regular graph is asymptotically Gaussian, which was not known even for $H$ being a triangle. This addresses a question of…
The outcome of elections is strongly dependent on the districting choices, making thus possible (and frequent) the gerrymandering phenomenon, i.e.\ politicians suitably changing the shape of electoral districts in order to win the…
Lottery Ticket Hypothesis (LTH) suggests that a dense neural network contains a sparse sub-network that can match the performance of the original dense network when trained in isolation from scratch. Most works retrain the sparse…
We present some monotonicity results for Dirichlet $L$-functions associated to real primitive characters. We show in particular that these Dirichlet $L$-functions are far from being logarithmically completely monotonic. Also, we show that,…
We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if…