Results 11 to 20 of about 2,502 (255)

Deterministic scale-free networks [PDF]

open access: yesPhysica A: Statistical Mechanics and its Applications, 2001
Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are stochastic, that is they create networks in which the nodes appear to be randomly connected to each other.
Barabási, A.-L., Ravasz, E., Vicsek, T.
openaire   +3 more sources

Deterministic small-world networks [PDF]

open access: yesPhysica A: Statistical Mechanics and its Applications, 2002
6 pages, 1 ...
Comellas, Francesc, Sampels, Michaël
openaire   +4 more sources

Deterministic hierarchical networks [PDF]

open access: yesJournal of Physics A: Mathematical and Theoretical, 2016
It has been shown that many networks associated with complex systems are small-world (they have both a large local clustering coefficient and a small diameter) and they are also scale-free (the degrees are distributed according to a power law). Moreover, these networks are very often hierarchical, as they describe the modularity of the systems that are
Barrière Figueroa, Eulalia   +3 more
openaire   +6 more sources

Leaderless Deterministic Chemical Reaction Networks [PDF]

open access: yesNatural Computing, 2013
This paper answers an open question of Chen, Doty, and Soloveichik [1], who showed that a function f:N^k --> N^l is deterministically computable by a stochastic chemical reaction network (CRN) if and only if the graph of f is a semilinear subset of N^{k+l}.
Doty, David, Hajiaghayi, Monir
openaire   +4 more sources

Deterministic Blind Radio Networks [PDF]

open access: yes, 2018
Ad-hoc radio networks and multiple access channels are classical and well-studied models of distributed systems, with a large body of literature on deterministic algorithms for fundamental communications primitives such as broadcasting and wake-up. However, almost all of these algorithms assume knowledge of the number of participating nodes and the ...
Czumaj, Artur, Davies, Peter
openaire   +4 more sources

Deterministic quantum dense coding networks [PDF]

open access: yesPhysics Letters A, 2018
11 pages, 2 figures, close to published ...
Saptarshi Roy   +4 more
openaire   +4 more sources

Deterministic networks for probabilistic computing [PDF]

open access: yesScientific Reports, 2019
AbstractNeuronal network models of high-level brain functions such as memory recall and reasoning often rely on the presence of some form of noise. The majority of these models assumes that each neuron in the functional network is equipped with its own private source of randomness, often in the form of uncorrelated external noise.
Jakob Jordan   +6 more
openaire   +8 more sources

Improved Deterministic Network Decomposition [PDF]

open access: yes, 2021
Network decomposition is a central tool in distributed graph algorithms. We present two improvements on the state of the art for network decomposition, which thus lead to improvements in the (deterministic and randomized) complexity of several well-studied graph problems. - We provide a deterministic distributed network decomposition algorithm with $O(\
Ghaffari, Mohsen   +2 more
openaire   +3 more sources

Deterministic Communication in Radio Networks [PDF]

open access: yesSIAM Journal on Computing, 2018
In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad-hoc radio networks with unknown topology: broadcasting and wake-up. We consider an unknown radio network, in which all nodes have no prior knowledge about network topology, and know only the size of the network $n$, the maximum
Czumaj, Artur, Davies, Peter
openaire   +4 more sources

Mixed deterministic and probabilistic networks [PDF]

open access: yesAnnals of Mathematics and Artificial Intelligence, 2008
The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to develop mixed networks stems from the desire to fully exploit the deterministic information (constraints) that is often present in graphical models.
Mateescu, Robert, Dechter, Rina
openaire   +4 more sources

Home - About - Disclaimer - Privacy