Related papers: Spreading and shortest paths in systems with spars…
We study the survival probability of a particle diffusing in a two-dimensional domain, bounded by a smooth absorbing boundary. The short-time expansion of this quantity depends on the geometric characteristics of the boundary, whilst its…
We study the sample complexity of estimating the covariance matrix $\mathbf{\Sigma} \in \mathbb{R}^{d\times d}$ of a distribution $\mathcal D$ over $\mathbb{R}^d$ given independent samples, under the assumption that $\mathbf{\Sigma}$ is…
Collective diffusion coefficient in a one dimensional lattice gas adsorbate is calculated using variational approach. Particles interact via either a long-range, or a long range electron-gas-mediated (for a metallic substrate), or a…
The statistics of transmission through random 1D media are generally presumed to be universal and to depend only upon a single dimensionless parameter-the ratio of the sample length and the mean free path, s = L/l. Here, we show in…
In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…
In a complex system, perturbations propagate by following paths on the network of interactions among the system's units. In contrast to what happens with the spreading of epidemics, observations of general perturbations are often very…
We examine the dynamic spreading of a dense overdamped suspension of particles under power law repulsive potentials, often called Riesz gases. That is, potentials that decay with distance as 1/r^k where k\in (-2,\infty]. Depending on the…
We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous time simple random walk on the d-dimensional lattice. These particles are called A-particles and move independently…
We determine the most probable length of paths at finite temperatures, with a preassigned end-to-end distance and a unit of energy assigned to every step on a $D$-dimensional hypercubic lattice. The asymptotic form of the most probable…
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…
We study numerically statistical properties and dynamical disease propagation using a percolation model on a one dimensional small world network. The parameters chosen correspond to a realistic network of school age children. We found that…
It is possible to discuss the propagation of an electronic current through certain layered nanostructures modeling them as a collection of random one-dimensional interfaces, through which a coherent signal can be transmitted or reflected…
Consider the time-dependent problem of mass transfer of a solute between two phases and assume that the solute is initially distributed in one phase (phase 2) and absent from the other (phase 1). We desire the fraction of total solute…
Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size…
In a model of a connected network on random points in the plane, one expects that the mean length of the shortest route between vertices at distance $r$ apart should grow only as $O(r)$ as $r \to \infty$, but this is not always easy to…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
Most infectious diseases spread on a dynamic network of human interactions. Recent studies of social dynamics have provided evidence that spreading patterns may depend strongly on detailed micro-dynamics of the social system. We have…
We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…