Related papers: 0-Pierced Triangles within a Poisson Overlay
In this paper we will consider the contact process in a very simple type of random environment that physicists call the random dilution model. We start with the contact process on a graph, here either $\mathbb{Z}^d$, a $d$-dimensional torus…
A regular Poisson manifold can be described as a foliated space carrying a tangentially symplectic form. Examples of foliations are produced here that are not induced by any Poisson structure although all the basic obstructions vanish.
Given a noncyclic quadrilateral, we consider an iterative procedure producing a new quadrilateral at each step. At each iteration, the vertices of the new quadrilateral are the circumcenters of the triad circles of the previous generation…
General formulation in the realm of strong-field quantum electrodynamics is provided for a process that occurs in the presence of a train of laser pulses and, in the tree level, is represented by a two-vertex Feynman diagram with exchange…
We give a complete investigation of Morley's trisector theorem. If the intersections of the half lines starting from the adjacent vertices of a triangle form an equilateral triangle for an arbitrary triangle, then the half lines are the…
We analyze the one-dimensional telegraph random process confined by two boundaries, 0 and $H>0$. The process experiences hard reflection at the boundaries (with random switching to full absorption). Namely, when the process hits the origin…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
Our paper develops a theory of Poisson slices and a uniform approach to their partial compactifications. The theory in question is loosely comparable to that of symplectic cross-sections in real symplectic geometry.
We introduce a continuum percolation model defined on the points of a d-dimensional homogeneous Poisson process. Each Poisson point is connected to all points within its connection range, which depends on the distances to the other Poisson…
To mimic the complex transport-like collective phenomena in a man-made or natural system, we study an open network junction model of totally asymmetric simple exclusion process with bulk particle attachment and detachment. The stationary…
Consider $n+m$ nonintersecting Brownian bridges, with $n$ of them leaving from 0 at time $t=-1$ and returning to 0 at time $t=1$, while the $m$ remaining ones (wanderers) go from $m$ points $a_i$ to $m$ points $b_i$. First, we keep $m$…
Let P be a set of n > 2 points in general position in the plane and let G be a geometric graph with vertex set P. If the number of empty triangles uvw in P for which the subgraph of G induced by {u,v,w} is not connected is at most n-3, then…
We study local normal forms for completely integrable systems on Poisson manifolds in the presence of additional symmetries. The symmetries that we consider are encoded in actions of compact Lie groups. The existence of Weinstein's…
We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…
This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…
An adapted, right-continuous, non-decreasing, integer-valued process with unit jumps and starting at zero has a minimal predictable intensity if and only if it is a standard Poisson process under an absolutely continuous transformation of…
Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed number of crossings on a given set $S$ of points, while…
We study the contact process on a class of geometric random graphs with scale-free degree distribution, defined on a Poisson point process on $\mathbb{R}^d$. This class includes the age-dependent random connection model and the soft Boolean…
A $3$-Prismatoid is the convex hull of two convex polygons $A$ and $B$ which lie in parallel planes $H_A, H_B\subset\mathbb{R}^3$. Let $A'$ be the orthogonal projection of $A$ onto $H_B$. A prismatoid is called nested if $A'$ is properly…