4.5k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Tel Aviv UniversityIL181 papers
- Boston UniversityUS130 papers
- Weizmann Institute of ScienceIL117 papers
- Ariel UniversityIL101 papers
- Ben-Gurion University of the NegevIL99 papers
- Centre National de la Recherche ScientifiqueFR98 papers
- Hebrew University of JerusalemIL95 papers
- Technion – Israel Institute of TechnologyIL90 papers
- Massachusetts Institute of TechnologyUS82 papers
- Stanford UniversityUS75 papers
- University of CambridgeGB70 papers
- University of Maryland, College ParkUS68 papers
9 papers · 2 filters
Mutual learning in a tree parity machine and its application to cryptography
Michal Rosen-Zvi, Einat Klein, Ido Kanter +1
Mutual learning of a pair of tree parity machines with continuous and discrete weight vectors is studied analytically. The analysis is based on a mapping procedure that maps the mu…
Efficient Immunization Strategies for Computer Networks and Populations
Reuven Cohen, Shlomo Havlin, Daniel ben-Avraham
We present an effective immunization strategy for computer networks and populations with broad and, in particular, scale-free degree distributions. The proposed strategy, acquainta…
A secure key-exchange protocol with an absence of injective functions
R. Mislovaty, Y. Perchenok, Ido Kanter +1
The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural net…
Scale-free Networks on Lattices
Alejandro F. Rozenfeld, Reuven Cohen, Daniel ben-Avraham +1
We suggest a method for embedding scale-free networks, with degree distribution P(k) k^-lambda, in regular Euclidean lattices. The embedding is driven by a natural constraint of mi…
Scale-Free Networks are Ultrasmall
Reuven Cohen, Shlomo Havlin
We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) ~ k^-a, i.e. the probability of having k links outgo…
Percolation in Directed Scale-Free Networks
N. Schwartz, R. Cohen, D. ben-Avraham +2
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such d…
Interacting neural networks and cryptography
Wolfgang Kinzel, Ido Kanter
Two neural networks which are trained on their mutual output bits are analysed using methods of statistical physics. The exact solution of the dynamics of the two weight vectors sh…
Learning and predicting time series by neural networks
Ansgar Freking, Wolfgang Kinzel, Ido Kanter
Artificial neural networks which are trained on a time series are supposed to achieve two abilities: firstly to predict the series many time steps ahead and secondly to learn the r…
Percolation Critical Exponents in Scale-Free Networks
Reuven Cohen, Daniel ben-Avraham, Shlomo Havlin
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo…