arXiv subjects

A. V. Goltsev

Publications and source records attributed to A. V. Goltsev.

At least 55 records · Page 3Linked to original sources

arXiv2012

Critical and resonance phenomena in neural networks

Brain rhythms contribute to every aspect of brain function. Here, we study critical and resonance phenomena that precede the emergence of brain rhythms. Using an analytical approach and simulations of a cortical circuit model of neural networks with stochastic neurons in the presence of noise, we show that spontaneous appearance of network oscillations occurs as a dynamical (non-equilibrium) phase transition at a critical point determined by the noise level, network structure, the balance between excitatory and inhibitory neurons, and other parameters. We find that the relaxation time of neural activity to a steady state, response to periodic stimuli at the frequency of the oscillations, amplitude of damped oscillations, and stochastic fluctuations of neural activity are dramatically increased when approaching the critical point of the transition.

cond-mat.dis-nn↗

arXiv2012

Neural networks with dynamical synapses: from mixed-mode oscillations and spindles to chaos

Understanding of short-term synaptic depression (STSD) and other forms of synaptic plasticity is a topical problem in neuroscience. Here we study the role of STSD in the formation of complex patterns of brain rhythms. We use a cortical circuit model of neural networks composed of irregular spiking excitatory and inhibitory neurons having type 1 and 2 excitability and stochastic dynamics. In the model, neurons form a sparsely connected network and their spontaneous activity is driven by random spikes representing synaptic noise. Using simulations and analytical calculations, we found that if the STSD is absent, the neural network shows either asynchronous behavior or regular network oscillations depending on the noise level. In networks with STSD, changing parameters of synaptic plasticity and the noise level, we observed transitions to complex patters of collective activity: mixed-mode and spindle oscillations, bursts of collective activity, and chaotic behaviour. Interestingly, these patterns are stable in a certain range of the parameters and separated by critical boundaries. Thus, the parameters of synaptic plasticity can play a role of control parameters or switchers between different network states. However, changes of the parameters caused by a disease may lead to dramatic impairment of ongoing neural activity. We analyze the chaotic neural activity by use of the 0-1 test for chaos (Gottwald, G. & Melbourne, I., 2004) and show that it has a collective nature.

cond-mat.dis-nn↗

arXiv2012

Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs

We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph, where a hyperedge can connect any number of vertices. These uncorrelated hypergraphs are tree-like (hypertrees), which crucially simplify the problem and allow us to apply the belief-propagation algorithm to these loopy networks with arbitrary motifs. As natural examples, we consider motifs in the form of finite loops and cliques. We apply the belief-propagation algorithm to the ferromagnetic Ising model on the resulting random networks. We obtain an exact solution of this model on networks with finite loops or cliques as motifs. We find an exact critical temperature of the ferromagnetic phase transition and demonstrate that with increasing the clustering coefficient and the loop size, the critical temperature increases compared to ordinary tree-like complex networks. Our solution also gives the birth point of the giant connected component in these loopy networks.

cond-mat.dis-nn↗

arXiv2012

Localization and Spreading of Diseases in Complex Networks

Using the SIS model on unweighted and weighted networks, we consider the disease localization phenomenon. In contrast to the well-recognized point of view that diseases infect a finite fraction of vertices right above the epidemic threshold, we show that diseases can be localized on a finite number of vertices, where hubs and edges with large weights are centers of localization. Our results follow from the analysis of standard models of networks and empirical data for real-world networks.

physics.soc-ph↗

arXiv2010

Heterogeneous-k-core versus Bootstrap Percolation on Complex Networks

We introduce the heterogeneous-$k$-core, which generalizes the $k$-core, and contrast it with bootstrap percolation. Vertices have a threshold $k_i$ which may be different at each vertex. If a vertex has less than $k_i$ neighbors it is pruned from the network. The heterogeneous-$k$-core is the sub-graph remaining after no further vertices can be pruned. If the thresholds $k_i$ are $1$ with probability $f$ or $k \geq 3$ with probability $(1-f)$, the process forms one branch of an activation-pruning process which demonstrates hysteresis. The other branch is formed by ordinary bootstrap percolation. We show that there are two types of transitions in this heterogeneous-$k$-core process: the giant heterogeneous-$k$-core may appear with a continuous transition and there may be a second, discontinuous, hybrid transition. We compare critical phenomena, critical clusters and avalanches at the heterogeneous-$k$-core and bootstrap percolation transitions. We also show that network structure has a crucial effect on these processes, with the giant heterogeneous-$k$-core appearing immediately at a finite value for any $f > 0$ when the degree distribution tends to a power law $P(q) \sim q^{-γ}$ with $γ< 3$.

