| dc.contributor.author | Opmanis, Mārtiņš | |
| dc.date.accessioned | 2016-11-07T13:19:44Z | |
| dc.date.available | 2016-11-07T13:19:44Z | |
| dc.date.issued | 2016-11-07 | |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/34455 | |
| dc.description | Draft version of the paper | en_US |
| dc.description.abstract | Graph techniques are widely used in social network analysis.
However, there are some disputable applications where results are obtained
from the graphs using paths longer than one and are not simply
applicable to objects in the initial domain. The author provides several
examples of such usages and tries to recover roots of an incorrect application
of graphs. | en_US |
| dc.language.iso | eng | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Research Subject Categories::TECHNOLOGY::Information technology::Computer science | en_US |
| dc.subject | Graph algorithms | en_US |
| dc.subject | Social network analysis | en_US |
| dc.subject | Correctness | en_US |
| dc.title | Fragile Correctness of Social Network Analysis | en_US |
| dc.type | info:eu-repo/semantics/article | en_US |
