uu.seUppsala University Publications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 36) Show all publications
Kaveh, A., Magnani, M. & Rohner, C. (2019). Comparing node degrees in probabilistic networks. Journal of Complex Networks, 7
Open this publication in new window or tab >>Comparing node degrees in probabilistic networks
2019 (English)In: Journal of Complex Networks, E-ISSN 2051-1329, Vol. 7Article in journal (Refereed) Epub ahead of print
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-392384 (URN)10.1093/comnet/cnz003 (DOI)
Available from: 2019-02-23 Created: 2019-09-03 Last updated: 2019-09-03Bibliographically approved
Kaveh, A., Magnani, M. & Rohner, C. (2019). Defining and measuring probabilistic ego networks. Applied Network Science Journal
Open this publication in new window or tab >>Defining and measuring probabilistic ego networks
2019 (English)In: Applied Network Science Journal, E-ISSN 2364-8228Article in journal (Other academic) Submitted
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-392404 (URN)
Available from: 2019-06-16 Created: 2019-09-03 Last updated: 2019-09-03Bibliographically approved
Fatemi, Z., Magnani, M. & Salehi, M. (2018). A generalized force-directed layout for multiplex sociograms. In: Social Informatics: 10th International Conference, SocInfo 2018, St. Petersburg, Russia, September 25-28, 2018, Proceedings, Part I. Paper presented at 10th International Conference on Social Informatics (SocInfo), SEP 25-28, 2018, St Petersburg, RUSSIA (pp. 212-227). Springer, 11185
Open this publication in new window or tab >>A generalized force-directed layout for multiplex sociograms
2018 (English)In: Social Informatics: 10th International Conference, SocInfo 2018, St. Petersburg, Russia, September 25-28, 2018, Proceedings, Part I, Springer, 2018, Vol. 11185, p. 212-227Conference paper, Published paper (Refereed)
Abstract [en]

Multiplex networks are defined by the presence of multiple edge types. As a consequence, it is hard to produce a single visualization of a network revealing both the structure of each edge type and their mutual relationships: multiple visualization strategies are possible, depending on how each edge type should influence the position of the nodes in the sociogram. In this paper we introduce multiforce, a force-directed layout for multiplex networks where both intra-layer and inter-layer relationships among nodes are used to compute node coordinates. Despite its simplicity, our algorithm can reproduce the main existing approaches to draw multiplex sociograms, and also supports a new intermediate type of layout. Our experiments on real data show that multiforce enables layered visualizations where each layer represents an edge type, nodes are well aligned across layers and the internal layout of each layer highlights the structure of the corresponding edge type.

Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science, E-ISSN 1611-3349 ; 0302-9743
Keywords
Visualization, Multiplex network, Layout, Force-directed
National Category
Other Computer and Information Science Computer Sciences
Identifiers
urn:nbn:se:uu:diva-368790 (URN)10.1007/978-3-030-01129-1_13 (DOI)000476935500013 ()978-3-030-01128-4 (ISBN)978-3-030-01129-1 (ISBN)
Conference
10th International Conference on Social Informatics (SocInfo), SEP 25-28, 2018, St Petersburg, RUSSIA
Funder
EU, Horizon 2020, 732027
Available from: 2018-12-07 Created: 2018-12-07 Last updated: 2019-08-22Bibliographically approved
Vega, D. & Magnani, M. (2018). Foundations of Temporal Text Networks. Applied Network Science, 3(25)
Open this publication in new window or tab >>Foundations of Temporal Text Networks
2018 (English)In: Applied Network Science, Vol. 3, no 25Article in journal (Refereed) Published
Abstract [en]

Three fundamental elements to understand human information networks are the individuals (actors) in the network, the information they exchange, that is often observable online as text content (emails, social media posts, etc.), and the time when these exchanges happen. An extremely large amount of research has addressed some of these aspects either in isolation or as combinations of two of them. There are also more and more works studying systems where all three elements are present, but typically using ad hoc models and algorithms that cannot be easily transfered to other contexts. To address this heterogeneity, in this article we present a simple, expressive and extensible model for temporal text networks, that we claim can be used as a common ground across different types of networks and analysis tasks, and we show how simple procedures to produce views of the model allow the direct application of analysis methods already developed in other domains, from traditional data mining to multilayer network mining.