cond-mat.stat-mech↗

arXiv2010

"Explosive Percolation" Transition is Actually Continuous

The basic notion of percolation in physics assumes the emergence of a giant connected (percolation) cluster in a large disordered system when the density of connections exceeds some critical value. Until recently, the percolation phase transitions were believed to be continuous, however, in 2009, a remarkably different, discontinuous phase transition was reported in a new so-called "explosive percolation" problem. Each link in this problem is established by a specific optimization process. Here, employing strict analytical arguments and numerical calculations, we find that in fact the "explosive percolation" transition is continuous though with an uniquely small critical exponent of the percolation cluster size. These transitions provide a new class of critical phenomena in irreversible systems and processes.

cond-mat.dis-nn↗

arXiv2010

Stochastic cellular automata model of neural networks

We propose a stochastic dynamical model of noisy neural networks with complex architectures and discuss activation of neural networks by a stimulus, pacemakers and spontaneous activity. This model has a complex phase diagram with self-organized active neural states, hybrid phase transitions, and a rich array of behavior. We show that if spontaneous activity (noise) reaches a threshold level then global neural oscillations emerge. Stochastic resonance is a precursor of this dynamical phase transition. These oscillations are an intrinsic property of even small groups of 50 neurons.

cond-mat.dis-nn↗

arXiv2009

Zero Pearson Coefficient for Strongly Correlated Growing Trees

We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by $m$ edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees ($m=1$). If the number of connections of new vertices exceeds one ($m>1$), then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent $γ$ does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow, power-law like approach to an infinite network limit. Our findings indicate that Pearson's coefficient strongly depends on size and details of networks, which makes this characteristic virtually useless for quantitative comparison of different networks.

cond-mat.stat-mech↗

arXiv2009

Critical hybridization for the Kondo resonance in gapless systems

We study the Kondo resonance in a spin-1/2 single impurity Anderson model with a gapless conduction band using the equation of motion approach in order to obtain the impurity spectral function. We study two different scenarios for gapless systems: a purely power-law energy dependence of the density of states or a constant density of states with a gapless behavior near the Fermi level. We demonstrate that strong electron-electron correlations lead to a sharp peak in the impurity spectral function in the case of a large exchange coupling ($J>J_{c}$) or equivalently, a strong hybridization ($V>V_{c}$). This Kondo-like peak emerges much below the Fermi level in the case of a strongly depleted density of states. These results are compared with the ones from renormalization group approaches.

cond-mat.str-el↗

arXiv2008

Percolation on correlated networks

We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for degree-degree correlations to be irrelevant for critical singularities. We present examples of networks in which assortative and disassortative mixing leads to unusual percolation properties and new critical exponents.

cond-mat.stat-mech↗

arXiv2007

Critical phenomena in complex networks

The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researchers have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.

cond-mat.stat-mech↗

arXiv2006

k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects

We develop the theory of the k-core (bootstrap) percolation on uncorrelated random networks with arbitrary degree distributions. We show that the k-core percolation is an unusual, hybrid phase transition with a jump emergence of the k-core as at a first order phase transition but also with a critical singularity as at a continuous transition. We describe the properties of the k-core, explain the meaning of the order parameter for the k-core percolation, and reveal the origin of the specific critical phenomena. We demonstrate that a so-called ``corona'' of the k-core plays a crucial role (corona is a subset of vertices in the k-core which have exactly k neighbors in the k-core). It turns out that the k-core percolation threshold is at the same time the percolation threshold of finite corona clusters. The mean separation of vertices in corona clusters plays the role of the correlation length and diverges at the critical point. We show that a random removal of even one vertex from the k-core may result in the collapse of a vast region of the k-core around the removed vertex. The mean size of this region diverges at the critical point. We find an exact mapping of the k-core percolation to a model of cooperative relaxation. This model undergoes critical relaxation with a divergent rate at some critical moment.

