Related papers: A lower bound for the chemical distance in sparse …
We derive an exact formula for the covariance of cartesian distances in two simple polymer models, the freely-jointed chain and a discrete flexible model with nearest-neighbor interaction. We show that even in the interaction-free case…
In this paper, we consider Voronoi percolation in the hyperbolic space $\mathbb{H}^d$ ($d\ge 2$) and show that the phase transition is sharp. More precisely, we show that for Voronoi percolation with parameter $p$ generated by a homogeneous…
In Euclidean space there is a trivial upper bound on the maximum length of a compound "walk" built up of variable-length jumps, and a considerably less trivial lower bound on its minimum length. The existence of this non-trivial lower bound…
We model long range correlations of nucleotides in the human DNA sequence using the long range one dimensional Ising model. We show that for distances between $10^3$ and $10^6$ bp the correlations show an universal behaviour and may be…
We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the…
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…
Distance correlation is a recent extension of Pearson's correlation, that characterises general statistical independence between Euclidean-space-valued random variables, not only linear relations. This review delves into how and when…
The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree,…
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
We propose a new method with $\mathcal{L}_2$ distance that maps one $N$-dimensional distribution to another, taking into account available information about correspondences. We solve the high-dimensional problem in 1D space using an…
Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.
Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…
A network picture has been applied to various physical and biological systems to understand their governing mechanisms intuitively. Utilizing discretization schemes, both electrical and optical materials can also be interpreted as abstract…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered…
We confirm the following conjecture which has been proposed in [{\em Linear Algebra and its Applications}, {\bf 436} (2012), No. 5, 1425-1435.]: $$ 0.945\approx\displaystyle\lim_{n\longrightarrow…
We study the contact process on the long-range percolation cluster on $\mathbb{Z}$ where each edge $\langle i,j \rangle$ is open with probability $|i-j|^{-s}$ for $s> 2$. Using a renormalization procedure we apply Peierls-type argument to…
Here we give refined numerical values for the minimum number of vertices of $k$-chromatic unit distance graphs in the Euclidean plane.
Let $L_{a,b}$ be a line in the Euclidean plane with slope $a$ and intercept $b$. The dimension spectrum $\spec(L_{a,b})$ is the set of all effective dimensions of individual points on $L_{a,b}$. The dimension spectrum conjecture states…