Tootfinder

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 346 nodes and 26832 edges.
Tags: Informational, Web gr…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16726 nodes and 47594 edges.
Tags: Social, Collaboratio…

My attempt to bike 1,000 miles this year is going well! And I also learned how to make bar graphs in Python...
➡️ #bike

Miles Biked (so far)…
Sometimes I set goals...

Oh yes... not one, but two #Mordor towers in the usage graphs. Can somebody please throw that #AI ring in Mount Doom?

The stability of bi-polarization on dynamical directed graphs: an emergent game perspective
Yakun Wang, Yuan Liu, Bin Wu
https://arxiv.org/abs/2507.08449 h…

The stability of bi-polarization on dynamical directed graphs: an emergent game perspective
This paper proposes a co-evolutionary model of directed graphs and three opinions, i.e., conservative$(+)$, neutral$(\odot)$ and liberal$(-)$. Agents update both opinions and social relationships with bias. We find that an emergent game suffices to predict the stability of bi-polarization under a rare opinion updating limit and a large system size limit. The bi-polarization is stable if and only if the emergent game has an internal Nash equilibrium. The necessary and sufficient condition is exp…

LLMs are starving for knowledge graphs. Raphael Troncy was pointing out that many LLM company crawlers are constantly visiting their KGs. Some crawlers even perform explicit SPARQL queries on the KGs.
#knowledgegraphs #eswc2025

#Anthropic #opensources circuit tracing method to reveal how large language models make decisions internally
🔍 Generate attribution graphs showing step-by-step model reasoning processes
🧵👇#research

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 34 nodes and 96 edges.
Tags: Social, Fictional, Weighted

Estimating Interventional Distributions with Uncertain Causal Graphs through Meta-Learning
Anish Dhir, Cristiana Diaconu, Valentinian Mihai Lungu, James Requeima, Richard E. Turner, Mark van der Wilk
https://arxiv.org/abs/2507.05526

Estimating Interventional Distributions with Uncertain Causal Graphs through Meta-Learning
In scientific domains -- from biology to the social sciences -- many questions boil down to \textit{What effect will we observe if we intervene on a particular variable?} If the causal relationships (e.g.~a causal graph) are known, it is possible to estimate the intervention distributions. In the absence of this domain knowledge, the causal structure must be discovered from the available observational data. However, observational data are often compatible with multiple causal graphs, making met…

Graph signal aware decomposition of dynamic networks via latent graphs
Bishwadeep Das, Andrei Buciulea, Antonio G. Marques, Elvin Isufi
https://arxiv.org/abs/2506.08519

Graph signal aware decomposition of dynamic networks via latent graphs
Dynamics on and of networks refer to changes in topology and node-associated signals, respectively and are pervasive in many socio-technological systems, including social, biological, and infrastructure networks. Due to practical constraints, privacy concerns, or malfunctions, we often observe only a fraction of the topological evolution and associated signal, which not only hinders downstream tasks but also restricts our analysis of network evolution. Such aspects could be mitigated by moving …

My little dude always asking about weather and how it works and wants to see graphs.
So got a little Ambient Weather weather station and have to say it’s quite a nice thing. Enough detail, clearly presented, should be able to have some good times learning about the weather.
Also got grandad one about hours drive away by the coast so can do some comparisons
Has a nice indoor display too.

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
Mohammad Dindoost, Oliver Alvarado Rodriguez, Bartosz Bryg, Ioannis Koutis, David A. Bader
https://arxiv.org/abs/2507.04130

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
Subgraph isomorphism, essential for pattern detection in large-scale graphs, faces scalability challenges in attribute-rich property graphs used in neuroscience, systems biology, and social network analysis. Traditional algorithms explore search spaces vertex-by-vertex from empty mappings, leading to extensive early-stage exploration with limited pruning opportunities. We introduce HiPerMotif, a novel hybrid parallel algorithm that fundamentally shifts the search initialization strategy. After …

Medium writer Paolo Perrone curates a short list of interesting algorithms, the rationale behind them, along with graphs and diagrams to boot.
Algorithms that made this short list:
Wave Function Collapse
The Diffusion Model
Simulated Annealing
Sleep Sort
BOGO Sort
BOID
SHOR’s
Marching Cubes
Practical Byzantine Fault Tolerance and,
Boyer Moore
"The 10 Weirdest, Most Brilliant Algorithms Ever Devised and What They Actually Do&…

10 Weirdest Algorithms That Changed Tech Forever | Data Science Collective
Discover 10 unusual algorithms that defied logic, broke rules, and transformed the way we think about technology and problem-solving.

