Say we have a function that maps a string of size $n$ of some finite alphabet to another such string of size $n$. Or alternatively, a function that maps an $n$ dimensional real vector to another one.
I am looking for a term/concept that captures the notion of how "local" the transformation is. For example, if such a function maps a string of 5000 digits to the same string, except multiplying the 43'th digit by 2 or by 10 billion, then it is extremely local, since if you change one digit in the input, this will only change the same digit in the output.
But if we have a cryptographic hash function, then changing one digit even slightly, will completely change all the output digits, and all of them in different ways. So such a function is highly "non-local"
Is there a formal concept of this notion of "locality" of a transformation?