Results 31 to 40 of about 492 (58)
An Analytical Approach to Neuronal Connectivity
, 2003 This paper describes how realistic neuromorphic networks can have their connectivity properties fully characterized in analytical fashion. By assuming that all neurons have the same shape and are regularly distributed along the two-dimensional orthogonal
Albert +15 more
core +2 more sources
Fundamental Structural Constraint of Random Scale-Free Networks
, 2012 We study the structural constraint of random scale-free networks that determines possible combinations of the degree exponent $\gamma$ and the upper cutoff $k_c$ in the thermodynamic limit. We employ the framework of graphicality transitions proposed by [
Daniel Kim +4 more
core +1 more source
Efficient Immunization Strategies for Computer Networks and Populations
, 2003 We present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquaintance immunization, calls for the immunization of random acquaintances of ...
Daniel ben-Avraham +6 more
core +1 more source
Explosive synchronization enhanced by time-delayed coupling
, 2012 We study the emergence of synchronization in scale-free networks by considering the Kuramoto model of coupled phase oscillators. The natural frequencies of oscillators are assumed to be correlated with their degrees and a time delay is included in the ...
Peron, Thomas Kauê Dal'Maso +1 more
core +1 more source
Twin inequality for fully contextual quantum correlations
, 2013 Quantum mechanics exhibits a very peculiar form of contextuality. Identifying and connecting the simplest scenarios in which more general theories can or cannot be more contextual than quantum mechanics is a fundamental step in the quest for the ...
A. Cabello +4 more
core +1 more source
Dependence of the average to-node distance on the node degree for random graphs and growing networks
, 2004 In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$.
Kulakowski, K., Malarz, K.
core +2 more sources
Irreversible Aggregation and Network Renormalization
, 2011 Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter.
Bizhani, Golnoosh +4 more
core +1 more source
, 2008 We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides useful visualization, even for very large networks; and allows for rigorous ...
+12 more
core +1 more source
Degree Correlations in Random Geometric Graphs
, 2012 Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known.
A. Antonioni +3 more
core +1 more source
Average distance in a hierarchical scale-free network: an exact solution
, 2009 Various real systems simultaneously exhibit scale-free and hierarchical structure. In this paper, we study analytically average distance in a deterministic scale-free network with hierarchical organization.
Jihong Guan +9 more
core +1 more source