1. A computer-implemented method for reducing an original network, the method comprising: utilizing the original network to model dynamics, wherein the original network has an original memory footprint in a computer system; calculating, by a processing device, node centralities of a graph until a designated number of central nodes are detected, wherein the graph represents the original network, and wherein the calculating of the node centralities of the graph further comprises: approximating a product of a matrix exponential and a random probe vector of an adjacency matrix, the adjacency matrix representing the graph; and computing a diagonal of the adjacency matrix based on the product of the matrix exponential and the random probe vector; selecting a percentage of the central nodes as pivot nodes; collapsing neighboring nodes to each pivot node until the graph shrinks to a predefined threshold of total nodes; determining a reduced graph resulting from the graph responsive to reaching the predefined threshold, wherein the reduced graph represents a reduced network having preserved connectivity information of the original network; reducing the original network to form a reduced network based on the reduced graph; and utilizing the reduced network to model the dynamics, wherein the reduced network has a reduced memory footprint in the computer system as compared to the original footprint.