5 papers
Efficient generation of expected-degree graphs via edge-arrivals
Gianlorenzo D'Angelo, Riccardo Michielan
We study the efficient generation of random graphs with a prescribed expected degree sequence, focusing on rank-1 inhomogeneous models in which vertices are assigned weights and ed…
Planted clique recovery in random geometric graphs
Konstantin Avrachenkov, Andrei Bobu, Nelly Litvak +1
We investigate the problem of identifying planted cliques in random geometric graphs, focusing on two distinct algorithmic approaches: the first based on vertex degrees (VD) and th…
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…
Homophily Within and Across Groups
Abbas K. Rizi, Riccardo Michielan, Clara Stegehuis +1
Homophily -- the tendency of individuals to interact with similar others -- shapes how networks form and function. Yet existing approaches typically collapse homophily to a single…
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…