cond-mat.stat-mech↗

arXiv2006

k-core organization of complex networks

We analytically describe the architecture of randomly damaged uncorrelated networks as a set of successively enclosed substructures -- k-cores. The k-core is the largest subgraph where vertices have at least k interconnections. We find the structure of k-cores, their sizes, and their birth points -- the bootstrap percolation thresholds. We show that in networks with a finite mean number z_2 of the second-nearest neighbors, the emergence of a k-core is a hybrid phase transition. In contrast, if z_2 diverges, the networks contain an infinite sequence of k-cores which are ultra-robust against random damage.

cond-mat.stat-mech↗

arXiv2005

Correlations in interacting systems with a network topology

We study pair correlations in cooperative systems placed on complex networks. We show that usually in these systems, the correlations between two interacting objects (e.g., spins), separated by a distance $\ell$, decay, on average, faster than $1/(\ell z_\ell)$. Here $z_\ell$ is the mean number of the $\ell$-th nearest neighbors of a vertex in a network. This behavior, in particular, leads to a dramatic weakening of correlations between second and more distant neighbors on networks with fat-tailed degree distributions, which have a divergent number $z_2$ in the infinite network limit. In this case, only the pair correlations between the nearest neighbors are observable. We obtain the pair correlation function of the Ising model on a complex network and also derive our results in the framework of a phenomenological approach.

cond-mat.stat-mech↗

arXiv2004

Itinerant magnetism in Kondo crystal CeB6 as indicated by polarized neutron scattering

A magnetic Bragg reflection corresponding to the wave vector k13 = (2pi/a)[1/2,1/2,1/2] of the antiferro-quadrupolar ordering is found in CeB6 in zero magnetic field below the Neel temperature TN. Its intensity is two orders of magnitude weaker than those due to the basic magnetic structure [O. Zaharko et al., Phys. Rev. B 68, 214401 (2003)]. The peak has a width of the other Bragg reflections below TN, but widens abruptly at T = TN with simultaneous increase of intensity. Correlation length just above TN is of the order of 70 A. The peak intensity decreases to zero at T = 7 K with no visible anomaly at the antiferro-quadrupolar ordering temperature TQ = 3.3 K. The features of this magnetic ordering are typical for the itinerant magnetism with 5d electron of Ce3+ [Yu.S. Grushko et al., phys. stat. sol. (b) 128, 591 (1985)] being involved.

cond-mat.str-el↗

arXiv2003

Potts model on complex networks

We consider the general p-state Potts model on random networks with a given degree distribution (random Bethe lattices). We find the effect of the suppression of a first order phase transition in this model when the degree distribution of the network is fat-tailed, that is, in more precise terms, when the second moment of the distribution diverges. In this situation the transition is continuous and of infinite order, and size effect is anomalously strong. In particular, in the case of $p=1$, we arrive at the exact solution, which coincides with the known solution of the percolation problem on these networks.

cond-mat.stat-mech↗

arXiv2003

Spectra of complex networks

We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equations are derived. These equations are generalized to the case of networks with correlations between neighboring vertices. The tail of the density of eigenvalues $ρ(λ)$ at large $|λ|$ is related to the behavior of the vertex degree distribution $P(k)$ at large $k$. In particular, as $P(k) \sim k^{-γ}$, $ρ(λ) \sim |λ|^{1-2γ}$. We propose a simple approximation, which enables us to calculate spectra of various graphs analytically. We analyse spectra of various complex networks and discuss the role of vertices of low degree. We show that spectra of locally tree-like random graphs may serve as a starting point in the analysis of spectral properties of real-world networks, e.g., of the Internet.

cond-mat.stat-mech↗

arXiv2003

Peltier effect in normal metal-insulator-heavy fermion metal junctions

A theoretical study has been undertaken of the Peltier effect in normal metal - insulator - heavy fermion metal junctions. The results indicate that, at temperatures below the Kondo temperature, such junctions can be used as electronic microrefrigerators to cool the normal metal electrode and are several times more efficient in cooling than the normal metal - heavy fermion metal junctions.

cond-mat.str-el↗