Related papers: Geometry of the random interlacement
In this paper, we study the order of the largest connected component of a random graph having two sources of randomness: first, the graph is chosen randomly from all graphs with a given degree sequence, and then bond percolation is applied.…
We investigate site and bond percolation in triangular and square lattices subjected to linear distortion. In contrast to previously studied distortion schemes that preserve lattice geometry, linear distortion dislocates regular lattice…
This article presents a Monte Carlo study on bond percolation in distorted square and triangular lattices. The distorted lattices are generated by dislocating the sites from their regular positions. The amount and direction of the…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
Understanding the statistics of collisions among locally confined gas particles poses a major challenge. In this work we investigate $\mathbb Z^d$-map lattices coupled by collision with simplified local dynamics that offer significant…
We apply the Ramsey theory to the analysis of geometrical properties of closed contours. Consider a set of six points placed on a closed contour. The straight lines connecting these points are y_ik (x)={\alpha}_ik x+\b{eta}_ik (i,k=1...6),…
We consider the problem of traveling among random points in Euclidean space, when only a random fraction of the pairs are joined by traversable connections. In particular, we show a threshold for a pair of points to be connected by a…
String theory in 4 dimensions has the unique feature that a topological term, the oriented self-intersection number, can be added to the usual action. It has been suggested that the corresponding theory of random surfaces wold be free from…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…
Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
We investigate a class of growing graphs embedded into the $d$-dimensional torus where new vertices arrive according to a Poisson process in time, are randomly placed in space and connect to existing vertices with a probability depending on…
In recent decades, much attention has been focused on the topic of optimal paths in weighted networks due to its broad scientific interest and technological applications. In this work we revisit the problem of the optimal path between two…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
We investigate random interlacements on $\mathbb{Z}^d$ with $d \geq 3$, and derive the large deviation rate for the probability that the capacity of the interlacement set in a macroscopic box is much smaller than that of the box. As an…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
In this thesis we study in detail the self-intersection properties of Random Walks. Although notoriously hard to tackle, these properties are crucially related to the excluded-volume effect and other central features of real polymers. Our…
A new geometry of optical lattice is proposed, namely a lattice made of a 1D stack of ring traps. It is obtained though the interference pattern of two counterpropagating beams: one of the beam is a standard gaussian beam, while the other…