12 citations · 18 across the 6 of their papers we have counts for
3 papers · 1 filter
Edge-based mean-field approximation of dynamics on networks via approximate lumping of Markov chains
Gábor Timár, Jonathan A. Ward, Péter L. Simon
Mean-field approximations for dynamical processes on networks are widely used, but existing derivations often rely either on moment closures or on idealised assumptions about netwo…
Strongly clustered random graphs via triadic closure: Degree correlations and clustering spectrum
Lorenzo Cirigliano, Gareth J. Baxter, Gábor Timár
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network mo…
Localization of nonbacktracking centrality on dense subgraphs of sparse networks
G. Timár, S. N. Dorogovtsev, J. F. F. Mendes
The nonbacktracking matrix, and the related nonbacktracking centrality (NBC) play a crucial role in models of percolation-type processes on networks, such as non-recurrent epidemic…