❓ Wusstet ihr, dass ihr Metadaten in den Culture Knowledge Graph aufnehmen könnt?
💡 Eine kürzlich erschienene Guideline beschreibt mögliche Integrationswege und bietet grundlegende Hinweise zum Verständnis des Culture Knowledge Graphs.
➡️ Ihr findet die Handreichung in der deutschen und englischen Version auf unserer Knowledge Base:

Friends Don't Let Friends Make Bad Graphs! Do you agree with the examples of bad graphs and the alternatives Chenxin Li (@chenxinli2.bsky.social) lists at https://github.com/cxli233/FriendsDontLetFriends

GitHub - cxli233/FriendsDontLetFriends: Friends don't let friends make certain types of data visualization - What are they and why are they bad.
Friends don't let friends make certain types of data visualization - What are they and why are they bad. - GitHub - cxli233/FriendsDontLetFriends: Friends don't let friends make certain ty...

In his keynote, Raphael Troncy is asking whether we should keep building knowledge graphs....taking into account 20 years of experience in building knowledge graphs
https://2025.eswc-conferences.org/keynotes-announcement-raphael-troncy/

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 20906 nodes and 85988 edges.
Tags: Technological, Communication, Unweighted, Temporal

Graph-based Fake Account Detection: A Survey
Ali Safarpoor Dehkordi, Ahad N. Zehmakan
https://arxiv.org/abs/2507.06541 https://arxiv.…

