65 citations · 115 across the 6 of their papers we have counts for
6 papers
Nearest-neighbour directed random hyperbolic graphs
I. A. Kasyanov, P. van der Hoorn, D. Krioukov +1
Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyp…
Polygon-based hierarchical planar networks based on generalized Apollonian construction
M. V. Tamm, D. G. Koval, V. I. Stadnichuk
Experimentally observed complex networks are often scale-free, small-world and have unexpectedly large number of small cycles. Apollonian network is one notable example of a model…
Growth rate of 3D heaps of pieces
M. V. Tamm, N. Pospelov, S. Nechaev
We consider configurational statistics of three-dimensional heaps of pieces () on a simple cubic lattice in a large 3D bounding box of base , and calculate…
Combinatorics of 3D directed animals on a simple cubic lattice
Sergei Nechaev, Michael Tamm
We provide combinatorial arguments based on a two-dimensional extension of a locally-free semigroup allowing us to compute the growth rate, , of the partition function $Z_N=N^θΛ…
Narrow-escape times for diffusion in microdomains with a particle-surface affinity: Mean-field results
G. Oshanin, M. Tamm, O. Vasilyev
We analyze the mean time t_{app} that a randomly moving particle spends in a bounded domain (sphere) before it escapes through a small window in the domain's boundary. A particle i…
How long does it take to pull an ideal polymer into a small hole?
A. Y. Grosberg, S. Nechaev, M. Tamm +1
We present scaling estimates for characteristic times and of pulling ideal linear and randomly branched polymers of monomers into a small hole by a f…