On 2003-10-13 08:30:00, Allan Engelhardt wrote in CYBAEA Journal:
It seems to me that the requirements for systems like LinkedIn (which we covered obliquely in a previous note), Friendster, and many others, all of which allow you to document your social networks and, ultimately, profit from them, can be understood by considering normal, "real-world" social interactions and their limitations.
We will compare the various online services in a future note (please contact us with your favorite services) but briefly the requirements seem to us to include at least the following points (which are compared with features found at LinkedIn.
1. Ability to create links between members.
This is similar tot he real-world experience of exchanging business cards and is the basis for creating the electronic representation of your social networks.
This is implemented by LinkedIn through the invitations
feature.
2. Ability to delete links.
My address book is ever growing: I don't think I have ever deleted
anybody and I have over 1,000 contacts. However, I do not have 1,000
useful social links, for any meaningful definition of useful
.
Many of these are old contacts where I have not kept the relationship
up; others are people with whom I have fallen out; and looking
through my address book I have to study the notes section pretty
carefully to even remember who most of these people are.
They are not people through whom I could usefully introduce you to somebody you want to meet. Since this is pretty much the purpose of facilities like LinkedIn, they should not be represented as active links.
The ability to delete links seems like a basic feature, and yet it is
missing from LinkedIn. Allen Blue of LinkedIn points out that it is
available through a simple customer service function
and that
to date they have had just one request to break a connection
.
You may want to consider further refinements. Perhaps links should expire over time if they are not used? (For that you'd need some integration into your email and diary programs--more on that later.)
3. Connections only through established links
I should obviously not be able to spam the entire user database. The system is not a telephone directory. The point of the system is the network and specifically the links between people. To contact you I should go through somebody we both know, perhaps a chain of people but people who are already connected. LinkedIn implements this feature, though it allows individual users to disable it by allowing contacts from any members.
This is similar to how we operate real social networks: they work by introductions and this is one aspect of this.
4. Ability to publish your details in order to solicit contacts.
Similar to taking out a stand at a conference exhibition and
distributing your business cards, there needs to be some way for
other people to realize that they want to contact you. Linked in
implements this through Profiles
.
5. Ability to introduce people you know.
Allan, meet Andy; Andy, meet Allan.
One of the most common
exchanges in the business world (and, indeed, in the social world),
the basic introduction should be a feature of any system for managing
links.
Curiously, it is currently missing from LinkedIn, though Allen Blue
assumes me it will appear soon
.
6. Improvement on Real-World Networks (1): Show paths between any two members.
The search problem in a Small-World network is something we have touched upon previously. It basically boils down to this: everybody may be connected to everybody else through only a few steps, but can I find those steps--can I search the network from within the network?
One obvious way is for the system to be able to show the paths
between any two members. I may know (through Profiles
as in
point 4 above) that I want to contact you, but how do I find out who
can introduce me? Asking all my friends to ask all their friends
… to see if anybody knows you is very wasteful and risks
overloading the network--much like computer viruses work.
It should be easy for the system to show the paths between me and you, and indeed this is a core feature of LinkedIn.
7. Improvement (2): Limited broadcast of request
The problem is this: if I know all the questions that I may be asked,
then I can obviously structure my Profile
(cf. point 4 above)
to answer them. But it does not take much reflection to realize that
this will never be the case. There are always unusual requests;
indeed they are often the most interesting and valuable.
There need to be a mechanism to ask for help. The mechanism has to work but without overloading the network (as discussed above).
There are probably several ways of implementing this. My suggestion is for a bulletin board that is only visible by people who are no more than three links from me. That way, they can connect me to another member (LinkedIn has a limit of four degrees of separation for connections) if they know one who can satisfy my request. Or they can even invite a non-member to join, and then connect the two of us.
This is not currently available at LinkedIn.
8. Goal: Automatically update my network based on e-mails, meeting, telephone calls, etc.
In the real-world, when I meet somebody or talk to them on the phone, they automatically become part of my network. When I don't speak to them for years, they cease to be part of my network.
Somebody compared LinkedIn to a CRM system, but even the most basic such system has maintenance facilities for contacts and relationships.
As it stands, when I meet somebody new I have to update
That seems to be the real killer. How do people get the time to maintain the multiple representations of their networks? How do you expire old links? Out-of-date information is often worse than no information.
But this is a hard problem to solve. Stay tuned and add your comments using the links below.
On 2010-07-13 07:47:00, Allan Engelhardt wrote in CYBAEA Data and Analysis:
I am not sure apeescape’s ggplot2 area plot with intensity colouring is really the best way of presenting the information, but it had me intrigued enough to replicate it using base R graphics.
The key technique is to draw a gradient line which R does not support natively so we have to roll our own code for that. Unfortunately, lines(..., type="l") does not recycle the colour col= argument, so we end up with rather more loops than I thought would be necessary.
We also get a nice opportunity to use the under-appreciated read.fwf function.
Read more (~535 words).
On 2010-06-22 11:45:00, Allan Engelhardt wrote in CYBAEA Journal:
We have a mild obsession with employee productivity and how that declines as companies get bigger. We have previously found that when you treble the number of workers, you halve their individual productivity which is scary.
We now re-do the analysis four years later and, just because we can, we are using the leading companies of the London stock exchange instead of the largest American companies.
The results still hold. We called it the 3/2 rule: treble the number of workers and you halve their individual productivity. Large companies with ten times the number of employees are ¼ as productive as their smaller competitors.
Employee productivity is a big issue. If all the FTSE-100 companies achieved their average profits per employee, then the index would generate almost £1 trn of additional net profits for the economy.
Read more (~245 words).
On 2010-06-22 11:20:00, Allan Engelhardt wrote in CYBAEA Data and Analysis:
We have a mild obsession with employee productivity and how that declines as companies get bigger. We have previously found that when you treble the number of workers, you halve their individual productivity which is mildly scary.
We revisit the analysis for the FTSE-100 constituent companies and find that the relation still holds four years later and across a continent.
Read more (~763 words, 5 comments).
On 2010-06-17 09:05:00, Allan Engelhardt wrote in CYBAEA Data and Analysis:
Following on from my previous post about improving performance of R by linking with optimized linear algebra libraries, I thought it would be useful to try out the five benchmarks Revolutions Analytics have on their Revolutionary Performance pages.
Read more (~300 words, 2 comments).
On 2010-06-15 10:21:00, Allan Engelhardt wrote in CYBAEA Data and Analysis:
Can we make our analysis using the R statistical computing and analysis platform run faster? Usually the answer is yes, and the best way is to improve your algorithm and variable selection.
But recently David Smith was suggesting that a big benefit of their (commercial) version of R was that it was linked to a to a better linear algebra library. So I decided to investigate.
The quick summary is that it only really makes a difference for fairly artificial benchmark tests. For “normal” work you are unlikely to see a difference most of the time.
Read more (~934 words, 1 comments).
Join the discussion
There are no comments yet. Be the first to comment.