Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Tatyana S. Turova"'
Autor:
Stefano Serafini, Tatyana S. Turova
Publikováno v:
Caryologia, Vol 76, Iss 3 (2024)
Professor Antonio Lima-de-Faria was our friend and, in a sense, a teacher. Despite our different fields of study, this master of scientific thought has deeply influenced both of us. Dr. Stefano Serafini came to know the work of Antonio Lima-de-Faria
Externí odkaz:
https://doaj.org/article/581c55194bf84e169dc387a87ca3c16f
Autor:
Tatyana S. Turova
Publikováno v:
Journal of Mathematical Physics. 63:053301
We consider the Gibbs measure on the configurations of N particles on R+ with one fixed particle at one end at 0. The potential includes pair-wise Coulomb interactions between any particle and its 2 K neighbors. Only when K = 1, the model is within t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e067cfe04d15dc9b4e3ee85c876f1a68
https://doi.org/10.1063/5.0089803
https://doi.org/10.1063/5.0089803
Autor:
Tatyana S. Turova
Publikováno v:
Ann. Appl. Probab. 28, no. 2 (2018), 1249-1291
We consider the system of particles on a finite interval with pairwise nearest neighbours interaction and external force. This model was introduced by Malyshev [Probl. Inf. Transm. 51 (2015) 31–36] to study the flow of charged particles on a rigoro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca00d01eb26a801b3a95350ee1980aa9
https://projecteuclid.org/euclid.aoap/1523433635
https://projecteuclid.org/euclid.aoap/1523433635
Publikováno v:
Biosystems. 136:105-112
We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ed7a18caaa90e5fda219c4bdd68e931
https://doi.org/10.1016/j.biosystems.2015.09.002
https://doi.org/10.1016/j.biosystems.2015.09.002
Autor:
Thomas Vallier, Tatyana S. Turova
Publikováno v:
Journal of Statistical Physics. 160:1249-1276
Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with probability $p$ b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91e15cbb56a9d7a2abcc9f66e71e6ce7
https://doi.org/10.1007/s10955-015-1294-x
https://doi.org/10.1007/s10955-015-1294-x
Autor:
George Napolitano, Tatyana S. Turova
Publikováno v:
The Fourteenth Marcel Grossmann Meeting.
In this paper we study the annealed coupling of an Ising model with 2-dimensional causal dynamical triangulation model. After a short review of previous results, we prove the existence of the so-called critical line and derive its analytical properti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6009b233e67e151752167af3956df19
https://doi.org/10.1142/9789813226609_0515
https://doi.org/10.1142/9789813226609_0515
Autor:
Vasilii Goriachkin, Tatyana S. Turova
Publikováno v:
Biosystems. 184:103991
We study connectivity in a model of a growing neuronal network in dimensions 2 and 3. Although the axon-to-dendrite proximity is an insufficient condition for establishing a functional synapse, it is still a necessary one. Therefore we study connecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f494106e4168e7e43d820a5a757dd944
https://doi.org/10.1016/j.biosystems.2019.103991
https://doi.org/10.1016/j.biosystems.2019.103991
Autor:
Tatyana S. Turova
Publikováno v:
Mathematical Biosciences and Engineering. 11:139-148
A model is considered for a neural network that is a stochastic process on a random graph. The neurons are represented by "integrate-and-fire" processes. The structure of the graph is determined by the probabilities of the connections, and it depends
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca0e4560fb581e4bcb8c5bcd5d361fb6
https://doi.org/10.3934/mbe.2014.11.139
https://doi.org/10.3934/mbe.2014.11.139
Autor:
Tatyana S. Turova
Publikováno v:
Random Structures & Algorithms. 43:486-539
Consider the random graph on n vertices 1,...,n. Each vertex i is assigned a type x(i) with x(1),...,x(n) being independent identically distributed as a nonnegative random variable X. We assume that EX3 < infinity. Given types of all vertices, an edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6cbf16f36153e84994157e3a580ce36b
https://doi.org/10.1002/rsa.20503
https://doi.org/10.1002/rsa.20503
Autor:
Tatyana S. Turova
Publikováno v:
Combinatorics, Probability and Computing. 20:131-154
We study the ‘rank 1 case’ of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result complements the corresponding known res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f15c15fec31e2d3928563510531b548
https://doi.org/10.1017/s0963548310000180
https://doi.org/10.1017/s0963548310000180