I have a weighted directed graph representing the intensity of movements of individuals between locations, with weights representing the mobility flow.
I have another dataset consisting of particular paths that are taken by specific individuals. For example, for a person named Alice, I know how she moved from node A to node B, potentially via some intermediate stops through other nodes. What I want to evaluate is how likely this is given the mobility network (the weighted directed graph). Essentially, can I compute some kind of distance/statistical measure that tells me how "deviant" or how "consistent" these observed paths are, given the mobility network (taking into account the edge weights)?