<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with vertices ['A', 'B', 'C', 'D'] and edges [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)], can you calculate the personalized PageRank in igraph, where vertex 'A' has been given a higher importance in comparison to the others?
### Response:
import igraph as ig

# Create a graph with 4 vertices
vertices = ['A', 'B', 'C', 'D']
edges = [(0, 1), (1, 2), (2, 3), (3, 0), (1, 3)]
g = ig.Graph(edges=edges)

# Personalize the PageRank by giving vertex 'A' more importance
personalization = {'A': 1.0, 'B': 0.0, 'C': 0.0, 'D': 0.0}
personalization_vec = [personalization.get(vertex, 0) for vertex in vertices]

# Calculate personalized PageRank
pagerank = g.personalized_pagerank(vertices=g.vs, weights=None, directed=False, personalization=personalization_vec)

# Print the PageRank values
print('PageRank:', pagerank)
<|EOT|>
