Pub Date : 2024-07-22DOI: 10.1007/s41109-024-00645-z
Sanaa Hmaida, H. Cherifi, Mohammed El Hassouni
{"title":"A multilevel backbone extraction framework","authors":"Sanaa Hmaida, H. Cherifi, Mohammed El Hassouni","doi":"10.1007/s41109-024-00645-z","DOIUrl":"https://doi.org/10.1007/s41109-024-00645-z","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141815344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-19DOI: 10.1007/s41109-024-00643-1
Pietro Gravino, Giulio Prevedello, Emanuele Brugnoli
{"title":"Online news ecosystem dynamics: supply, demand, diffusion, and the role of disinformation","authors":"Pietro Gravino, Giulio Prevedello, Emanuele Brugnoli","doi":"10.1007/s41109-024-00643-1","DOIUrl":"https://doi.org/10.1007/s41109-024-00643-1","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141823775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-16DOI: 10.1007/s41109-024-00647-x
Abida Sadaf, Luke Mathieson, Piotr Bródka, Katarzyna Musial
{"title":"A bridge between influence models and control methods","authors":"Abida Sadaf, Luke Mathieson, Piotr Bródka, Katarzyna Musial","doi":"10.1007/s41109-024-00647-x","DOIUrl":"https://doi.org/10.1007/s41109-024-00647-x","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141643934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-23DOI: 10.1007/s41109-024-00624-4
Masaki Chujyo, F. Toriumi
{"title":"Link-limited bypass rewiring for enhancing the robustness of complex networks","authors":"Masaki Chujyo, F. Toriumi","doi":"10.1007/s41109-024-00624-4","DOIUrl":"https://doi.org/10.1007/s41109-024-00624-4","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141103599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-04-23DOI: 10.1007/s41109-024-00617-3
Archana Babu, Sunil Jacob John
{"title":"Persistent homology based Bottleneck distance in hypergraph products","authors":"Archana Babu, Sunil Jacob John","doi":"10.1007/s41109-024-00617-3","DOIUrl":"https://doi.org/10.1007/s41109-024-00617-3","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140668453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-18DOI: 10.1007/s41109-024-00614-6
Anna Lena Fehlhaber, Usama El-Awad
{"title":"Trust development in online competitive game environments: a network analysis approach","authors":"Anna Lena Fehlhaber, Usama El-Awad","doi":"10.1007/s41109-024-00614-6","DOIUrl":"https://doi.org/10.1007/s41109-024-00614-6","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140231465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-10DOI: 10.1007/s41109-023-00608-w
Pedro Ramaciotti, Duncan Cassells, Zografoula Vagena, Jean-Philippe Cointet, Michael Bailey
{"title":"American politics in 3D: measuring multidimensional issue alignment in social media using social graphs and text data","authors":"Pedro Ramaciotti, Duncan Cassells, Zografoula Vagena, Jean-Philippe Cointet, Michael Bailey","doi":"10.1007/s41109-023-00608-w","DOIUrl":"https://doi.org/10.1007/s41109-023-00608-w","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139440546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-01Epub Date: 2024-04-30DOI: 10.1007/s41109-024-00620-8
H Robert Frost
We present a novel approach for computing a variant of eigenvector centrality for multilayer networks with inter-layer constraints on node importance. Specifically, we consider a multilayer network defined by multiple edge-weighted, potentially directed, graphs over the same set of nodes with each graph representing one layer of the network and no inter-layer edges. As in the standard eigenvector centrality construction, the importance of each node in a given layer is based on the weighted sum of the importance of adjacent nodes in that same layer. Unlike standard eigenvector centrality, we assume that the adjacency relationship and the importance of adjacent nodes may be based on distinct layers. Importantly, this type of centrality constraint is only partially supported by existing frameworks for multilayer eigenvector centrality that use edges between nodes in different layers to capture inter-layer dependencies. For our model, constrained, layer-specific eigenvector centrality values are defined by a system of independent eigenvalue problems and dependent pseudo-eigenvalue problems, whose solution can be efficiently realized using an interleaved power iteration algorithm. We refer to this model, and the associated algorithm, as the Constrained Multilayer Centrality (CMLC) method. The characteristics of this approach, and of standard techniques based on inter-layer edges, are demonstrated on both a simple multilayer network and on a range of random graph models. An R package implementing the CMLC method along with example vignettes is available at https://hrfrost.host.dartmouth.edu/CMLC/.
我们提出了一种计算多层网络特征向量中心性变体的新方法，这种网络具有层间节点重要性约束。具体来说，我们考虑的多层网络是由同一节点集上的多个边缘加权、可能有向的图定义的，每个图代表网络的一层，且没有层间边缘。与标准特征向量中心性结构一样，给定层中每个节点的重要性基于同一层中相邻节点重要性的加权和。与标准特征向量中心性不同的是，我们假设相邻节点的邻接关系和重要性可能基于不同的层。重要的是，现有的多层特征向量中心性框架仅部分支持这种类型的中心性约束，这些框架使用不同层中节点之间的边来捕捉层间依赖关系。在我们的模型中，有约束的、特定层的特征向量中心性值是由独立特征值问题和依赖伪特征值问题系统定义的，其解决方案可以通过交错幂迭代算法有效实现。我们将这一模型和相关算法称为约束多层中心性（CMLC）方法。我们在一个简单的多层网络和一系列随机图模型上展示了这种方法的特点，以及基于层间边缘的标准技术的特点。实现 CMLC 方法的 R 软件包和示例可在 https://hrfrost.host.dartmouth.edu/CMLC/ 上获取。
{"title":"A generalized eigenvector centrality for multilayer networks with inter-layer constraints on adjacent node importance.","authors":"H Robert Frost","doi":"10.1007/s41109-024-00620-8","DOIUrl":"10.1007/s41109-024-00620-8","url":null,"abstract":"<p><p>We present a novel approach for computing a variant of eigenvector centrality for multilayer networks with inter-layer constraints on node importance. Specifically, we consider a multilayer network defined by multiple edge-weighted, potentially directed, graphs over the same set of nodes with each graph representing one layer of the network and no inter-layer edges. As in the standard eigenvector centrality construction, the importance of each node in a given layer is based on the weighted sum of the importance of adjacent nodes in that same layer. Unlike standard eigenvector centrality, we assume that the adjacency relationship and the importance of adjacent nodes may be based on distinct layers. Importantly, this type of centrality constraint is only partially supported by existing frameworks for multilayer eigenvector centrality that use edges between nodes in different layers to capture inter-layer dependencies. For our model, constrained, layer-specific eigenvector centrality values are defined by a system of independent eigenvalue problems and dependent pseudo-eigenvalue problems, whose solution can be efficiently realized using an interleaved power iteration algorithm. We refer to this model, and the associated algorithm, as the Constrained Multilayer Centrality (CMLC) method. The characteristics of this approach, and of standard techniques based on inter-layer edges, are demonstrated on both a simple multilayer network and on a range of random graph models. An R package implementing the CMLC method along with example vignettes is available at https://hrfrost.host.dartmouth.edu/CMLC/.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11060970/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140853977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号