A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “subgraph counting” 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Functional central limit theorem for the simultaneous subgraph count of dynamic Erdős–Rényi random graphs
2025 Electronic Journal of Probability article Mathematics Limits and Structures in Graph Theory Open access

Rajat Subhra Hazra, Nikolai Kriukov, Michel Mandjes

2

citations
The Complexity of Homomorphism Reconstructibility
2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

0

citations
Moderate deviations for weight-dependent random connection models
2025 Journal of Applied Probability article Mathematics Point processes and geometric inequalities

Nils Heerten, Christian Hirsch, Moritz Otto

2

citations
Inference for dynamic Erdős–Rényi random graphs under regime switching
2025 Performance Evaluation article Physics and Astronomy Complex Network Analysis Techniques Open access

Michel Mandjes, Jiesen Wang

2

citations
Estimation of on- and off-time distributions in a dynamic Erdős–Rényi random graph
2025 Advances in Applied Probability article Physics and Astronomy Complex Network Analysis Techniques Open access

Michel Mandjes, Jiesen Wang

0

citations
Large-scale network motif analysis using compression
2020 Data Mining and Knowledge Discovery article Physics and Astronomy Complex Network Analysis Techniques Open access

Peter Bloem, Steven de Rooij

18

citations

6 results