Eigenvector-based centrality captures recursive notions of importance in networks. While the direct problem computes centrality from given edge weights, the inverse eigenvector centrality problem seeks edge weights that reproduce a prescribed centrality profile; for directed multigraphs, this...

In ergodic singular stochastic control problems, a decision-maker can instantaneously adjust the evolution of a state variable using a control of bounded variation, with the goal of minimizing a long-term average cost functional. The cost of control is proportional to the magnitude of...