Related papers: Kleinberg navigation on anisotropic lattices
In this work, we have employed Monte Carlo calculations to study the Ising model on a 2D additive small-world network with long-range interactions depending on the geometric distance between interacting sites. The network is initially…
In this note we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of $\mathbb{R}^2$ composed of straight segments joining at triple junctions forming angles…
We find the laws for the spreading of the spatial widths (parallel and transverse to the direction of average motion) of the relativistic position probability density for a massive, spinless particle. We find that when the momentum width of…
This research establishes that many real-world networks exhibit bounded expansion, a strong notion of structural sparsity, and demonstrates that it can be leveraged to design efficient algorithms for network analysis. We analyze several…
We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time…
We study minimizers of the two-dimensional Ginzburg-Landau energy with applied magnetic field, between the first and second critical fields. In this regime, minimizing configurations exhibit densely packed hexagonal vortex lattices, called…
Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Unfortunately, our maps of most large networks are…
We map the conformation space of a simple lattice polymer chain to a network, where (i) the vertices of the network have a one-to-one correspondence to the conformations of the chain, and (ii) a link between two vertices indicates the…
We study the small-world networks recently introduced by Watts and Strogatz [Nature {\bf 393}, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties resulting from the coexistence of a local…
The Watts-Strogatz algorithm transferring a regular lattice to the small world network is modified by introducing preferential rewiring constrained by connectivity demand. The probability to link to/ unlink form a node is dependent on a…
We study a nonlinear multimarginal optimal transport problem arising in risk management, where the objective is to maximize a spectral risk measure of the pushforward of a coupling by a cost function. Although this problem is inherently…
This paper is devoted to a study of infinite horizon optimal control problems with time discounting and time averaging criteria in discrete time. It is known that these problems are related to certain infinite-dimensional linear programming…
We propose a model of a growing network, in which preferential linking is combined with partial inheritance of connectivity (number of incoming links) of individual nodes by new ones. The nontrivial version of this model is solved exactly…
The function that maps a family of probability measures to the solution of the dual entropic optimal transport problem is known as the Schr\"odinger map. We prove that when the cost function is $\mathcal{C}^{k+1}$ with $k\in \mathbb{N}^*$…
Let $z\in \mathbb{H}:=\{z= x+ i y\in\mathbb{C}: y>0\}$ and $\mathcal{K}(\alpha;z):=\sum_{ (m,n)\in \mathbb{Z} ^2 }\frac{{\left| mz+n \right|}^2}{{{\Im}(z)}}e^{-\pi\alpha\frac{ \left|mz+n\right|^2}{\Im(z)}}.$ In this paper, we characterize…
Controllability, a basic property of various networked systems, has gained profound theoretical applications in complex social, technological, biological, and brain networks. Yet, little attention has been given to the control trajectory…
This paper defines the toroidal small world labeling problem that asks for a labeling of the vertices of a network such that the labels possess information that allows a compact routing scheme in the network. We consider the problem over a…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as lnlnN. Here we show that these ultrasmall worlds can be navigated in ultrashort time. Greedy routing on scale-free…
We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…