Related papers: Permutation Routing on Ramanujan Hypergraphs with …
Entropic regularization provides a simple way to approximate linear programs whose constraints split into two or more tractable blocks. The resulting objectives are amenable to cyclic Kullback-Leibler (KL) Bregman projections, with…
We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network. The overlay nodes are capable of implementing any dynamic routing policy, however, the…
\noindent An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m…
Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing…
Let $G$ be an $n$-vertex graph with Laplacian eigenvalues $0=\lambda_1(G)\le \lambda_2(G)\le\cdots\le \lambda_n(G)$. Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular graphs, Spielman conjectured that, for every…
Recently, several studies have explored the use of neural network to solve different routing problems, which is an auspicious direction. These studies usually design an encoder-decoder based framework that uses encoder embeddings of nodes…
Baryon number symmetry violating theories beyond the standard model with suppressed proton decay rates can be experimentally constrained by data on neutron-antineutron transition rates. In order to apply this constraints, theoretical…
Graphs with heterophily, where adjacent nodes carry different labels, are prevalent in real-world applications, from social networks to molecular interactions. However, existing spectral Graph Neural Network (GNN) approaches tailored for…
Learning-based methods for routing have gained significant attention in recent years, both in single-objective and multi-objective contexts. Yet, existing methods are unsuitable for routing on multigraphs, which feature multiple edges with…
Machine learning architectures, including transformers and recurrent neural networks (RNNs) have revolutionized forecasting in applications ranging from text processing to extreme weather. Notably, advanced network architectures, tuned for…
The Vehicle Routing Problem is about optimizing the routes of vehicles to meet the needs of customers at specific locations. The route graph consists of depots on several levels and customer positions. Several optimization methods have been…
Multi-objective optimization is a ubiquitous problem that arises naturally in many scientific and industrial areas. Network routing optimization with multi-objective performance demands falls into this problem class, and finding good…
We consider bipartite tight-binding graphs composed by $N$ nodes split into two sets of equal size: one set containing nodes with on-site loss, the other set having nodes with on-site gain. The nodes are connected randomly with probability…
In this work, we propose a new signal routing method for solving routing problems that occur in the design process of semiconductor package substrates. Our work uses a topological transformation of the layers of the package substrate in…
Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…
This paper concerns all-to-all network routing on regular digraphs. In previous work we focused on efficient routing in highly symmetric digraphs with low diameter for fixed degree. Here, we show that every connected regular digraph has an…
Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest-path…
A family of connections on the space of couplings for a renormalizable field theory is defined. The connections are obtained from a Levi-Civita connection, for a metric which is a generalisation of the Zamolodchikov metric in two…
Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than finding almost shortest simple paths on positively weighted…
Nodes in route-restricted overlays have an immutable set of neighbors, explicitly specified by their users. Popular examples include payment networks such as the Lightning network as well as social overlays such as the Dark Freenet. Routing…