Related papers: A shape theorem for the orthant model
A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for…
In this paper, we explore how geometric structures can be grown exponentially fast. The studied processes start from an initial shape and apply a sequence of centralized growth operations to grow other shapes. We focus on the case where the…
Influence network of events is a view of the universe based on events that may be related to one another via influence. The network of events form a partially-ordered set which, when quantified consistently via a technique called chain…
We consider the East model in $\mathbb Z^d$, an example of a kinetically constrained interacting particle system with oriented constraints, together with one of its natural variant. Under any ergodic boundary condition it is known that the…
This article describes a new Monte Carlo method for the evaluation of the orthant probabilities by sampling first passage times of a non-singular Gaussian discrete time-series across an absorbing boundary. This procedure makes use of a…
Shape Theory, together with Shape-and-Scale Theory, comprise Relational Theory. This consists of $N$-point models on a manifold $M$, for which some geometrical automorphism group $G$ is regarded as meaningless and is thus quotiented out…
We consider arbitrary orderings of the edges entering each vertex of the (downward directed) Pascal graph. Each ordering determines an adic (Bratteli-Vershik) system, with a transformation that is defined on most of the space of infinite…
Consider the random graph $G({\mathcal P}_{n},r)$ whose vertex set ${\mathcal P}_{n}$ is a Poisson point process of intensity $n$ on $(- \frac{1}{2}, \frac{1}{2}]^d$, $d \geq 2$. Any two vertices $X_i,X_j \in {\mathcal P}_{n}$ are connected…
In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…
The embedding problem is to decide, given an ordered pair of structures, whether or not there is an injective homomorphism from the first structure to the second. We study this problem using an established perspective in parameterized…
We prove an ergodic theorem for Markov chains indexed by the Ulam-Harris-Neveu tree over large subsets with arbitrary shape under two assumptions: with high probability, two vertices in the large subset are far from each other and have…
We reveal a shape transition for a transient simple random walk forced to realize an excess $q$-norm of the local times, as the parameter $q$ crosses the value $q_c(d)=\frac{d}{d-2}$. Also, as an application of our approach, we establish a…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
In this note, we give sufficient conditions for the almost sure and the convergence in $\mathbb{L}^p$ of a $U$-statistic of order $m$ built on a strictly stationary but not necessarily ergodic sequence.
We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…
Consider an algorithm performing a computation on a huge random object. Is it necessary to generate the entire object up front, or is it possible to provide query access to the object and sample it incrementally "on-the-fly"? Such an…
The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in the normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach…
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…
Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…
We prove time-dependent versions of Kingman's subadditive ergodic theorem, which can be used to study stochastic processes as well as propagation of solutions to PDE in time-dependent environments.