Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Sylvain Courtain"'
Publikováno v:
Information Sciences, Vol. 556, no.1, p. 341-360 (2021)
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a random-walk and
Autor:
Sylvain Courtain, Marco Saerens
Publikováno v:
Complex Networks & Their Applications X ISBN: 9783030934088
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8653758b3b3ab27c423fbae8bc6a29c
https://doi.org/10.1007/978-3-030-93409-5_19
https://doi.org/10.1007/978-3-030-93409-5_19
Publikováno v:
Physica A: Statistical Mechanics and its Applications, Vol. 590, no.1, p. 126752 (2022)
This work investigates a paths-based statistical physics formalism, inspired from the bag-of-paths framework, for the design of random walks on a graph in which the transition probabilities (the policy) are biased in favor of some node features. More
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bff4eacd79333ebb79b16c9a6aa8188c
https://hdl.handle.net/2078.1/265098
https://hdl.handle.net/2078.1/265098
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into a set of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ab989a2098ea8c1f5b27af46fdfc3fb
http://arxiv.org/abs/2108.10004
http://arxiv.org/abs/2108.10004
Publikováno v:
Journal of Complex Networks, Vol. 8, no.6, p. 1-46 (2020)
This work derives closed-form expressions computing the expectation of co-presence and of number of co-occurrences of nodes on paths sampled from a network according to general path weights (a bag of paths). The underlying idea is that two nodes are
Publikováno v:
Complex Networks and Their Applications VIII ISBN: 9783030366827
COMPLEX NETWORKS (2)
COMPLEX NETWORKS (2)
This paper investigates a real-world application of the free energy distance between nodes of a graph [14, 20] by proposing an improved extension of the existing Fraud Detection System named APATE [36]. It relies on a new way of computing the free en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::470cb6d36be9bdbf737677a318642ed9
https://doi.org/10.1007/978-3-030-36683-4_4
https://doi.org/10.1007/978-3-030-36683-4_4