IZA DP No. 11178 NOVEMBER 2017 Sorting out Neighbourhood Effects Using Sibling Data Previous research has reported evidence of intergenerational transmission of both neighbourhood status and social and economic outcomes later in life; parents influence where their children live as adults and how well they do later in life in terms of their income. However, interactions between the individual, t...

BACKGROUND Housing-led regeneration has been shown to have limited effects on mental health. Considering housing and neighbourhoods as a psychosocial environment, regeneration may have greater impact on positive mental wellbeing than mental ill-health. This study examined the relationship between the positive mental wellbeing of residents living in deprived areas and their perceptions of their ...

Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles on a graph is called solvable if it is possible to place a pebble on any given vertex using a sequence of pebbling steps. The pebbling number of a graph, denot...

The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a particular subset of the MDGP which can be solved using a d...

Let j and k be nonnegative integers. An L(j, k)-labeling of a graph G, where j ≥ k, is a function f : V (G) → Z ∪ {0} such that if u and v are adjacent vertices in G, then |f(u) − f(v)| ≥ j, while if u and v are vertices such that d(u, v) = 2, then |f(u) − f(v)| ≥ k. The largest label used by f is the span of f . The smallest span among all L(j, k)-labelings f of G, denoted λj,k(G), is called t...