Related papers: On the Dimension of Random Simplicial Complexes
Project a collection of points on the high-dimensional sphere onto a random direction. If most of the points are sufficiently far from one another in an appropriate sense, the projection is locally close in distribution to the Poisson point…
We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…
We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…
We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique…
The metric dimension of a graph is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. Bailey and Meagher obtained an upper bound on the…
Inspired by R. Speicher's multidimensional free central limit theorem and semicircle families, we prove an infinite dimensional compound Poisson limit theorem in free probability, and define infinite dimensional compound free Poisson…
In stochastic geometry there are several instances of threshold phenomena in high dimensions: the behavior of a limit of some expectation changes abruptly when some parameter passes through a critical value. This note continues the…
The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…
For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…
Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from an n-dimensional Poisson point process, we study the…
This chapter explores the notion of "dimension" of a set. Various power laws by which an Euclidean space can be characterized are used to define dimensions, which then explore different aspects of the set. Also discussed are the…
Introduced recently, the concept of hierarchical degree allows a more complete characterization of the topological context of a node in a complex network than the traditional node degree. This article presents analytical characterization…
We associate with any finite subset of a metric space an infinite sequence of scale invariant numbers $\rho_1,\rho_2,\dots$ derived from a variant of differential entropy called the genial entropy. As statistics for point processes, these…
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in simplicial complexes called simplets, a generalization of…
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…
New constructions in group homology allow us to manufacture high-dimensional manifolds with controlled simplicial volume. We prove that for every dimension bigger than 3 the set of simplicial volumes of orientable closed connected manifolds…
In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…
We consider high dimensional variants of the maximum flow and minimum cut problems in the setting of simplicial complexes and provide both algorithmic and hardness results. By viewing flows and cuts topologically in terms of the simplicial…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…