Detection-recovery gap for planted dense cycles
Planted dense cycles are a type of latent structure that appears in many applications, such
as small-world networks in social sciences and sequence assembly in computational …
as small-world networks in social sciences and sequence assembly in computational …
Information-Theoretic Thresholds for Planted Dense Cycles
We study a random graph model for small-world networks which are ubiquitous in social and
biological sciences. In this model, a dense cycle of expected bandwidth $ n\tau …
biological sciences. In this model, a dense cycle of expected bandwidth $ n\tau …
A probabilistic view of latent space graphs and phase transitions
A probabilistic view of latent space graphs and phase transitions Page 1 Bernoulli 29(3), 2023,
2417–2441 https://doi.org/10.3150/22-BEJ1547 A probabilistic view of latent space graphs …
2417–2441 https://doi.org/10.3150/22-BEJ1547 A probabilistic view of latent space graphs …
Random Algebraic Graphs and Their Convergence to Erdos-Renyi
K Bangachev, G Bresler - arXiv preprint arXiv:2305.04802, 2023 - arxiv.org
A random algebraic graph is defined by a group $ G $ with a uniform distribution over it and
a connection $\sigma: G\longrightarrow [0, 1] $ with expectation $ p, $ satisfying $\sigma …
a connection $\sigma: G\longrightarrow [0, 1] $ with expectation $ p, $ satisfying $\sigma …
Exact community recovery in the geometric SBM
We study the problem of exact community recovery in the Geometric Stochastic Block Model
(GSBM), where each vertex has an unknown community label as well as a known position …
(GSBM), where each vertex has an unknown community label as well as a known position …
Eulerian magnitude homology: subgraph structure and random graphs
In this paper we explore the connection between the ranks of the magnitude homology
groups of a graph and the structure of its subgraphs. To this end, we introduce variants of …
groups of a graph and the structure of its subgraphs. To this end, we introduce variants of …
Synthetic data generation for digital twins: enabling production systems analysis in the absence of data
PV Lopes, L Silveira… - … Journal of Computer …, 2024 - Taylor & Francis
Industry increasingly focuses on data-driven digital twins of production lines, especially for
planning, controlling and optimising applications. However, the lack of open data on …
planning, controlling and optimising applications. However, the lack of open data on …
Connectivity of Random Geometric Hypergraphs
HL De Kergorlay, DJ Higham - Entropy, 2023 - mdpi.com
We consider a random geometric hypergraph model based on an underlying bipartite graph.
Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those …
Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those …
Detection of Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion
K Bangachev, G Bresler - arXiv preprint arXiv:2310.14501, 2023 - arxiv.org
In this paper we study the random geometric graph $\mathsf {RGG}(n,\mathbb {T}^ d,\mathsf
{Unif},\sigma^ q_p, p) $ with $ L_q $ distance where each vertex is sampled uniformly from …
{Unif},\sigma^ q_p, p) $ with $ L_q $ distance where each vertex is sampled uniformly from …
Exact Label Recovery in Euclidean Random Graphs
In this paper, we propose a family of label recovery problems on weighted Euclidean
random graphs. The vertices of a graph are embedded in $\mathbb {R}^ d $ according to a …
random graphs. The vertices of a graph are embedded in $\mathbb {R}^ d $ according to a …