Related papers: Random Distances Associated with Trapezoids
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…
In this paper, we consider a deterministic graph~\(\Gamma\) drawn on the unit square with straight line segments as edges and connect vertices of~\(\Gamma\) using edges of a random geometric graph (RGG)~\(G\) with adjacency distance~\(r_n\)…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
We introduce a model for the spatial distribution of cell phone antennas in a urban environment. After showing that the complete spatial randomness (homogeneous Poisson distribution) hypothesis does not hold, we propose a model in which…
We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…
The statistics of Lagrangian pair dispersion in a homogeneous isotropic flow is investigated by means of direct numerical simulations. The focus is on deviations from Richardson eddy-diffusivity model and in particular on the strong…
We analyze the coherent dynamics of excitons in three dimensional topologically disordered networks with traps. If the interactions between the nodes of the network are long ranged, i.e., algebraically decaying as a function of the distance…
We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…
Correlations may affect propagation processes on complex networks. To analyze their effect, it is useful to build ensembles of networks constrained to have a given value of a structural measure, such as the degree-degree correlation $r$,…
In this paper, we derive formulas for the analytical calculation of the moments of the distance between two uniformly and independently distributed random points in an $n$-sided regular polygon. A number of closed form expressions is…
Distances play important roles in cosmological observations, especially in gravitational lens systems, but there is a problem in determining distances because they are defined in terms of light propagation, which is influenced…
This paper provides a necessary and sufficient condition for a random network with nodes Poissonly distributed on a unit square and a pair of nodes directly connected following a generic random connection model to be asymptotically almost…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
Metrics have been used to investigate the relationship between wavefunction distances and density distances for families of specific systems. We extend this research to look at random potentials for time-dependent single electron systems,…
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
Proximity catch digraphs (PCDs) are based on proximity maps which yield proximity regions and are special types of proximity graphs. PCDs are based on the relative allocation of points from two or more classes in a region of interest and…
Random network models play a prominent role in modeling, analyzing and understanding complex phenomena on real-life networks. However, a key property of networks is often neglected: many real-world networks exhibit spatial structure, the…
Random links between otherwise distant nodes can greatly facilitate the propagation of disease or information, provided contagion can be transmitted by a single active node. However we show that when the propagation requires simultaneous…
Efficient techniques to navigate networks with local information are fundamental to sample large-scale online social systems and to retrieve resources in peer-to-peer systems. Biased random walks, i.e. walks whose motion is biased on…