Imagine the Old Town of Lijiang: Contextualising community participation for urban heritage management in China

The UNESCO 2011 Recommendation on the Historic Urban Landscape (HUL) states community participation is a pivotal tool for integrating heritage practices into sustainable urban development. While community participation is significant but limited in China, various participatory methods have been developed, tested and evaluated worldwide. For...

State-of-the-practice: Assessing community participation within Chinese cultural World Heritage properties

Community participation is a key part of heritage management. However, in practice, unlike natural heritage, the nature of community participation within cultural heritage is seldom assessed, nor are there theoretical frameworks developed to baseline such assessments. To fill this knowledge gap, this paper developed and tested an assessment...

Informing or consulting? Exploring community participation within urban heritage management in China

To better face the challenges of rapid urbanisation, it is recommended urban heritage management is carried out through community participation. In the Chinese context of state centralisation, however, inclusive participatory governance for urban heritage has remained limited, and effective ways of engaging residents in decision-making have...

Weighted Betweenness and Algebraic Connectivity

One of the better studied topology metrics of complex networks is the second smallest eigenvalue of the Laplacian matrix of a network’s graph, referred to as the algebraic connectivity mN-1. This spectral metric plays a decisive role in synchronization of coupled oscillators, network robustness, consensus problems, belief propagation, graph...

Degree and Principal Eigenvectors in Complex Networks

The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...