4 papers
node2vec or triangle-biased random walks: stationarity, regularity & recurrence
Luca Avena, Gianmarco Bet, Lars Schroeder +1
The node2vec random walk is a non-Markovian random walk on the vertex set of a graph, widely used for network embedding and exploration. This random walk model is defined in terms…
Simplicity of random hypergraphs
Yanna J. Kraakman, Clara Stegehuis
Random hypergraphs extend the classical notion of random graphs by allowing hyperedges to join more than two vertices, making them well-suited for modeling higher-order interaction…
Large deviations for subgraphs in inhomogeneous random graphs
Riccardo Michielan, Clara Stegehuis, Bert Zwart
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the…
Optimal network geometry detection for weak geometry
R. Michielan, C. Stegehuis
Network geometry, characterized by nodes with associated latent variables, is a fundamental feature of real-world networks. Still, when only the network edges are given, it may be…