Portal
Portal
The MaRDI Portal
Your Portal to Open Math Research Data
Welcome to the MaRDI Portal of the NFDI.
Welcome to the MaRDI Portal — your gateway to open mathematical research data. Access our comprehensive MaRDI services. Whether you are a researcher, a student, or simply someone passionate about mathematics, the MaRDI Portal is here to support your exploration, learning, and discovery with resources tailored to diverse needs and interests.
We embrace the open-source philosophy — our source code repositories and detailed technical documentation are freely accessible. 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 offers a wide range of services:
![]() |
MediaWiki Math Search ExtensionTool/Application
The MaRDI portal team adjusted the extension for semantic formula search in the knowledge graph. The extension is used b... |
![]() |
MaRDI Packaging SystemTool/Application
MaPS helps researchers create and publish software runtimes, as well as deploy and run software inside published runtime... |
![]() |
MaRDI Knowledge GraphDatabase
The MaRDI Knowledge Graph connects over 5 million mathematical items by more than 500 million relationships from various... |
![]() |
MaRDMOTool/Application
MaRDMO is a plugin designed to streamline the documentation of workflows. Primarily utilized for Model-Simulation-Optimi... |
![]() |
MaRDI Help DeskOutreach | Support/Consulting
The MaRDI Help Desk is your first entry point to MaRDI services, support, and training. Mathematical data consultant Chr... |
![]() |
MaRDI Open InterfacesTool/Application
Software that connects different numerical packages together. Users can invoke numerical solvers written in one programm... |
![]() |
mlr3Tool/Application
mlr3 is an open-source machine learning framework in R that provides a unified interface for training, evaluating, and b... |
![]() |
MathAlgoDB Knowledge Graph for Scientific ComputingTool/Application
Algorithms are the main building blocks of scientific computing. MathAlgoDB is a knowledge graph with an underlying onto... |
![]() |
MaRDIFlowTool/Application
This computational framework abstracts multi-layered components from FAIR computational experiments through an input/out... |
![]() |
MathModDBDatabase
MathModDB is a database of mathematical models developed by the Mathematical Research Data Initiative (MaRDI). MathModDB... |
![]() |
mrdi File FormatTool/Application
The mrdi file format is a JSON based file format with the necessary structure for saving and loading common types among ... |
![]() |
Community - Graphical Modelling and Causal InferenceCurated Collection
On this platform, we curate and present topical datasets, dataset collections, and metadata.... |
![]() |
MaRDI StationOutreach | Tool/Application
The MaRDI station offers an educational, gamified approach to research data management. It comes in two versions: a port... |
![]() |
Best PracticesSupport/Consulting
MaRDI offers support and consultancy for making your own mathematics FAIR. One example is the project "small phylogeneti... |
![]() |
MaRDI Knowledge Graph Query ServiceWeb application | Tool/Application
The MaRDI Knowledge Graph Query Service is a webservice that allows to query the MaRDI Knowledge Graph using SPARQL. For... |
See here for more details: MaRDI Services
The MaRDI project is organized into the following task areas:
- Research Areas
- Outreach
- TA5: The MaRDI Portal
- TA6: Data Culture and Community Integration
- Governance
- TA7: Governance and Consortium Management
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.1007/S11222-023-10329-W