Related papers: Kleinberg navigation on anisotropic lattices
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…
The notion of network connectivity is used to characterize the robustness and failure tolerance of networks, with high connectivity being a desirable feature. In this paper, we develop a novel approach to the problem of identifying critical…
Dating back to two famous experiments by the social-psychologist, Stanley Milgram, in the 1960s, the small-world phenomenon is the idea that all people are connected through a short chain of acquaintances that can be used to route messages.…
Let $L$ be a finite lattice and $\mathcal{E}(L)$ be the set of join endomorphisms of $L$. We consider the problem of given $L$ and $f,g \in \mathcal{E}(L)$, finding the greatest lower bound $f \sqcap_{{\scriptsize \mathcal{E}(L)}} g$ in the…
In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…
We consider a particle performing a stochastic motion on a one-dimensional lattice with jump widths distributed according to a power-law with exponent $\mu + 1$. Assuming that the walker moves in the presence of a distribution $a(x)$ of…
Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and…
Upper bounds on the communication complexity of finding the nearest lattice point in a given lattice $\Lambda \subset \mathbb{R}^2$ was considered in earlier works~\cite{VB:2017}, for a two party, interactive communication model. Here we…
The energy landscape of high-dimensional non-convex optimization problems is crucial to understanding the effectiveness of modern deep neural network architectures. Recent works have experimentally shown that two different solutions found…
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 consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the construction of…
This paper is divided in two parts. In the first part, the inverse spectral problem for tight-binding hamiltonians is studied. This problem is shown to have an infinite number of solutions for properly chosen energies. The space of such…
The graph-navigability problem concerns how one can find as short paths as possible between a pair of vertices, given an incomplete picture of a graph. We study the navigability of graphs where the vertices are tagged by a number (between 1…
Starting from the time-dependent Ginzburg-Landau (TDGL) equations for a type II superconductor, we derive the equations of motion for the displacement field of a moving vortex lattice without inertia or pinning. We show that it is linearly…
Soliton transport in tube-like networks is studied by solving the nonlinear Schroedinger equation (NLSE) on finite thickness ("fat") graphs. The dependence of the solution and of the reflection at vertices on the graph thickness and on the…
Spacetimes obtained by dimensional reduction along lattices containing a lightlike direction can admit semigroup extensions of their isometry groups. We show by concrete examples that such a semigroup can exhibit a natural order, which in…
We consider the global well-posedness of weak energy conservative solution to a general quasilinear wave equation through variational principle, where the solution may form finite time cusp singularity, when energy concentrates. As a main…
We study the worst-case probability that $Y$ outperforms a benchmark $X$ when the law of $Y$ lies in a Kullback-Leibler neighbourhood of the benchmark. The max-min problem over couplings admits a tractable dual (via optimal transport),…
We study the three-dimensional Ginzburg-Landau model of superconductivity for strong applied magnetic fields varying between the second and third critical fields. In this regime, it is known from physics that superconductivity should be…
We theoretically study the magnetic field orientation dependence of longitudinal and transverse flux line lattice form factors in uniaxial superconductors with anisotropy ratio corresponding to YBa_2_Cu_3_O_{7-delta}. We discuss influences…