Abstract
In a number of our works we present and use the tree-like network models, so called one-max constant-probability models characterized by the following newly studied principles: (i) each new vertex may be connected to at most one existing vertex; (ii) any connection event is realized with the same probability p due to external factors; (iii) the probability \(\varPi \) that a new vertex will be connected to vertex i depends not directly on its degree \(d_{i}\) but on the place of \(d_{i}\) in the sorted list of vertex degrees. In this announcement we describe features and applications of these models and discuss possible ways of their generalization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Dangalchev, C.: Generation models for scale-free networks. Phisica A 338, 659–671 (2004)
Dorogovtsev, S.N., Mendes, J.F.F.: Minimal models of weighted scale-free networks, arXiv.org, Cornell University Library, http://arxiv.org/abs/cond-mat/0408343 (2004)
Gustedt, J.: Generalized attachment models for the genesis of graphs with high clustering coefficient. In: Fortunato, S., Mangioni, G., Menezes, R., Nicosia, V. (eds.) Complex Networks. Studies in Computational Intelligence, vol. 207. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01206-8_9
Korenblit, M., Talis, V., Levin, I.: One-max constant-probability models for complex networks. In: Contucci, P., Menezes, R., Omicini, A., Poncela-Casasnovas, J. (eds.) Complex Networks V. SCI, vol. 549, pp. 181–188. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05401-8_17
Korenblit, M.: A new approach to weakening and destruction of malicious internet networks. In: Pichardo-Lagunas, O., Miranda-Jiménez, S. (eds.) MICAI 2016. LNCS (LNAI), vol. 10062, pp. 460–469. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62428-0_37
Acknowledgments
The author thanks Ilya Levin, Eugene Levner and Vadim Talis for their contribution to the studies.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Korenblit, M. (2018). One-Max Constant-Probability Networks: Results and Future Work. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)