Related papers: Kleinberg navigation on anisotropic lattices
A regular lattice in which the sites can have long range connections at a distance l with a probabilty $P(l) \sim l^{-\delta}$, in addition to the short range nearest neighbour connections, shows small-world behaviour for $0 \le \delta <…
Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…
We prove upper bounds on the $L^\infty$-Wasserstein distance from optimal transport between strongly log-concave probability densities and log-Lipschitz perturbations. In the simplest setting, such a bound amounts to a transport-information…
This paper mainly investigates why small-world networks are navigable and how to navigate small-world networks. We find that the navigability can naturally emerge from self-organization in the absence of prior knowledge about underlying…
We consider network routing under random link failures with a desired final distribution. We provide a mathematical formulation of a relaxed transport problem where the final distribution only needs to be close to the desired one. The…
Using a simulated annealing, we examine a bipartitioning of small worlds obtained by adding a fraction of randomly chosen links to a one-dimensional chain or a square lattice. Models defined on small worlds typically exhibit a mean-field…
In the 1960s, the social scientist Stanley Milgram performed his famous "small-world" experiments where he found that people in the US who are far apart geographically are nevertheless connected by remarkably short chains of acquaintances.…
Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of…
Consider designing a transportation network on $n$ vertices in the plane, with traffic demand uniform over all source-destination pairs. Suppose the cost of a link of length $\ell$ and capacity $c$ scales as $\ell c^\beta$ for fixed…
Large optimal transport problems can be approached via domain decomposition, i.e. by iteratively solving small partial problems independently and in parallel. Convergence to the global minimizers under suitable assumptions has been shown in…
We study Anderson localization of the classical lattice waves in a chain with mass impurities distributed randomly through a power-law relation $s^{-(1+\alpha)}$ with $ s $ as the distance between two successive impurities and $\alpha>0$.…
We investigate dynamical aspects of the discrete nonlinear Schr\"{o}dinger equation (DNLS) in finite lattices. Starting from a periodic chain with nearest neighbor interactions, we insert randomly links connecting distant pairs of sites…
We consider the two-dimensional Ginzburg-Landau functional with constant applied magnetic field. For applied magnetic fields close to the second critical field $H_{C_2}$ and large Ginzburg-Landau parameter, we provide leading order…
We consider the ordering dynamics of the Ising model on a square lattice where an additional fixed number of bonds connect any two sites chosen randomly. The total number of shortcuts added is controlled by two parameters $p$ and $\alpha$.…
Zermelo's navigation problem seeks the trajectory of minimal travel time between two points in a fluid flow. We address this problem for an agent -- such as a micro-robot or active particle -- that is advected by a two-dimensional flow,…
One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…
We study navigation with limited information in networks and demonstrate that many real-world networks have a structure which can be described as favoring communication at short distance at the cost of constraining communication at long…
A method is developed to compute minimal energy vortex lattices in a general Ginzburg-Landau model of a superconductor subjected to an applied magnetic field. The model may have any number of components and may be spatially anisotropic. The…
Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability $P_{ij}\sim r_{ij}^{-\alpha}$, where $r_{ij}$ is…
We use a simple dynamical model and explore coherent dynamics of wavepackets in complex networks of optical fibers. We start from a symmetric lattice and through the application of a Monte-Carlo criterion we introduce structural disorder…