Related papers: Infinite characteristic length on small-world syst…
For a connected graph $G = (V, E)$ and $s, t \in V$, a non-separating $s$-$t$ path is a path $P$ between $s$ and $t$ such that the set of vertices of $P$ does not separate $G$, that is, $G - V(P)$ is connected. An $s$-$t$ path is…
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…
The graph theoretic properties of the clustering coefficient, characteristic (or average) path length, global and local efficiency, provide valuable information regarding the structure of a graph. These four properties have applications to…
The goal of a hub-based distance labeling scheme for a network G = (V, E) is to assign a small subset S(u) $\subseteq$ V to each node u $\in$ V, in such a way that for any pair of nodes u, v, the intersection of hub sets S(u) $\cap$ S(v)…
The self averaging properties of conductance $g$ are explored in random resistor networks with a broad distribution of bond strengths $P(g)\simg^{\mu-1}$. Distributions of equivalent conductances are estimated numerically on hierarchical…
Shortest paths are not always simple. In planar networks, they can be very different from those with the smallest number of turns - the simplest paths. The statistical comparison of the lengths of the shortest and simplest paths provides a…
Complex network formalism allows to explain the behavior of systems composed by interacting units. Several prototypical network models have been proposed thus far. The small-world model has been introduced to mimic two important features…
We introduce and define three types of small worlds: small worlds based on the diameter of the network (SWD), those based on the average geodesic distance between nodes (SWA), and those based on the median geodesic distance (SWMd). These…
This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…
Supplementing a lattice with long-range connections effectively models small-world networks characterized by a high local and global interconnectedness observed in systems ranging from society to the brain. If the links have a wiring cost…
Motivated by a fundamental synchronization problem in scalable parallel computing and by a recent criterion for ``mean-field'' synchronizability in interacting systems, we study the Edwards-Wilkinson model on two variations of a…
We present analytical results for the distribution of shortest path lengths between random pairs of nodes in configuration model networks. The results, which are based on recursion equations, are shown to be in good agreement with numerical…
In recent work, Jon Kleinberg considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power of the distance between…
Shortcut sets are a vital instrument for reducing the diameter of a static graph and, consequently, its shortest path complexity, which is relevant in numerous subfields of graph theory. We explore the notion of shortcut sets in temporal…
We compare the behaviour of a small truncated coupled map lattice with random inputs at the boundaries with that of a large deterministic lattice essentially at the thermodynamic limit. We find exponential convergence for the probability…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
We study the optimal distance in networks, $\ell_{\scriptsize opt}$, defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For…
It is commonly known that there exist short paths between vertices in a network showing the small-world effect. Yet vertices, for example, the individuals living in society, usually are not able to find the shortest paths, due to the very…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
In this paper, we present a characterization for the Hausdorff distance between two given algebraic curves in the $n$-dimensional space (parametrically or implicitly defined) to be finite. The characterization is related with the asymptotic…