<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality</dc:title>
   	<dc:creator>Mahini, Mohammad</dc:creator>
   	<dc:creator>Beigy, Hamid</dc:creator>
   	<dc:creator>Qadami, Salman</dc:creator>
   	<dc:creator>Saghafian, Morteza</dc:creator>
   	<dc:description>Simplets are elementary units within simplicial complexes and are fundamental for analyzing the structure of simplicial complexes. Previous efforts have mainly focused on accurately counting or approximating the number of simplets rather than studying their frequencies. However, analyzing simplet frequencies is more practical for large-scale simplicial complexes. This paper introduces the Simplet Frequency Distribution (SFD) vector, which enables the analysis of simplet frequencies in simplicial complexes. Additionally, we provide a bound on the sample complexity required to approximate the SFD vector using any uniform sampling-based algorithm accurately. We extend the definition of simplet frequency distribution to encompass simplices, allowing for the analysis of simplet frequencies within simplices of simplicial complexes. This paper introduces the Simplet Degree Vector (SDV) and the Simplet Degree Centrality (SDC), facilitating this analysis for each simplex. Furthermore, we present a bound on the sample complexity required for accurately approximating the SDV and SDC for a set of simplices using any uniform sampling-based algorithm. We also introduce algorithms for approximating SFD, geometric SFD, SDV, and SDC. We also validate the theoretical bounds with experiments on random simplicial complexes and demonstrate the practical application through a case study.</dc:description>
   	<dc:publisher>Elsevier</dc:publisher>
   	<dc:date>2025</dc:date>
   	<dc:type>info:eu-repo/semantics/article</dc:type>
   	<dc:type>doc-type:article</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_2df8fbb1</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/19937</dc:identifier>
   	<dc:source>Mahini M, Beigy H, Qadami S, Saghafian M. Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality. &lt;i&gt;Information Sciences&lt;/i&gt;. 2025;719(11). doi:&lt;a href=&quot;https://doi.org/10.1016/j.ins.2025.122425&quot;&gt;10.1016/j.ins.2025.122425&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ins.2025.122425</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/issn/0020-0255</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/wos/001516170500002</dc:relation>
   	<dc:rights>info:eu-repo/semantics/closedAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
