Related papers: On random classical marginal problems with applica…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
We study a variant of the standard random intersection graph model ($G(n,m,F,H)$) in which random weights are assigned to both vertex types in the bipartite structure. Under certain assumptions on the distributions of these weights, the…
We derive expressions for the probability distribution of the ratio of two consecutive level spacings for the classical ensembles of random matrices. This ratio distribution was recently introduced to study spectral properties of many-body…
We study a probabilistic numerical method for the solution of both boundary and initial value problems that returns a joint Gaussian process posterior over the solution. Such methods have concrete value in the statistics on Riemannian…
Mode-division multiplexing using multimode optical fibers has been intensively studied in recent years, in order to alleviate the transmission capacity crunch. Moreover, the need for secure information transmission based on quantum…
Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…
By virtue of numerical arguments we study a bifurcation phenomenon occurring for a class of minimization problems associated with the quasi-linear Schrodinger equation.
We study spatial embeddings of random graphs in which nodes are randomly distributed in geographical space. We let the edge probability between any two nodes to be dependent on the spatial distance between them and demonstrate that this…
The classical Schrodinger bridge seeks the most likely probability law for a diffusion process, in path space, that matches marginals at two end points in time; the likelihood is quantified by the relative entropy between the sought law and…
We study statistical properties of a class of band random matrices which naturally appears in systems of interacting particles. The local spectral density is shown to follow the Breit-Wigner distribution in both localized and delocalized…
The Bell/CHSH inequalities of quantum physics are identical with the inequalities derived in mathematical psychology for the problem of selective influences in cases involving two bi- nary experimental factors and two binary random…
We consider random stochastic matrices $M$ with elements given by $M_{ij}=|U_{ij}|^2$, with $U$ being uniformly distributed on one of the classical compact Lie groups or associated symmetric spaces. We observe numerically that, for large…
We investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., closed graphs, pseudo-forests), we compute the exact value for…
Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are…
The celebrating theorem of A. Fine implies that the CHSH inequality is violated if and only if the joint probability distribution for the quadruples of observables involved the EPR-Bohm-Bell experiment does not exist, i.e., it is impossible…
Classical and quantum properties of a discontinuous perturbed twist map are investigated. Different classical diffusive regimes, quasilinear and slow respectively, are observed. The regime of slow classical diffusion gives rise to two…
In this work we consider temporal graphs, i.e. graphs, each edge of which is assigned a set of discrete time-labels drawn from a set of integers. The labels of an edge indicate the discrete moments in time at which the edge is available. We…
In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The…
The fields of quantum non-locality in physics, and causal discovery in machine learning, both face the problem of deciding whether observed data is compatible with a presumed causal relationship between the variables (for example a local…
In static classical statistical systems the problem of information transport from a boundary to the bulk finds a simple description in terms of wave functions or density matrices. While the transfer matrix formalism is a type of Heisenberg…