Related papers: Kleinberg navigation on anisotropic lattices
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp…
We exhibit a percolating ergodic and isotropic lattice model in all but at least two dimensions that has zero effective conductivity in all spatial directions and for all non-trivial choices of the connectivity parameter. The model is based…
We provide the rigorous derivation of the wave kinetic equation from the cubic nonlinear Schr\"odinger (NLS) equation at the kinetic timescale, under a particular scaling law that describes the limiting process. This solves a main…
In this note we asymptotically determine the maximum number of hyperedges possible in an $r$-uniform, connected $n$-vertex hypergraph without a Berge path of length $k$, as $n$ and $k$ tend to infinity. We show that, unlike in the graph…
To identify the contributions of the multiband nature and the anisotropy of a microscopic electronic structure to a macroscopic vortex lattice morphology, we develop a method based on the Eilenberger theory near Hc2 combined with the…
As shown in [15], under some structural assumptions, working on congested traffic problems in general and increasingly dense networks leads, at the limit by {\Gamma}-convergence, to continuous minimization problems posed on measures on…
The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the…
The rapid rise of artificial intelligence has led to an unsustainable growth in energy consumption. This has motivated progress in neuromorphic computing and physics-based training of learning machines as alternatives to digital neural…
Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…
Starting from the beam wave equation, which has a Schr\"odinger structure, on a hypercubic lattice of size $L$, with weak nonlinearity of strength $\lambda$, we show that the two point correlation function can be asymptotically expressed as…
We propose a information theoretical framework to capture transition and information costs of network navigation models. Based on the minimum description length principle and the Markov decision process, we demonstrate that efficient global…
In this work, we develop a collection of novel methods for the entropic-regularised optimal transport problem, which are inspired by existing mirror descent interpretations of the Sinkhorn algorithm used for solving this problem. These are…
The effective graph resistance, also known as the Kirchhoff index, is metric that is used to quantify the robustness of a network. We show that the optimisation problem of minimizing the effective graph resistance of a graph by adding a…
The design of complex engineering systems leads to solving very large optimization problems involving different disciplines. Strategies allowing disciplines to optimize in parallel by providing sub-objectives and splitting the problem into…
In this report we show that in a planar exponentially growing network consisting of $N$ nodes, congestion scales as $O(N^2/\log(N))$ independently of how flows may be routed. This is in contrast to the $O(N^{3/2})$ scaling of congestion in…
Elongated floaters drifting in propagating water waves slowly rotate towards a preferential orientation with respect to the direction of incidence. In this article, we study this phenomenon in the small-floater limit $k L_x < 1 $, with $k$…
The study of the scattering data for a star-shape network of LC-transmission lines is transformed into the scattering analysis of a Schr\"odinger operator on the same graph. The boundary conditions coming from the Kirchhoff rules ensure the…
We study the convergence of the transport plans $\gamma_\epsilon$ towards $\gamma_0$ as well as the cost of the entropy-regularized optimal transport $(c,\gamma_\epsilon)$ towards $(c,\gamma_0)$ as the regularization parameter $\epsilon$…
We discuss how various models of scale-free complex networks approach their limiting properties when the size N of the network grows. We focus mainly on equilibrated networks and their finite-size degree distributions. Our results show that…
We apply Kauffman's automata on small-world networks to study the crossover between the short-range and the infinite-range case. We perform accurate calculations on square lattices to obtain both critical exponents and fractal dimensions.…