Abstract. General models of network navigation must contain a deter-ministic or drift component, encouraging the agent to follow routes of least cost, as well as a random or diffusive component, enabling free wan-dering. This paper proposes a thermodynamic formalism involving two path functionals, namely an energy functional governing the drift and an entropy functional governing the diffusion. A freely adjustable param-eter, the temperature, arbitrates between the conflicting objectives of minimising travel costs and maximising spatial exploration. The theory is illustrated on various graphs and various temperatures. The resulting optimal paths, together with presumably new associated edges and nodes centrality indices, are analytically an...
This work introduces a new family of link-based dissimilarity mea-sures between nodes of a weighted,...
This work investigates a paths-based statistical physics formalism, inspired from the bag-of-paths f...
The present work investigates a new relative entropy-regularized algorithm for solving the optimal t...
The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distributi...
The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distributi...
This work investigates the continuous-state counterpart of the discrete randomized shortest-path fra...
This work elaborates on the important problem of (1) designing optimal randomized routing policies f...
This work extends the randomized shortest paths model (RSP) by investigating the net flow RSP and ad...
Suppose you have to route agents through a network from a source node to a destination node in some ...
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and ad...
Abstract. Suppose you have to route agents through a network from a source node to a destination nod...
The emergence of networks and network data in different forms in the near past has given rise to dev...
VK: Saramäki, J.; TritonThis paper introduces two new closely related betweenness centrality measure...
We deal with an algorithm that, once origin and destination are fixed, individuates the route that p...
Numerous problems of both theoretical and practical interest are related to finding shortest (or oth...
This work introduces a new family of link-based dissimilarity mea-sures between nodes of a weighted,...
This work investigates a paths-based statistical physics formalism, inspired from the bag-of-paths f...
The present work investigates a new relative entropy-regularized algorithm for solving the optimal t...
The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distributi...
The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distributi...
This work investigates the continuous-state counterpart of the discrete randomized shortest-path fra...
This work elaborates on the important problem of (1) designing optimal randomized routing policies f...
This work extends the randomized shortest paths model (RSP) by investigating the net flow RSP and ad...
Suppose you have to route agents through a network from a source node to a destination node in some ...
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and ad...
Abstract. Suppose you have to route agents through a network from a source node to a destination nod...
The emergence of networks and network data in different forms in the near past has given rise to dev...
VK: Saramäki, J.; TritonThis paper introduces two new closely related betweenness centrality measure...
We deal with an algorithm that, once origin and destination are fixed, individuates the route that p...
Numerous problems of both theoretical and practical interest are related to finding shortest (or oth...
This work introduces a new family of link-based dissimilarity mea-sures between nodes of a weighted,...
This work investigates a paths-based statistical physics formalism, inspired from the bag-of-paths f...
The present work investigates a new relative entropy-regularized algorithm for solving the optimal t...