Graph-based Fake Account Detection: A Survey
In recent years, there has been a growing effort to develop effective and efficient algorithms for fake account detection in online social networks. This survey comprehensively reviews existing methods, with a focus on graph-based techniques that utilise topological features of social graphs (in addition to account information, such as their shared contents and profile data) to distinguish between fake and real accounts. We provide several categorisations of these methods (for example, based on…

🌐 Interactive #Neuronpedia frontend for exploring graphs with popular #opensource models
🧪 Test hypotheses by modifying feature values and observing output changes
📊 Study multi-step reasoning and multilingual representations in

What's going on with this #ICLR paper?
The metareview says that the authors provided a sound rebuttal and update to the paper, but neither are available (rebuttals are shown on other papers).
https://openreview.…

GLoRa: A Benchmark to Evaluate the Ability to Learn Long-Range...
Learning on graphs is one of the most active research topics in machine learning (ML). Among the key challenges in this field, effectively learning long-range dependencies in graphs has been...

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3210 nodes and 6157 edges.
Tags: Technological, Communication, Unweighted, Temporal

Historical Contingencies Steer the Topology of Randomly Assembled Graphs
Cole Mathis, Harrison B. Smith
https://arxiv.org/abs/2507.00335 https://

Historical Contingencies Steer the Topology of Randomly Assembled Graphs
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties, and allow for sampling from distinct ensembles. Here we introduce a new random graph model, inspired by assembly theory, and characterize the graphs it generates. We show that graphs generated using our method represent a diverse ensemble, characterized by a br…

❓ Wusstet ihr, dass ihr Metadaten in den Culture Knowledge Graph aufnehmen könnt?
💡 Eine kürzlich erschienene Guideline beschreibt mögliche Integrationswege und bietet grundlegende Hinweise zum Verständnis des Culture Knowledge Graphs.
➡️ Ihr findet die Handreichung in der deutschen und englischen Version auf unserer Knowledge Base:

At the Semantic Digital Humanities 2025 Workshop, Jose Maldonado-Rodríguez is presenting "Natural Language Querying for Humanities #KnowledgeGraphs A case study on the GOLEM KG". Main contribution is a bilingual dataset (English-Spanish) specifically designed to evaluate automatic text-to-SPARQL translation systems for GOLEM, a specialized humanities KG.
paper:

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 40421 nodes and 175692 edges.
Tags: Social, Collaborati…

This https://arxiv.org/abs/2412.11369 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

PSGraph: Differentially Private Streaming Graph Synthesis by Considering Temporal Dynamics
Streaming graphs are ubiquitous in daily life, such as evolving social networks and dynamic communication systems. Due to the sensitive information contained in the graph, directly sharing the streaming graphs poses significant privacy risks. Differential privacy, offering strict theoretical guarantees, has emerged as a standard approach for private graph data synthesis. However, existing methods predominantly focus on static graph publishing, neglecting the intrinsic relationship between adjac…

Enhancing Swarms Durability to Threats via Graph Signal Processing and GNN-based Generative Modeling
Jonathan Karin, Zoe Piran, Mor Nitzan
https://arxiv.org/abs/2507.03039

Enhancing Swarms Durability to Threats via Graph Signal Processing and GNN-based Generative Modeling
Swarms, such as schools of fish or drone formations, are prevalent in both natural and engineered systems. While previous works have focused on the social interactions within swarms, the role of external perturbations--such as environmental changes, predators, or communication breakdowns--in affecting swarm stability is not fully understood. Our study addresses this gap by modeling swarms as graphs and applying graph signal processing techniques to analyze perturbations as signals on these grap…

Visualize dependencies between functions: #rstats

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

Understanding the Effect of Knowledge Graph Extraction Error on Downstream Graph Analyses: A Case Study on Affiliation Graphs
Erica Cai, Brendan O'Connor
https://arxiv.org/abs/2506.12367

Understanding the Effect of Knowledge Graph Extraction Error on Downstream Graph Analyses: A Case Study on Affiliation Graphs
Knowledge graphs (KGs) are useful for analyzing social structures, community dynamics, institutional memberships, and other complex relationships across domains from sociology to public health. While recent advances in large language models (LLMs) have improved the scalability and accessibility of automated KG extraction from large text corpora, the impacts of extraction errors on downstream analyses are poorly understood, especially for applied scientists who depend on accurate KGs for real-wo…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

"Learn how to see. Realize that everything connects to everything else", but how to do this with Linked Data? Eero Hyvönen is quoting Leonardo Da Vinci as an intro to his presentation "How to Create a Portal for Digital Humanities Research Using a Linked Open Data Cloud of Cultural Heritage Knowledge Graphs: Case SampoSampo"
paper:

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…

In today's ISE 2025 lecture,, we will introduce SPARQL as a query language for knowledge graphs. Again, I'm trying out 'Dystopian Novels' as example knowledge graph playground. Let's see, if the students might know any of them. Wtat do you think? ;-)
#dystopia #literature

Compressing Hypergraphs using Suffix Sorting
Enno Adler, Stefan B\"ottcher, Rita Hartel
https://arxiv.org/abs/2506.05023 https://

Compressing Hypergraphs using Suffix Sorting
Hypergraphs model complex, non-binary relationships like co-authorships, social group memberships, and recommendations. Like traditional graphs, hypergraphs can grow large, posing challenges for storage, transmission, and query performance. We propose HyperCSA, a novel compression method for hypergraphs that maintains support for standard queries over the succinct representation. HyperCSA achieves compression ratios of 26% to 79% of the original file size on real-world hypergraphs - outperformi…

This https://arxiv.org/abs/2311.16139 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

GNNBleed: Inference Attacks to Unveil Private Edges in Graphs with Realistic Access to GNN Models
Graph Neural Networks (GNNs) have become indispensable tools for learning from graph structured data, catering to various applications such as social network analysis and fraud detection for financial services. At the heart of these networks are the edges, which are crucial in guiding GNN models' predictions. In many scenarios, these edges represent sensitive information, such as personal associations or financial dealings, which require privacy assurance. However, their contributions to GNN mo…

Expanders in Models of Social Networks
Marc Kaufmann, Johannes Lengler, Ulysse Schaller, Konstantin Sturm
https://arxiv.org/abs/2506.19485 https://

Expanders in Models of Social Networks
A common model for social networks are Geometric Inhomogeneous Random Graphs (GIRGs), in which vertices draw a random position in some latent geometric space, and the probability of two vertices forming an edge depends on their geometric distance. The geometry may be modelled in two ways: either two points are defined as close if they are similar in all dimensions, or they are defined as close if they are similar in some dimensions. The first option is mathematically more natural since it can b…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 19489 nodes and 79718 edges.
Tags: Technological, Communication, Unweighted, Temporal

NFDI4DS is hosting its second Summer School on Artificial Intelligence and Knowledge Graphs for Scholarly Data (AIKG-SD 2025) 🥳
This year's theme: “Research Towards Sustainable Societies”
🗣 Keynotes & Interactive Tutorials
☕ Networking
🏆 Poster Session & Best Poster Award
September 23/24, 2025
Leuphana University Lüneburg
Application deadline: June 27, 2025!

AIKG-SD 2025
AIKG-SD 2025: Research Towards Sustainable Societies ! Now accepting submissions ! NFDI4DataScience and the AIX Lab at Leuphana University Lüneburg is hosting its second summer school on Artificial Intelligence and Knowledge Graphs for Scholarly Data. Join us for two days of interesting discussions

Online matching on stochastic block model
Maria Cherifa (MAP5, CREST), Cl\'ement Calauz\`enes (CREST), Vianney Perchet (CREST)
https://arxiv.org/abs/2506.04921

Online matching on stochastic block model
While online bipartite matching has gained significant attention in recent years, existing analyses in stochastic settings fail to capture the performance of algorithms on heterogeneous graphs, such as those incorporating inter-group affinities or other social network structures. In this work, we address this gap by studying online bipartite matching within the stochastic block model (SBM). A fixed set of offline nodes is matched to a stream of online arrivals, with connections governed probabi…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

Shortest Paths in a Weighted Simplicial Complex
Sukrit Chakraborty, Prasanta Choudhury, Arindam Mukherjee
https://arxiv.org/abs/2506.12921 https://

Shortest Paths in a Weighted Simplicial Complex
Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are mono-dimensional simplicial complex. Graph theory has application in topics like theoretical computer science, operations research, bioinformatics and social sciences. This makes it natural to try to adapt graph-theoretic results for simplicial complexes, wh…

Xenophobia based on a few attributes can impede society's cohesiveness
Alejandro Castro, Tuan Minh Pham, Ernesto Ortega, David Machado
https://arxiv.org/abs/2506.18513

Xenophobia based on a few attributes can impede society's cohesiveness
Xenophobic interactions play a role as important as homophilic ones in shaping many dynamical processes on social networks, such as opinion formation, social balance, or epidemic spreading. In this paper, we use belief propagation and Monte Carlo simulations on tree-like signed graphs to predict that a sufficient propensity to xenophobia can impede a consensus that would otherwise emerge via a phase transition. As the strength of xenophobic interactions and the rationality of individuals with r…

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 3414 nodes and 6574 edges.
Tags: Technological, Communication, Unweighted, Temporal

Bridging the Narrative Divide: Cross-Platform Discourse Networks in Fragmented Ecosystems
Patrick Gerard, Hans W. A. Hanley, Luca Luceri, Emilio Ferrara
https://arxiv.org/abs/2505.21729

Bridging the Narrative Divide: Cross-Platform Discourse Networks in Fragmented Ecosystems
Political discourse has grown increasingly fragmented across different social platforms, making it challenging to trace how narratives spread and evolve within such a fragmented information ecosystem. Reconstructing social graphs and information diffusion networks is challenging, and available strategies typically depend on platform-specific features and behavioral signals which are often incompatible across systems and increasingly restricted. To address these challenges, we present a platform…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 8361 nodes and 15751 edges.
Tags: Social, Collaboration…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 16706 nodes and 121251 edges.
Tags: Social, Collaborati…

arxiv_collab: Scientific collaborations in physics (1995-2005)
Collaboration graphs for scientists, extracted from the Los Alamos e-Print arXiv (physics), for 1995-1999 for three categories, and additionally for 1995-2003 and 1995-2005 for one category. For copyright reasons, the MEDLINE (biomedical research) and NCSTRL (computer science) collaboration graphs from this paper are not publicly available.
This network has 31163 nodes and 120029 edges.
Tags: Social, Collaborati…

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 23072 nodes and 78684 edges.
Tags: Technological, Communication, Unweighted, Temporal

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 25 nodes and 91 edges.
Tags: Social, Fictional, Weighted

This https://arxiv.org/abs/2502.03663 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Fast Geographic Routing in Fixed-Growth Graphs
In the 1960s, the social scientist Stanley Milgram performed his famous "small-world" experiments where he found that people in the US who are far apart geographically are nevertheless connected by remarkably short chains of acquaintances. Since then, there has been considerable work to design networks that accurately model the phenomenon that Milgram observed. One well-known approach was Barab{á}si and Albert's preferential attachment model, which has small diameter yet lacks an algorithm tha…

moviegalaxies: Moviegalaxies, movies 410-466 (2018)
Social graphs for over 700 movies from the moviegalaxies.com website. Each node represents a character in a movie and each edge is a same-scene appearance between two characters in that movie. The weight gives the number of same-scene appearances. Networks are extracted from movie scripts automatically.
This network has 35 nodes and 89 edges.
Tags: Social, Fictional, Weighted

route_views: Route Views AS graphs (1997-1998)
733 daily network snapshots denoting BGP traffic among autonomous systems (ASs) on the Internet, from the Oregon Route Views Project, spanning 8 November 1997 to 2 January 2000. Data collected by NLANR/MOAT.
This network has 5016 nodes and 10542 edges.
Tags: Technological, Communication, Unweighted, Temporal

caida_as: CAIDA AS graphs (2004-2007)
A sequence of 122 network snapshots denoting Autonomous System (AS) relationships on the Internet, from 2004-2007, inferred using the Serial-1 method from RouteViews BGP table snapshots and a set of heuristics.
This network has 20344 nodes and 81882 edges.
Tags: Technological, Communication, Unweighted, Temporal

Properties and Expressivity of Linear Geometric Centralities
Paolo Boldi, Flavio Furia, Chiara Prezioso
https://arxiv.org/abs/2506.19670 https://

Properties and Expressivity of Linear Geometric Centralities
Centrality indices are used to rank the nodes of a graph by importance: this is a common need in many concrete situations (social networks, citation networks, web graphs, for instance) and it was discussed many times in sociology, psychology, mathematics and computer science, giving rise to a whole zoo of definitions of centrality. Although they differ widely in nature, many centrality measures are based on shortest-path distances: such centralities are often referred to as geometric. Geometric…