相关论文: Star-collision in random hypergraphs
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
We consider high-order connectivity in $k$-uniform hypergraphs defined as follows: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We describe the…
We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…
This study delves into the incidence matrices of hypergraphs, with a focus on two types: the edge-vertex incidence matrix and the vertex-edge incidence matrix. The edge-vertex incidence matrix is a matrix in which the rows represent…
We consider connected components in $k$-uniform hypergraphs for the following notion of connectedness: given integers $k\ge 2$ and $1\le j \le k-1$, two $j$-sets (of vertices) lie in the same $j$-component if there is a sequence of edges…
The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of…
The dense material in a compact star from a supernova remnant is beyond terrestrial experimentation, so phenomenological modeling is used to match astrophysical observations. This is crucial due to the complex sensitivity of compact star…
Vortex singularities in speckle patterns formed from random superpositions of waves are an inevitable consequence of destructive interference and are consequently generic and ubiquitous. Singularities are topologically stable, meaning they…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…
Models of relativistic rotating neutron star composed of hyperon rich matter is constructed in the framework of an effective field theory in the mean-field approach. The gross properties of compact star is calculated at both static and the…
Motivated by applications to a wide range of assemble-to-order systems, operations scheduling, healthcare systems and collaborative economy applications, we introduce a stochastic matching model on hypergraphs, extending the model in [15]…
Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
This paper studies observability for non-uniform hypergraphs with inputs and outputs. To capture higher-order interactions, we define a canonical non-homogeneous dynamical system with nonlinear outputs on hypergraphs. We then construct…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
In supersymmetric theories, topological defects can have nontrivial behaviors determined purely by whether or not supersymmetry is restored in the defect core. A well-known example of this is that some supersymmetric cosmic strings are…
Most statistical models for networks focus on pairwise interactions between nodes. However, many real-world networks involve higher-order interactions among multiple nodes, such as co-authors collaborating on a paper. Hypergraphs provide a…
Quantum graphs have recently emerged as models of nonlinear optical, quantum confined systems with exquisite topological sensitivity and the potential for predicting structures with an intrinsic, off-resonance response approaching the…