National Category
Other Computer and Information Science
Identifiers
urn:nbn:se:uu:diva-368785 (URN)0.1007/s41109-018-0082-3 (DOI)
Funder
EU, Horizon 2020, 727040
Available from: 2018-12-07 Created: 2018-12-07 Last updated: 2019-01-30Bibliographically approved
Hanteer, O., Rossi, L., Vega, D. & Magnani, M. (2018). From Interaction to Participation: The Role of the Imagined Audience in Social Media Community Detection and an Application to Political Communication on Twitter. In: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM): . Paper presented at IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM),Barcelona, Spain, August 28-31, 2018 (pp. 531-534). IEEE Computer Society
Open this publication in new window or tab >>From Interaction to Participation: The Role of the Imagined Audience in Social Media Community Detection and an Application to Political Communication on Twitter
2018 (English)In: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), IEEE Computer Society , 2018, p. 531-534Conference paper, Published paper (Refereed)
Abstract [en]

In the context of community detection in online social media, a lot of effort has been put into the definition of sophisticated network clustering algorithms and much less on the equally crucial process of obtaining high-quality input data. User-interaction data explicitly provided by social media platforms has largely been used as the main source of data because of its easy accessibility. However, this data does not capture a fundamental and much more frequent type of participatory behavior where users do not explicitly mention others but direct their messages to an invisible audience following a common hashtag. In the context of multiplex community detection, we show how to construct an additional data layer about user participation not relying on explicit interactions between users, and how this layer can be used to find different types of communities in the context of Twitter political communication.

Place, publisher, year, edition, pages
IEEE Computer Society, 2018
National Category
Other Computer and Information Science
Identifiers
urn:nbn:se:uu:diva-368788 (URN)10.1109/ASONAM.2018.8508575 (DOI)000455640600086 ()978-1-5386-6051-5 (ISBN)
Conference
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM),Barcelona, Spain, August 28-31, 2018
Funder
EU, Horizon 2020, 727040
Available from: 2018-12-07 Created: 2018-12-07 Last updated: 2019-08-27Bibliographically approved
Atzmueller, M., Gaito, S., Interdonato, R., Kanawati, R., Largeron, C., Magnani, M. & Sala, A. (2018). International Workshop on Mining Attributed Networks (MATNET 2018) Chairs’ Welcome. ACM
Open this publication in new window or tab >>International Workshop on Mining Attributed Networks (MATNET 2018) Chairs’ Welcome
Show others...
2018 (English)Other (Other academic)
Place, publisher, year, pages
ACM, 2018
National Category
Other Computer and Information Science
Identifiers
urn:nbn:se:uu:diva-368786 (URN)
Available from: 2018-12-07 Created: 2018-12-07 Last updated: 2018-12-07
Tehrani, N. A. & Magnani, M. (2018). Partial and Overlapping Community Detection in Multiplex Social Networks. In: 10th International Conference on Social Informatics (SocInfo2018 ): . Paper presented at Social Informatics, September 25–28, 2018 Saint Petersburg, Russia (pp. 15-28). Springer, 11186
Open this publication in new window or tab >>Partial and Overlapping Community Detection in Multiplex Social Networks
2018 (English)In: 10th International Conference on Social Informatics (SocInfo2018 ), Springer, 2018, Vol. 11186, p. 15-28Conference paper, Published paper (Refereed)
Abstract [en]

We extend the popular clique percolation method to multiplex networks. Our extension requires to rethink the basic concepts on which the original clique percolation algorithm is based, including cliques and clique adjacency, to handle the presence of multiple types of ties. We also provide an experimental characterization of the communities that our method can identify.

