Portal

The MaRDI Portal

Your Portal to Open Math Research Data

About Us

Welcome to the MaRDI Portal of the NFDI.

Here, you can query our mathematical research data knowledge graph. Please keep in mind that this page is still in an early stage of development. Currently, supported data sources: DLMF, CRAN, PolyDB, swMATH (partially), zbMATH (partially).

We are supporting the open-source idea - you can find our source code repositories here. The technical documentation can be found here. Or, maybe you want to read about our personas - some fictional characters that embody the distinct goals, motivations, and challenges of our users. If you have further questions or recommendations, you can find ways to contact us here.

MaRDI Task Areas

The MaRDI project is organized into the following task areas:

• Research Areas
  • TA1: Computer Algebra
  • TA2: Scientific Computing
  • TA3: Statistics and Machine Learning
  • TA4: Cooperation with Other Disciplines
• Outreach
  • TA5: The MaRDI Portal
  • TA6: Data Culture and Community Integration
• Governance
  • TA7: Governance and Consortium Management

Examples

Some Example Queries

• Content Pages
  • Person
  • Publication
  • Software
  • Dataset
• Communities
  • Math+
• DLMF formulae
  • that contain sine and tangent functions
  • that depend indirectly on the gamma function
• swMATH software
• Examples through our Scholia extension:
  • Explore a topic, here: Ricci curvature
  • Explore an organisation, here: European Mathematical Society
  • Explore a researcher, here: Fan Chung
  • Explore a paper, here: Kaplan and Meier, 1958 — Nonparametric Estimation from Incomplete Observations

Paper of the day

Discover today's highlight:

Model-based clustering of multiple networks with a hierarchical algorithm

Summary:
This paper introduces a hierarchical algorithm for clustering multiple networks, even when these networks vary in size and do not share the same vertices. The method uses a statistical model-based approach, leveraging stochastic block models (SBMs) to group networks with similar topological structures. Clustering is achieved by maximizing the integrated classification likelihood (ICL) criterion, with an automated selection of the optimal number of clusters. A novel technique is presented to address label-switching issues in SBMs by comparing graphons, enabling accurate aggregation of clusters. The method is evaluated on synthetic data and applied to ecological food web networks, demonstrating its efficiency, interpretability, and robustness compared to existing graph clustering approaches.

Easy summary:
This paper explains a way to group networks, like maps of connections between people or animals, based on how their structure is similar. It uses a smart math-based method called stochastic block models (SBMs) to figure out these groups automatically. The process builds a tree-like diagram (dendrogram) to show how the networks are connected and picks the best number of groups without guessing. A special trick compares parts of the networks to make sure the grouping is accurate, even if the networks are labeled differently. This method was tested on fake data and real examples, like food chains in nature, and worked better than older techniques.

Read more about it on the MaRDI portal: https://portal.mardi4nfdi.de/wiki/Publication:57414

Read more about it on arXiv: https://doi.org/10.48550/arXiv.2211.02314

(Hint: The summaries are AI generated and might contain errors.)

632834814

Triples

1265489

Humans

44542

swMATH Items

4842697

zbMath Open Articles

757126

arXiv Preprints

5496

OpenML Datasets

4

Services

More Statistics

Triples	632834814
zbMATH Open articles	4842697
humans	1265489
zbMATH Open authors	1199277
arXiv	757126
Wikidata items	499714
swMATH	44542
CRAN packages	21260
DLMF	12564
Datasets	5496
PolyDB collections	21