Related papers: A limit theorem for persistence diagrams of random…
We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…
We consider a system of independent branching random walks on $\R$ which start off a Poisson point process with intensity of the form $e_{\lambda}(du)=e^{-\lambda u}du$, where $\lambda\in\R$ is chosen in such a way that the overall…
We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the…
We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…
We study finite probability theory through a category of finite probability schemes and probability-preserving maps, called \emph{bundles}. A bundle simultaneously records a quotient of a sample space, an algebra of random variables, and…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We…
We prove that the number of parameters defining a complex of projective modules over a finite dimensional algebra is upper semi-continuous in families of algebras. Supposing that every algebra is either derived tame or derived wild, we get…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
Let X be a polyhedral complex with finitely many isometry classes of links. We establish a restriction on the covolumes of uniform lattices acting on X. When X is two-dimensional and has all links isometric to either a complete bipartite…
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…
The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…
A critical branching process $\left\{Z_{k},k=0,1,2,...\right\} $ in a random environment generated by a sequence of independent and identically distributed random reproduction laws is considered.\ Let $Z_{p,n}$ be the number of particles at…
We consider the evolution of a connected set on the plane carried by a periodic incompressible stochastic flow. While for almost every realization of the random flow at time t most of the particles are at a distance of order sqrt{t} away…
To recover the topology of a manifold in the presence of heavy tailed or exponentially decaying noise, one must understand the behavior of geometric complexes whose points lie in the tail of these noise distributions. This study advances…
A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically…
We develop novel methods for using persistent homology to infer the homology of an unknown Riemannian manifold $(M, g)$ from a point cloud sampled from an arbitrary smooth probability density function. Standard distance-based filtered…
Random projections are random linear maps, sampled from appropriate distributions, that approx- imately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The well-known…
We give several algebraic bounds for percolation on directed and undirected graphs: proliferation of strongly-connected clusters, proliferation of in- and out-clusters, and the transition associated with the number of giant components.