Place, publisher, year, edition, pages
Springer, 2018
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11186
Keywords
Multiplex network, Community detection, Overlapping, Partial, Clique, Clique percolation
National Category
Other Computer and Information Science
Identifiers
urn:nbn:se:uu:diva-368787 (URN)10.1007/978-3-030-01159-8_2 (DOI)000476935300002 ()978-3-030-01158-1 (ISBN)978-3-030-01159-8 (ISBN)
Conference
Social Informatics, September 25–28, 2018 Saint Petersburg, Russia
Funder
EU, Horizon 2020, 727040
Available from: 2018-12-07 Created: 2018-12-07 Last updated: 2019-09-18Bibliographically approved
Brodka, P., Chmiel, A., Magnani, M. & Ragozini, G. (2018). Quantifying layer similarity in multiplex networks: a systematic study. Royal Society Open Science, 5(8), Article ID 171747.
Open this publication in new window or tab >>Quantifying layer similarity in multiplex networks: a systematic study
2018 (English)In: Royal Society Open Science, E-ISSN 2054-5703, Vol. 5, no 8, article id 171747Article in journal (Refereed) Published
Abstract [en]

Computing layer similarities is an important way of characterizing multiplex networks because various static properties and dynamic processes depend on the relationships between layers. We provide a taxonomy and experimental evaluation of approaches to compare layers in multiplex networks. Our taxonomy includes, systematizes and extends existing approaches, and is complemented by a set of practical guidelines on how to apply them.

Place, publisher, year, edition, pages
ROYAL SOC, 2018
Keywords
multiplex networks, layer similarity, network similarity, property matrix
National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-364470 (URN)10.1098/rsos.171747 (DOI)000443443000008 ()30224981 (PubMedID)
Funder
EU, Horizon 2020, 691152EU, Horizon 2020, 732027
Available from: 2018-10-31 Created: 2018-10-31 Last updated: 2018-10-31Bibliographically approved
Magnani, M. & Wasserman, S. (2017). Introduction to the special issue on multilayer networks. NETWORK SCIENCE, 5(2), 141-143
Open this publication in new window or tab >>Introduction to the special issue on multilayer networks
2017 (English)In: NETWORK SCIENCE, ISSN 2050-1242, Vol. 5, no 2, p. 141-143Article in journal, Editorial material (Other academic) Published
Place, publisher, year, edition, pages
CAMBRIDGE UNIV PRESS, 2017
National Category
Other Social Sciences not elsewhere specified
Identifiers
urn:nbn:se:uu:diva-332746 (URN)10.1017/nws.2017.15 (DOI)000402960800001 ()
Available from: 2017-11-09 Created: 2017-11-09 Last updated: 2017-11-09Bibliographically approved
Ghariblou, S., Salehi, M., Magnani, M. & Jalili, M. (2017). Shortest Paths in Multiplex Networks. Scientific Reports, 7, Article ID 2142.
Open this publication in new window or tab >>Shortest Paths in Multiplex Networks
2017 (English)In: Scientific Reports, ISSN 2045-2322, E-ISSN 2045-2322, Vol. 7, article id 2142Article in journal (Refereed) Published
Abstract [en]

The shortest path problem is one of the most fundamental networks optimization problems. Nowadays, individuals interact in extraordinarily numerous ways through their offline and online life (e.g., co-authorship, co-workership, or retweet relation in Twitter). These interactions have two key features. First, they have a heterogeneous nature, and second, they have different strengths that are weighted based on their degree of intimacy, trustworthiness, service exchange or influence among individuals. These networks are known as multiplex networks. To our knowledge, none of the previous shortest path definitions on social interactions have properly reflected these features. In this work, we introduce a new distance measure in multiplex networks based on the concept of Pareto efficiency taking both heterogeneity and weighted nature of relations into account. We then model the problem of finding the whole set of paths as a form of multiple objective decision making and propose an exact algorithm for that. The method is evaluated on five real-world datasets to test the impact of considering weights and multiplexity in the resulting shortest paths. As an application to find the most influential nodes, we redefine the concept of betweenness centrality based on the proposed shortest paths and evaluate it on a real-world dataset from two-layer trade relation among countries between years 2000 and 2015.

National Category
Computer Sciences
Identifiers
urn:nbn:se:uu:diva-348806 (URN)10.1038/s41598-017-01655-x (DOI)000425896000001 ()28526822 (PubMedID)
Available from: 2018-05-04 Created: 2018-05-04 Last updated: 2018-05-04Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0002-3437-9018

Search in DiVA

Show all publications