Applied Network Science

Table 7 Induced means E[N_I(m)] according to the EDD model and running times \(T_{E[N_{I}(m)]}\) (in seconds) for the five motif graphs of Fig. 13 using RaME

From: Establish the expected number of induced motifs on unlabeled graphs through analytical models

Topology	N_obs	\(T_{N_{obs}}\)	E[N_I(m)]	\(T_{E[N_{I}(m)]}\)
	5’045’184	0.48	171’102.35	0.21
	6’862’764	3.6	24’376.51	0.20
	-	> 1 day	889’928’264’336.37	0.25
	-	> 1 day	76’665.85	1.16
	-	> 1 day	174.63	3’031.21

The table also reports the number of occurrences N_obs in the input network using GTrie algorithm and the relative execution time \(T_{N_{obs}}\) (in seconds)

Back to article page