Results 61 to 70 of about 653 (189)
Matchings in hypergraphs and Castelnuovo--Mumford regularity [PDF]
Publicationes Mathematicae Debrecen, 2017 In this paper, we introduce and generalize some combinatorial invariants of graphs such as matching number and induced matching number to hypergraphs. Then we compare them together and present some upper bounds for the regularity of Stanley-Reisner ring of $Δ_{\mathcal{H}}$ for certain hypergraphs $\mathcal{H}$ in terms of the introduced matching ...
Khosh-Ahang, Fahimeh, Moradi, Somayeh
openaire +2 more sources
Tight cycles and regular slices in dense hypergraphs [PDF]
, 2017 We study properties of random subcomplexes of partitions returned by (a suitable form of) the Strong Hypergraph Regularity Lemma, which we call regular slices.
Julia Böttcher +8 more
core +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT As an attestation engagement, auditing is required to provide reasonable assurance for its conclusions. Traditional auditing has limited capacity to handle unstructured data and is usually based on audit sampling techniques, which can lead to the neglect of important audit evidence during the auditing process and result in a higher audit risk,
Xiaojia Wang, Ziqing Luo, Chaoxu Mu
wiley +1 more source
Hypergraph spectral clustering via sample self-representation
, 2016 Traditional clustering methods cluster data with pairwise graph and usually result in information loss. In this paper, we propose a novel spectral clustering method by combing hypergraph and sample self-representation together.
Zhang, S., Deng, Z., Li, Y., Cheng, D.
core +1 more source
Energy Conversion and Economics, EarlyView.Abstract An effective method for detecting cyberattacks is essential to the security of smart grids (SGs). In SGs, data from both cyber and physical domains can support attack detection. However, existing works insufficiently consider the heterogeneity, high dimensionality, and cross‐domain correlations of multi‐source data, affecting model ...
Qize Gao +5 more
wiley +1 more source
Hypergraph limits: a regularity approach
Random Struct. Algorithms, 2013 A sequence of $k$-uniform hypergraphs $H_1, H_2, \dots$ is convergent if the sequence of homomorphism densities $t(F, H_1), t(F, H_2), \dots$ converges for every $k$-uniform hypergraph $F$. For graphs, Lovász and Szegedy showed that every convergent sequence has a limit in the form of a symmetric measurable function $W \colon [0,1]^2 \to [0,1]$.
openaire +3 more sources
CLusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks
Computer Graphics Forum, EarlyView.Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci +6 more
wiley +1 more source
Journal of Time Series Analysis, EarlyView.ABSTRACT Traditional graph representations are insufficient for modelling real‐world phenomena involving multi‐entity interactions, such as collaborative projects or protein complexes, necessitating the use of hypergraphs. While hypergraphs preserve the intrinsic nature of such complex relationships, existing models often overlook temporal evolution in
Xianghe Zhu, Qiwei Yao
wiley +1 more source
International Journal of Imaging Systems and Technology, Volume 36, Issue 4, July 2026.ABSTRACT Gliomas are aggressive brain tumors that require accurate imaging‐based diagnosis, where automated segmentation plays a central role in assessing tumor morphology and guiding treatment decisions. Manual delineation of gliomas is time‐consuming and prone to variability, motivating the use of deep learning to improve consistency and alleviate ...
Cecilia Diana‐Albelda +4 more
wiley +1 more source
Applications of the regularity lemma for uniform hypergraphs [PDF]
Random Structures & Algorithms, 2005 AbstractIn this article we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on the recent results of Nagle, Schacht, and the authors, we give here solutions to these problems.In particular, we prove the following: Let ℱ be a k‐uniform hypergraph on t vertices and suppose an n‐vertex k‐uniform ...
Vojtech Rödl, Jozef Skokan
openaire +1 more source