Related papers: Star-collision in random hypergraphs
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
The primary objective of this paper is to introduce Hyers-Ulam-type stability results for monotone, subadditive, and convex graphs. We consider their standard definitions in an approximate sense and demonstrate the existence of a…
Observations and cosmological simulations indicate that the early Universe hosted numerous compact, high-density stellar systems, where close encounters and physical collisions between stars were likely common. We develop a bottom-up…
Collisional ring galaxies are the outcome of nearly axisymmetric high-speed encounters between a disc and an intruder galaxy. We investigate the properties of collisional ring galaxies as a function of the impact parameter, the initial…
The two-star random graph is the simplest exponential random graph model with nontrivial interactions between the graph edges. We propose a set of auxiliary variables that control the thermodynamic limit where the number of vertices N tends…
Hyperuniformity refers to the suppression of density fluctuations at large scales. Typical for ordered systems, this property also emerges in several disordered physical and biological systems, where it is particularly relevant to…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
We consider a one-dimensional system of particles, moving at constant velocities chosen independently according to a symmetric distribution on $\{-1,0,+1\}$, and annihilating upon collision -- with, in case of triple collision, a uniformly…
Pattern-forming nonequilibrium systems are ubiquitous in nature, from driven quantum matter and biological life forms to atmospheric and interstellar gases. Identifying universal aspects of their far-from-equilibrium dynamics and statistics…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
Random $s$-intersection graphs have recently received considerable attention in a wide range of application areas. In such a graph, each vertex is equipped with a set of items in some random manner, and any two vertices establish an…
Young massive star clusters spanning $\sim 10^4 - 10^8 M_\odot$ in mass have been observed to have similar surface brightness profiles. Recent hydrodynamical simulations of star cluster formation have also produced star clusters with this…
We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…
Directed and heterogeneous hypergraphs capture directional higher-order interactions with intrinsically asymmetric functional dependencies among nodes. As a result, damage to certain nodes can suppress entire hyperedges, whereas failure of…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
Star sampling (SS) is a random sampling procedure on a graph wherein each sample consists of a randomly selected vertex (the star center) and its (one-hop) neighbors (the star points). We consider the use of SS to find any member of a…
In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by Erd\H{o}s on estimating the maximum number of edges…
During their main sequence evolution, massive stars can develop convective regions very close to their surface. These regions are caused by an opacity peak associated with iron ionization. Cantiello et al. (2009) found a possible connection…
A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to…