Related papers: Dirichlet draws are sparse with high probability
We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts satisfying a minimality property. As…
There has been recently a lot of research on sparse variants of random projections, faster adaptations of the state-of-the-art dimensionality reduction technique originally due to Johsnon and Lindenstrauss. Although the construction is very…
Two-sample tests utilizing a similarity graph on observations are useful for high-dimensional and non-Euclidean data due to their flexibility and good performance under a wide range of alternatives. Existing works mainly focused on sparse…
A new discrete distribution has been proposed as a discrete analogue of the two sided power distribution [Van Drop, J. R. and Kotz, S. (2002a). A novel extension of the triangular distribution and its parameter estimation, Journal of the…
Let $\mathbb{G}^{D}$ be the set of graphs $G(V,\, E)$ with $\left|V\right|=n$, and the degree sequence equal to $D=(d_{1},\, d_{2},\,\dots,\, d_{n})$. In addition, for $\frac{1}{2}<a<1$, we define the set of graphs with an almost given…
The lottery ticket hypothesis conjectures the existence of sparse subnetworks of large randomly initialized deep neural networks that can be successfully trained in isolation. Recent work has experimentally observed that some of these…
For any $S\subset [n]$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced by $S$ is a given graph $H$ on the vertex set $S$. The result holds for any $d=o(n^{1/3})$ and is further extended to $\mathcal{G}_{{\bf…
Despite great effort spent measuring topological features of large networks like the Internet, it was recently argued that sampling based on taking paths through the network (e.g., traceroutes) introduces a fundamental bias in the observed…
We prove a result related to Dirichlet spectrum for simultaneous approximation to two real numbers in Euclidean norm and badly or very well approximability.
We consider random rooted maps without regard to their genus, with fixed large number of edges, and address the problem of limiting distributions for six different parameters: vertices, leaves, loops, root edges, root isthmus, and root…
The contact angle of a fluid droplet on an heterogeneous surface is analysed using the statistical dynamics of the spreading contact line. The statistical properties of the final droplet radius and contact angle are obtained through…
We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…
Maps on a parameter space for expressing distribution functions are exactly derived from the Perron-Frobenius equations for a generalized Boole transform family. Here the generalized Boole transform family is a one-parameter family of maps…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
We introduce a simple model of deterministic particles in weakly disordered media which exhibits a transition from normal to anomalous diffusion. The model consists of a set of non-interacting overdamped particles moving on a disordered…
The random walk in Dirichlet environment is a random walk in random environment where the transition probabilities are independent Dirichlet random variables. This random walk exhibits a property of statistical invariance by time-reversal…
We consider random networks whose dynamics is described by a rate equation, with transition rates $w_{nm}$ that form a symmetric matrix. The long time evolution of the system is characterized by a diffusion coefficient $D$. In one dimension…
As a typical dimensionality reduction technique, random projection can be simply implemented with linear projection, while maintaining the pairwise distances of high-dimensional data with high probability. Considering this technique is…
The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…