Related papers: Geometry of the random interlacement
We show that along a density one subsequence of admissible radii, the nearest neighbor spacing between lattice points on circles is Poissonian.
We study the problem of detecting the presence of an underlying high-dimensional geometric structure in a random graph. Under the null hypothesis, the observed graph is a realization of an Erd\H{o}s-R\'enyi random graph $G(n,p)$. Under the…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
In this paper we compare the different phenomena that occur when intersecting geometric objects with random geodesics on the unit sphere and inside convex bodies. On the high dimensional sphere we see that with probability bounded away from…
We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we…
Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many…
We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…
We consider the problem of detecting the dimensionality of entanglement with the use of correlations between measurements in randomized directions. First, exploiting the recently derived covariance matrix criterion for the entanglement…
We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity…
We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…
We consider planar directed last-passage percolation on the square lattice with general i.i.d. weights and study the geometry of the full set of semi-infinite geodesics in a typical realization of the random environment. The structure of…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…
The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…
For a connected network on Poisson points in the plane, consider the route-length $D(r,\theta) $ between a point near the origin and a point near polar coordinates $(r,\theta)$, and suppose $E D(r,\theta) = O(r)$ as $r \to \infty$. By…
We consider a random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice. The walk starts at the origin and is conditioned to hit a remote location y on the lattice. We prove that the expected time under the…