Related papers: Prime stars multiplexes
A neighborhood-prime labeling of a graph is a variation of a prime labeling in which the vertices are assigned labels from $1$ to $|V(G)|$ such that the $\gcd$ of the labels in the neighborhood of each non-degree $1$ vertex is equal to $1$.…
We study how the topology of a data set $M = M_a \cup M_b \subseteq \mathbb{R}^d$, representing two classes $a$ and $b$ in a binary classification problem, changes as it passes through the layers of a well-trained neural network, i.e., with…
Multiplex is a set of graphs on the same vertex set, i.e. $\{G(V,E_1),\ldots,G(V,E_m)\}$. It is a generalized graph to model multiple relationships with parallel edges between vertices. This paper is a literature review of existing…
Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…
We study the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts. We introduce the simplex stratification of $G_n$: for each vertex $\lambda$,…
Previous work has demonstrated that at a given stellar mass, quiescent galaxies are more strongly clustered than star-forming galaxies. The contribution to this signal from central, as opposed to satellite, galaxies is not known, which has…
The fundamental concept of applying the system methodology to network analysis declares that network architecture should take into account services and applications which this network provides and supports. This work introduces a formal…
Some physical processes that occur during a star's main-sequence evolution also affect its post main-sequence evolution. It is well known that stars with masses above approximately 1.1 $M_{\odot}$ have well-mixed convective cores on the…
Hypergraphs, graph generalizations where edges are conglomerates of $r$ nodes called hyperedges of rank $r\geq 2$, are excellent models to study systems with interactions that are beyond the pairwise level. For hypergraphs, the node degree…
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 paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers, and are confined to the…
A prime labeling of a graph of order $n$ is a labeling of the vertices with the integers $1$ to~$n$ in which adjacent vertices have relatively prime labels. A coprime labeling maintains the same criterion on adjacent vertices using any set…
The study of networks plays a crucial role in investigating the structure, dynamics, and function of a wide variety of complex systems in myriad disciplines. Despite the success of traditional network analysis, standard networks provide a…
Multiplex networks have emerged as a promising approach for modeling complex systems, where each layer represents a different mode of interaction among entities of the same type. A core task in analyzing these networks is to identify the…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
We study diffusion on multiplex networks with directed interlayer couplings. We demonstrate both numerically and analytically that even with undirected layers, interlayer directionality alone reproduces superdiffusion and the prime regime.…
In this work, we use the theory of spatial networks to analyze galaxy distributions. The aim is to develop new approaches to study the spatial galaxy environment properties by means of the network parameters. We investigate how each of the…
The theory of patterns formation for a reaction-diffusion system defined on a multiplex is developed by means of a perturbative approach. The intra-layer diffusion constants act as small parameter in the expansion and the unperturbed state…
Real-world networks typically exhibit several aspects, or layers, of interactions among their nodes. By permuting the role of the nodes and the layers, we establish a new criterion to construct the dual of a network. This approach allows to…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…