Image de couverture de livre

A political radicalization framework based on Moral Foundations Theory

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Interian, Ruben
Format:	Preprint
Publié:	2024
Sujets:	Social and Information Networks Physics and Society 05C69, 05C90 J.4; G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On treewidth and maximum cliques
par: Chudnovsky, Maria, et autres
Publié: (2024)

Perfect codes in Cayley graphs of Hajós groups
par: Hafidh, Yusuf, et autres
Publié: (2025)

LOFA: Online Influence Maximization under Full-Bandit Feedback using Lazy Forward Selection
par: Xu, Jinyu, et autres
Publié: (2026)

Independent Locating-Dominating Sets in Pseudotrees
par: Cáceres, José, et autres
Publié: (2026)

Community Detection using Fortunato's Performance Measure
par: Thakar, Srushti, et autres
Publié: (2025)

How Local Separators Shape Community Structure in Large Networks
par: Frenkel, Sarah, et autres
Publié: (2025)

A Quick Framework for Evaluating Worst Robustness of Complex Networks
par: Jiang, Wenjun, et autres
Publié: (2024)

Deep learning framework for predicting stochastic take-off and die-out of early spreading
par: He, Wenchao, et autres
Publié: (2025)

Drilling into Erasmus learning mobility flows between countries 2014-2024
par: Batagelj, Vladimir
Publié: (2025)

Heaven & Hell: One-Step Hub Consensus
par: Aghanya, Nnamdi Daniel
Publié: (2025)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
par: Koutsoutis, Alex, et autres
Publié: (2025)

A note on locating-dominating sets in twin-free graphs
par: Bousquet, Nicolas, et autres
Publié: (2024)

Generalized Friendship Paradoxes in Network Science
par: Higham, Desmond J., et autres
Publié: (2025)

A Community-Aware Framework for Influence Maximization with Explicit Accounting for Inter-Community Influence
par: Robson, Eliot W., et autres
Publié: (2025)

A Lower bound for Secure Domination Number of an Outerplanar Graph
par: Araki, Toru
Publié: (2024)

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
par: Gartland, Peter, et autres
Publié: (2023)

On non-planar, cycle-conformal graphs
par: Gorsky, Maximilian, et autres
Publié: (2026)

On the effect of the average clustering coefficient on topology-based link prediction in featureless graphs
par: Rafiepour, Mehrdad, et autres
Publié: (2025)

Robust Markov stability for community detection at a scale learned based on the structure
par: Aref, Samin, et autres
Publié: (2025)

Secure Total Domination Number in Maximal Outerplanar Graphs
par: Aita, Yasufumi, et autres
Publié: (2024)

Sigma index in Trees with Given Degree Sequences
par: Hamoud, Jasem, et autres
Publié: (2024)

On 1-Konig-Egervary Graphs
par: Levit, Vadim E., et autres
Publié: (2023)

Graphs with core(G) = nucleus(G)
par: Levit, Vadim E., et autres
Publié: (2026)

New Optimal Results on Codes for Location in Graphs
par: Junnila, Ville, et autres
Publié: (2023)

Finding Influential Cores via Normalized Ricci Flows in Directed and Undirected Hypergraphs with Applications
par: Sengupta, Prithviraj, et autres
Publié: (2025)

Mixbiotic society measures: Assessment of community well-going as living system
par: Kato, Takeshi, et autres
Publié: (2023)

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

A new density limit for unanimity in majority dynamics on random graphs
par: Kim, Jeong Han, et autres
Publié: (2025)

On the characterization of graphs with tree 3-spanners
par: Lin, Lan, et autres
Publié: (2025)

Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
par: Hoang, Do Trong, et autres
Publié: (2024)

Topological Indices With Degree Sequence $\mathscr{D}$ of Tree
par: Hamoud, Jasem, et autres
Publié: (2025)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
par: Aref, Samin, et autres
Publié: (2025)

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
par: Battista, Federico, et autres
Publié: (2024)

Comprehensive Analysis of Network Robustness Evaluation Based on Convolutional Neural Networks with Spatial Pyramid Pooling
par: Jiang, Wenjun, et autres
Publié: (2023)

Recognizing Relating Edges in Graphs without Cycles of Length 6
par: Levit, Vadim E., et autres
Publié: (2024)

Domination and packing in graphs
par: Gómez, Renzo, et autres
Publié: (2024)

Quasi-kernels in split graphs
par: Langlois, Hélène, et autres
Publié: (2023)

Calculating the maximum number of maximum cliques for simple graphs
par: Pfeifer, Dániel
Publié: (2023)

Dynamic programming on bipartite tree decompositions
par: Jaffke, Lars, et autres
Publié: (2023)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
par: Morelle, Laure, et autres
Publié: (2025)