The familiar Neo4j treats relationships as first class citizens; ad hoc queries/ traversals, integrity (if one node is deleted, the link is gone) etc. It also advertises as
blinkov's answer is correct. No, Riak Links are not appropriate for the scenario that you describe. There is no referential integrity checking, and there is a limit to how many links you can store with each object (I believe, up to 255).
Riak Search is much more appropriate for a social bookmarking scenario. In fact, the social bookmarking site Clipboard uses precisely this mechanism - bookmarks as Riak objects, with Riak Search enabled on them (for tagging, event triggers and notifications, etc). When the Ricon 2012 conference videos go up online, I recommend you watch the Clipboard talk for some more details on this.
Riak + Secondary Indexes would also be an appropriate solution to a lot of these cases. See my answer to Which clustered NoSQL DB for a Message Storing purpose? and How to structure data in Riak? for schema suggestions for a similar setup.
Links in Riak are just some metadata (list of one-way references to foreign keys) stored along with value. They are usually used as an input to MapReduce that can do whatever you want with them, including simulation of RDBMS joins.
There are no integrity checks or any additional magic in them like finding reverse links. They are just a convenience API, absolutely the same could have been achieved by storing these lists of foreign keys inside the values, serialized in some way.
For social bookmarking example I'd recommend using Riak Search, because it allows more flexible queries like http://example.com/* and have proper distributed indexing and lookups.