Related papers: Geometry of the random interlacement

We consider an infinite graph with the vertex set $\mathbb{Z}^2$ and edges connecting the vertices iff the Euclidean distance between the respective points is an integer, and the points do not lie on the same horizontal or vertical.…

We have studied numerically the random interchange model and related loop models on the three-dimensional cubic lattice. We have determined the transition time for the occurrence of long loops. The joint distribution of the lengths of long…

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…

We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…

We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

A lattice path in $\mathbb{Z}^d$ is a sequence $\nu_1,\nu_2,\ldots,\nu_k\in\mathbb{Z}^d$ such that the steps $\nu_i-\nu_{i-1}$ lie in a subset $\mathbf{S}$ of $\mathbb{Z}^d$ for all $i=2,\ldots,k$. Let $T_{m,n}$ be the $m\times n$ table in…

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…

The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…

In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

We consider random graphs $\mathcal{G}$ built on a homogeneous Poisson point process on $\mathbb{R}^d$, $d\geq 2$, with points $x$ marked by i.i.d. random variables $E_x$. Fixed a symmetric function $h(\cdot, \cdot)$, the vertexes of…

Geodesic coalescence, or the tendency of geodesics to merge together, is a hallmark phenomenon observed in a variety of planar random geometries involving a random distortion of the Euclidean metric. As a result of this, the union of…

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…

We study the dynamics of the travelling interface arising from a bistable piece-wise linear one-way coupled map lattice. We show how the dynamics of the interfacial sites, separating the two superstable phases of the local map, is finite…

We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…

We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.

If the structure of spacetime is discrete, then Lorentz symmetry should only be an approximation, valid at long length scales. At finite lattice spacings there will be small corrections to the Dirac evolution that could in principle be…

We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…

A central problem in liaison theory is to decide whether every arithmetically Cohen-Macaulay subscheme of projective $n$-space can be linked by a finite number of arithmetically Gorenstein schemes to a complete intersection. We show that…