图中k次迭代的一致随机映射的顶点和分量的碰撞和关联

IF 0.3 Q4 MATHEMATICS, APPLIED Discrete Mathematics and Applications Pub Date : 2021-08-01 DOI:10.1515/dma-2021-0023
V. O. Mironkin
{"title":"图中k次迭代的一致随机映射的顶点和分量的碰撞和关联","authors":"V. O. Mironkin","doi":"10.1515/dma-2021-0023","DOIUrl":null,"url":null,"abstract":"Abstract The probabilistic characteristics of the graph of k-fold iteration of uniform random mapping are studied. Formulas for the distribution of the length of the aperiodicity segment of an arbitrary vertex with some restrictions are calculated. We obtain exact expressions for the probabilities that two arbitrary vertices belong to the same connected component, that an arbitrary vertex belongs to the preimage set of another vertex and that there exists a collision in the considered graph.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collisions and incidence of vertices and components in the graph of k-fold iteration of the uniform random mapping\",\"authors\":\"V. O. Mironkin\",\"doi\":\"10.1515/dma-2021-0023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The probabilistic characteristics of the graph of k-fold iteration of uniform random mapping are studied. Formulas for the distribution of the length of the aperiodicity segment of an arbitrary vertex with some restrictions are calculated. We obtain exact expressions for the probabilities that two arbitrary vertices belong to the same connected component, that an arbitrary vertex belongs to the preimage set of another vertex and that there exists a collision in the considered graph.\",\"PeriodicalId\":11287,\"journal\":{\"name\":\"Discrete Mathematics and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2021-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/dma-2021-0023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2021-0023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

摘要研究了均匀随机映射的k次迭代图的概率特征。在一定的限制条件下,计算了任意顶点的非周期段长度的分布公式。我们得到了两个任意顶点属于同一连通分量的概率、任意顶点属于另一个顶点的原像集的概率以及图中存在碰撞的概率的精确表达式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Collisions and incidence of vertices and components in the graph of k-fold iteration of the uniform random mapping
Abstract The probabilistic characteristics of the graph of k-fold iteration of uniform random mapping are studied. Formulas for the distribution of the length of the aperiodicity segment of an arbitrary vertex with some restrictions are calculated. We obtain exact expressions for the probabilities that two arbitrary vertices belong to the same connected component, that an arbitrary vertex belongs to the preimage set of another vertex and that there exists a collision in the considered graph.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.60
自引率
20.00%
发文量
29
期刊介绍: The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
期刊最新文献
Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model Propagation criterion for monotone Boolean functions with least vector support set of 1 or 2 elements On the complexity of implementation of a system of three monomials of two variables by composition circuits Inverse homomorphisms of finite groups On the approximation of high-order binary Markov chains by parsimonious models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1