Zobrazeno 1 - 10
of 79 511
pro vyhledávání: '"Number of blocks"'
Autor:
Iksanov, Alexander, Jedidi, Wissem
The points of the closed range of a drift-free subordinator with no killing are used for separating into blocks the elements of a sample of size $n$ from the standard exponential distribution. This gives rise to a random composition of $n$. Assuming
Externí odkaz:
http://arxiv.org/abs/2406.08370
A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is strongly connected. The oriented diameter of $G$ is the smallest diameter among all strong orientations of $G$. A block of $G$ is a maximal connected su
Externí odkaz:
http://arxiv.org/abs/2212.07257
Autor:
Ludkin, Matthew
The stochastic block model (SBM) is a popular model for capturing community structure and interaction within a network. Network data with non-Boolean edge weights is becoming commonplace; however, existing analysis methods convert such data to a bina
Externí odkaz:
http://arxiv.org/abs/1909.09421
The Wiener index (the distance) of a connected graph is the sum of distances between all pairs of vertices. In this paper, we study the maximum possible value of this invariant among graphs on $n$ vertices with fixed number of blocks $p$. It is known
Externí odkaz:
http://arxiv.org/abs/1905.02633
Autor:
Ludkin, Matthew
Publikováno v:
In Computational Statistics and Data Analysis December 2020 152
Publikováno v:
In Applied Mathematics and Computation 1 September 2020 380
Community detection is a fundamental unsupervised learning problem for unlabeled networks which has a broad range of applications. Many community detection algorithms assume that the number of clusters $r$ is known apriori. In this paper, we propose
Externí odkaz:
http://arxiv.org/abs/1705.08580
Autor:
Bannai, Etsuko, Noda, Ryuzaburo
Publikováno v:
Discrete Mathematics 339 (2016) 2313--2328
Let $\mathcal D=(\Omega, \mathcal B)$ be a pair of $v$ point set $\Omega$ and a set $\mathcal B$ consists of $k$ point subsets of $\Omega$ which are called blocks. Let $d$ be the maximal cardinality of the intersections between the distinct two block
Externí odkaz:
http://arxiv.org/abs/1404.3821
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Li, Xueliang, Liu, Sujuan
An edge-colored graph $G$ is rainbow connected if every pair of vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of $G$ is defined to be the minimum integer $t$ such that there exists an
Externí odkaz:
http://arxiv.org/abs/1211.0141