<｜begin▁of▁sentence｜>### Instruction:
Consider a simple path graph with 4 nodes. Calculate the eigenvector centrality of each node using NetworkX's eigenvector_centrality_numpy function. Parameters include a maximum of 50 iterations, a tolerance level of 1e-06, and the weight parameter set to None. Output the centrality values for each node.
### Response:
import networkx as nx
import numpy as np
G = nx.path_graph(4)
centrality = nx.eigenvector_centrality_numpy(G, max_iter=50, tol=1e-06, weight=None)
print({node: centrality[node] for node in centrality})
<|EOT|>
