Related papers: Mode Poset Probability Polytopes
The momentum spectrum of a periodic network (quantum graph) has a band-gap structure. We investigate the relative density of the bands or, equivalently, the probability that a randomly chosen momentum belongs to the spectrum of the periodic…
First-order statistics of scattered light is described using the representation of probability density cloud which visualizes a two-dimensional distribution for complex amplitude. The geometric parameters of the cloud are studied in detail…
We analyze the notion that physical theories are quantitative and testable by observations in experiments. This leads us to propose a new, Bayesian, interpretation of probabilities in physics that unifies their current use in classical…
In this paper, we propose a new class of distributions by exponentiating the random variables associated with the probability density functions of composite distributions. We also derive some mathematical properties of this new class of…
In this work, we present a method to generate probability distributions and classes of probability distributions, which broadens a process of probability distribution construction. In this method, distribution classes are built from…
We study the problem of estimating, in the sense of optimal transport metrics, a measure which is assumed supported on a manifold embedded in a Hilbert space. By establishing a precise connection between optimal transport metrics, optimal…
We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
The region of entropic vectors is a convex cone that has been shown to be at the core of many fundamental limits for problems in multiterminal data compression, network coding, and multimedia transmission. This cone has been shown to be…
We discuss the probability distributions of Fourier modes of cosmological density fields using the central limit theorem as it applies to weighted integrals of random fields. It is shown that if the cosmological principle holds in a certain…
A circle, centered at the origin and with radius chosen so that it has non-empty intersection with the integer lattice $\mathbb{Z}^{2}$, gives rise to a probability measure on the unit circle in a natural way. Such measures, and their weak…
This contribution derives from a rather extensive study on the foundations of probability. We start by discussing critically the two main models of the random event in Probability Theroy and cast light over a number of incongruities. We…
We consider random polytopes in the $d$-dimensional Euclidean space that are the convex hulls i.i.d. random points selected according to beta-prime distributions. These distributions are rotationally symmetric, heavy-tailed, and their…
In the following we revisit the frequency interpretation of probability of Richard von Mises, in order to bring the essential implicit notions in focus. Following von Mises, we argue that probability can only be defined for events that can…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.
The collection $\mathcal{M}_n$ of all metric spaces on $n$ points whose diameter is at most $2$ can naturally be viewed as a compact convex subset of $\mathbb{R}^{\binom{n}{2}}$, known as the metric polytope. In this paper, we study the…
Hyperuniform particle arrangements are characterized by a local number variance that grows more slowly than the volume of the observation window. We generalize this concept to describe particle systems in which particles carry weights:…
The distribution of monomers along a linear polymer grafted on a hard wall is modelled by determining the probability distribution of occupied vertices of Dyck and ballot path models of adsorbing linear polymers. For example, the…
Vietoris-Rips and degree Rips complexes are represented as homotopy types by their underlying posets of simplices, and basic homotopy stability theorems are recast in these terms. These homotopy types are viewed as systems (or functors),…