Social resistance

Michael P. Friedlander; Nathan Krislock; Ting Kei Pong

doi:10.1109/MCSE.2016.30

Social resistance

Michael P. Friedlander, Nathan Krislock, Ting Kei Pong

Research output: Journal article publication › Journal article › Academic research › peer-review

Abstract

Can we measure how close two people in a social network are just by knowing who is friends with whom? Can we infer the closeness of two people's research areas just by observing coauthor relations? Can we predict the importance of new roads just by looking at a current traffic network? In this case study, the authors investigate an approach to these questions and the algorithms behind the computations.

Original language	English
Article number	7426285
Pages (from-to)	98-103
Number of pages	6
Journal	Computing in Science and Engineering
Volume	18
Issue number	2
DOIs	https://doi.org/10.1109/MCSE.2016.30
Publication status	Published - 1 Mar 2016

Keywords

Education
Networks
Rank-one Cholesky update
Resistance distance
Scientific computing

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1109/MCSE.2016.30

http://hdl.handle.net/10397/61318

Cite this

@article{4d235cb64e9e448f8fdfdd51b94d61fb,

title = "Social resistance",

abstract = "Can we measure how close two people in a social network are just by knowing who is friends with whom? Can we infer the closeness of two people's research areas just by observing coauthor relations? Can we predict the importance of new roads just by looking at a current traffic network? In this case study, the authors investigate an approach to these questions and the algorithms behind the computations.",

keywords = "Education, Networks, Rank-one Cholesky update, Resistance distance, Scientific computing",

author = "Friedlander, {Michael P.} and Nathan Krislock and Pong, {Ting Kei}",

year = "2016",

month = mar,

day = "1",

doi = "10.1109/MCSE.2016.30",

language = "English",

volume = "18",

pages = "98--103",

journal = "Computing in Science and Engineering",

issn = "1521-9615",

publisher = "IEEE Computer Society",

number = "2",

}

TY - JOUR

T1 - Social resistance

AU - Friedlander, Michael P.

AU - Krislock, Nathan

AU - Pong, Ting Kei

PY - 2016/3/1

Y1 - 2016/3/1

N2 - Can we measure how close two people in a social network are just by knowing who is friends with whom? Can we infer the closeness of two people's research areas just by observing coauthor relations? Can we predict the importance of new roads just by looking at a current traffic network? In this case study, the authors investigate an approach to these questions and the algorithms behind the computations.

AB - Can we measure how close two people in a social network are just by knowing who is friends with whom? Can we infer the closeness of two people's research areas just by observing coauthor relations? Can we predict the importance of new roads just by looking at a current traffic network? In this case study, the authors investigate an approach to these questions and the algorithms behind the computations.

KW - Education

KW - Networks

KW - Rank-one Cholesky update

KW - Resistance distance

KW - Scientific computing

UR - http://www.scopus.com/inward/record.url?scp=84963805204&partnerID=8YFLogxK

U2 - 10.1109/MCSE.2016.30

DO - 10.1109/MCSE.2016.30

M3 - Journal article

SN - 1521-9615

VL - 18

SP - 98

EP - 103

JO - Computing in Science and Engineering

JF - Computing in Science and Engineering

IS - 2

M1 - 7426285

ER -

Social resistance

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this