Related papers: Star-collision in random hypergraphs
Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…
In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…
The holographic upper bound on entropy is applied to the gravitational action associated with the non-relativistic contraction of a nebula. A critical radius is identified, as a function of the initial radius and mass, for which the number…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
In this paper we address the question whether star formation is driven by local processes or the large scale environment. To do so, we investigate star formation in collisional debris where the gravitational potential well and velocity…
We examine a search on a graph among a number of different kinds of objects (vertices), one of which we want to find. In a standard graph search, all of the vertices are the same, except for one, the marked vertex, and that is the one we…
Binary interactions are commonplace among massive stars, giving rise observed phenomena such as X-ray binaries, stripped stars & supernovae, and gravitational-wave sources. The multiplicity properties of massive stars thus represent a…
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
We consider the following definition of connectivity in $k$-uniform hypergraphs: 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 determine the…
In this work we present a study on the characterization of ordered and disordered hyperuniform point distributions on spherical surfaces. In spite of the extensive literature on disordered hyperuniform systems in Euclidean geometries, to…
The star discrepancy is a quantitative measure of the uniformity of a point set in the unit cube. A central quantity of interest is the inverse of the star discrepancy, $N(\varepsilon, s)$, defined as the minimum number of points required…
We consider the density matrices derived from combinatorial laplacian matrix of graphs. Specifically, the star-relevant graph, which means adding certain edges on peripheral vertices of star graph, is the focus of this paper. Initially, we…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
The class of norm-dependent Random Matrix Ensembles is studied in the presence of an external field. The probability density in those ensembles depends on the trace of the squared random matrices, but is otherwise arbitrary. An exact…
Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
Finite size artifacts arise in molecular simulations of nucleation when critical nuclei are too close to their periodic images. A rigorous determination of what constitutes too close is, however, a major challenge. Recently, we devised…
We consider a model of star copolymers, based on self-avoiding walks, where the arms of the star can be chemically distinct. The copolymeric star is attached to an impenetrable surface at a vertex of unit degree and the different monomers…