Related papers: Maximal Spread of Coherent Distributions: a Geomet…
We consider the problem of distributed learning, where a network of agents collectively aim to agree on a hypothesis that best explains a set of distributed observations of conditionally independent random processes. We propose a…
After a seminal paper by Shekeey (2016), a connection between maximum $h$-scattered $\mathbb{F}_q$-subspaces of $V(r,q^n)$ and maximum rank distance (MRD) codes has been established in the extremal cases $h=1$ and $h=r-1$. In this paper, we…
It is shown, using direct numerical simulations and laboratory experiments data, that distributed chaos is often tuned to large scale coherent motions in anisotropic inhomogeneous turbulence. The examples considered are: fully developed…
We prove that the number of multigraphs with vertex set $\{1, \ldots, n\}$ such that every four vertices span at most nine edges is $a^{n^2 + o(n^2)}$ where $a$ is transcendental (assuming Schanuel's conjecture from number theory). This is…
We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…
We demonstrate how large classes of discrete and continuous statistical distributions can be incorporated into coherent states, using the concept of a reproducing kernel Hilbert space. Each family of coherent states is shown to contain, in…
The performance of distributed averaging depends heavily on the underlying topology. In various fields, including compressed sensing, multi-party computation, and abstract graph theory, graphs may be expected to be free of short cycles,…
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum…
In several variables, we prove the pointwise convergence of multiresolution expansions to the distributional point values of tempered distributions and distributions of superexponential growth. The article extends and improves earlier…
We derive sharp upper and lower bounds for the pointwise concentration function of the maximum statistic of $d$ identically distributed real-valued random variables. Our first main result places no restrictions either on the common marginal…
In the edge-2star model with hard constraints we prove the existence of an open set of constraint parameters, bisected by a line segment on which there are nonunique entropy-optimal graphons related by a symmetry. At each point in the open…
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…
We exhibit the joint symmetric distribution of the following two parameters on the set of unlabeled, simple, connected graphs with $n$ vertices. The first parameter is the maximal number of leaves attached to a vertex. The second parameter…
We consider sequences of large sparse random graphs whose degree distribution approaches a limit with finite mean. This model includes both the random regular graphs and the Erd\"os-Renyi graphs of constant average degree. We prove that the…
We consider the problem of determining the maximal $\alpha \in (0,1]$ such that every matching $M$ of size $k$ (or at most $k$) in a bipartite graph $G$ contains an induced matching of size at least $\alpha |M|$. This measure was recently…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
We give a survey of a variety of recent results about the distribution and some geometric properties of points $(x,y)$ on modular hyperbolas $xy \equiv a \pmod m$. We also outline a very diverse range of applications of such results,…
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…
Fourier analysis and representation of circular distributions in terms of their Fourier coefficients, is quite commonly discussed and used for model-free inference such as testing uniformity and symmetry etc. in dealing with 2-dimensional…