Random Structures & Algorithms最新文献_第3页

On the largest part size of low‐rank combinatorial assemblies 关于低阶组合装配的最大零件尺寸

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-12-30 DOI: 10.1002/rsa.21132

R. Arratia, S. Desalvo

{"title":"On the largest part size of low‐rank combinatorial assemblies","authors":"R. Arratia, S. Desalvo","doi":"10.1002/rsa.21132","DOIUrl":"https://doi.org/10.1002/rsa.21132","url":null,"abstract":"We give a general framework for approximations to decomposable combinatorial structures suitable to the situation where the size n$$ n $$ and the number of components k$$ k $$ are specified. In particular for assemblies, this involves a Poisson process, which, with the appropriate choice of parameter, may be viewed as an extension of saddlepoint approximation. We illustrate the use of the Poisson process description for assemblies by analyzing the component structure when the rank, defined as r:=n−k$$ r:= n-k $$ , is small relative to the size n$$ n $$ . There is near‐universal behavior, in the sense that, apart from degenerate cases where the exponential generating function has radius of convergence zero, we have for t∈(0,∞)$$ tin left(0,infty right) $$ and ℓ=1,2,…$$ ell =1,2,dots $$ : when r≍nα$$ rasymp {n}^{alpha } $$ for fixed α∈(ℓℓ+1,ℓ+1ℓ+2)$$ alpha in left(frac{ell }{ell +1},frac{ell +1}{ell +2}right) $$ , the size L1$$ {L}_1 $$ of the largest component converges in probability to ℓ+2$$ ell +2 $$ ; when r∼tnℓ/(ℓ+1)$$ rsim tkern0.3em {n}^{ell /left(ell +1right)} $$ , we have ℙ(L1∈{ℓ+1,ℓ+2})→1$$ mathbb{P}left({L}_1in left{ell +1,ell +2right}right)to 1 $$ , with the choice governed by a Poisson limit distribution for the number of components of size ℓ+2$$ ell +2 $$ . This was recently observed, for the case ℓ=1$$ ell =1 $$ and the special cases of permutations and set partitions, using Chen–Stein approximations for the indicators of attacks and alignments in rook placements.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80219358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves 随机平面递增树:根据离叶子的距离对顶点进行渐近枚举

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-12-28 DOI: 10.1002/rsa.21138

M. Bóna, B. Pittel

{"title":"Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves","authors":"M. Bóna, B. Pittel","doi":"10.1002/rsa.21138","DOIUrl":"https://doi.org/10.1002/rsa.21138","url":null,"abstract":"We prove that for any fixed k$$ k $$ , the probability that a random vertex of a random increasing plane tree is of rank k$$ k $$ , that is, the probability that a random vertex is at distance k$$ k $$ from the leaves, converges to a constant ck$$ {c}_k $$ as the size n$$ n $$ of the tree goes to infinity. We prove that 1−∑j≤kck<22k+3(2k+4)!$$ 1-{sum}_{jle k}{c}_k<frac{2^{2k+3}}{left(2k+4right)!} $$ , so that the tail of the limiting rank distribution is super‐exponentially narrow. We prove that the latter property holds uniformly for all finite n$$ n $$ as well. More generally, we prove that the ranks of a finite uniformly random set of vertices are asymptotically independent, each with distribution {ck}$$ left{{c}_kright} $$ . We compute the exact value of ck$$ {c}_k $$ for 0≤k≤3$$ 0le kle 3 $$ , demonstrating that the limiting expected fraction of vertices with rank ≤3$$ le 3 $$ is 0.9997$$ 0.9997 $$ … We show that with probability 1−n−0.99ε$$ 1-{n}^{-0.99varepsilon } $$ the highest rank of a vertex in the tree is sandwiched between (1−ε)logn/loglogn$$ left(1-varepsilon right)log n/mathrm{loglog}n $$ and (1.5+ε)logn/loglogn$$ left(1.5+varepsilon right)log n/mathrm{loglog}n $$ , and that this rank is asymptotic to logn/loglogn$$ log n/mathrm{loglog}n $$ with probability 1−o(1)$$ 1-o(1) $$ .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86321615","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

1‐independent percolation on ℤ2×Kn 1‐独立的渗流作用在0 2×Kn上

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-12-21 DOI: 10.1002/rsa.21129

Victor Falgas‐Ravry, Vincent Pfenninger

{"title":"1‐independent percolation on ℤ2×Kn","authors":"Victor Falgas‐Ravry, Vincent Pfenninger","doi":"10.1002/rsa.21129","DOIUrl":"https://doi.org/10.1002/rsa.21129","url":null,"abstract":"A random graph model on a host graph H$$ H $$ is said to be 1‐independent if for every pair of vertex‐disjoint subsets A,B$$ A,B $$ of E(H)$$ E(H) $$ , the state of edges (absent or present) in A$$ A $$ is independent of the state of edges in B$$ B $$ . For an infinite connected graph H$$ H $$ , the 1‐independent critical percolation probability p1,c(H)$$ {p}_{1,c}(H) $$ is the infimum of the p∈[0,1]$$ pin left[0,1right] $$ such that every 1‐independent random graph model on H$$ H $$ in which each edge is present with probability at least p$$ p $$ almost surely contains an infinite connected component. Balister and Bollobás observed in 2012 that p1,c(ℤd)$$ {p}_{1,c}left({mathbb{Z}}^dright) $$ tends to a limit in [12,1]$$ left[frac{1}{2},1right] $$ as d→∞$$ dto infty $$ , and they asked for the value of this limit. We make progress on a related problem by showing that limn→∞p1,c(ℤ2×Kn)=4−23=0.5358….$$ underset{nto infty }{lim }{p}_{1,c}left({mathbb{Z}}^2times {K}_nright)=4-2sqrt{3}=0.5358dots . $$In fact, we show that the equality above remains true if the sequence of complete graphs Kn$$ {K}_n $$ is replaced by a sequence of weakly pseudorandom graphs on n$$ n $$ vertices with average degree ω(logn)$$ omega left(log nright) $$ . We conjecture the answer to Balister and Bollobás's question is also 4−23$$ 4-2sqrt{3} $$ .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80473334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Iterated tour partitioning for Euclidean capacitated vehicle routing 欧几里得容量车辆路径的迭代巡回划分

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-12-21 DOI: 10.1002/rsa.21130

Claire Mathieu, Hang Zhou

引用次数: 1

Perfect sampling from spatial mixing. 完美的空间混合采样

IF 0.9 3区数学

Random Structures & Algorithms Pub Date : 2022-12-01 Epub Date: 2022-02-18 DOI: 10.1002/rsa.21079

Weiming Feng, Heng Guo, Yitong Yin

引用次数: 0

Mobile Commerce untuk Sales Order dan Tracking Order berbasis MVC 移动商务untuk销售订单和跟踪订单基于MVC

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-11-25 DOI: 10.31253/algor.v4i1.1748

Andi Leo, Verri Kuswanto, Lily Damayanti

{"title":"Mobile Commerce untuk Sales Order dan Tracking Order berbasis MVC","authors":"Andi Leo, Verri Kuswanto, Lily Damayanti","doi":"10.31253/algor.v4i1.1748","DOIUrl":"https://doi.org/10.31253/algor.v4i1.1748","url":null,"abstract":"Internet has become one of the important needs in everyday life. Internet access is very easy with various types of devices, one of which is mobile. This opens up opportunities for business people to serve customers in carrying out mobile-based transactions or what is called m-commerce. M-Commerce provides new innovations in the business world with the convenience it offers, making it used for new business breakthroughs, one of which is delivery service as a service that pampers buyers so they don't have to wait for goods or services ordered for days. This M-Commerce application for purchasing products or ordering services is built using the angularJS method based on the Model View Controller (MVC). This makes the software development cycle more streamlined and easy. This application provides easy service to m-commerce users because of the addition of delivery service, it is also expected to increase the purchase of goods or services on a regular basis. The conveniences obtained from this application are in the form of ordering goods which will then be delivered by the courier, tracking the courier's position while in the process of ordering, selecting products and services that are easier for users to see and viewing transactions and user history, on a mobile basis.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90263680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Hypergraph Ramsey numbers of cliques versus stars 拉姆齐超图中派系与恒星的关系

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-10-07 DOI: 10.1002/rsa.21155

D. Conlon, J. Fox, Xiaoyu He, D. Mubayi, Andrew Suk, Jacques Verstraëte

引用次数: 2

APLIKASI KLASIFIKASI KEPRIBADIAN MANUSIA MENGGUNAKAN ALGORITMA TREE DECISION (C4.5) BERBASIS WEB 人类人格分类应用程序使用基于WEB的TREE DECISION算法(C4.5)

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-09-15 DOI: 10.31253/algor.v4i1.1744

Kent Christopher, Desiyanna Lasut, L. Kusuma

引用次数: 0

Sistem Informasi Perkembangan Desa Sridadi Kec. Wonosoboh Kab. Tanggamus

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-09-15 DOI: 10.31253/algor.v4i1.1850

Satria Abadi, Lisna Sari

{"title":"Sistem Informasi Perkembangan Desa Sridadi Kec. Wonosoboh Kab. Tanggamus","authors":"Satria Abadi, Lisna Sari","doi":"10.31253/algor.v4i1.1850","DOIUrl":"https://doi.org/10.31253/algor.v4i1.1850","url":null,"abstract":"Sistem pemerintahan dan pelayanan publik yang bersih, transparan, merupakan tantangan yang harus dijawab oleh lembaga pemerintahan dalam menjalankan fungsinya. Dengan semangat itulah Kabupaten Tanggamus akan membangun infarstruktur jaringan online sampai ke tingkat desa. Dengan sarana infrastruktur yang telah tersedia dan permasalahan administrasi dan potensi desa yang perlu mendapatkan perhatian serius, mendorong penulis untuk memamfaatkan infrastruktur yang ada dengan mengisi konten / membangun aplikasi yang bersifat e-Government. Seringnya permintaan data tentang perangkat desa dan potensi desa oleh para pimpinan instansi pemerintahan yang lebih tinggi, yang dilakukan secara manual tidak menutup kemungkinan data-data yang disampaikan kurang akurat ataupun kurang cepat, lagipula adanya potensi-potensi desa yang belum optimal serta terjadinya perubahan data-data di desa perlu mendapatkan perhatian yang serius semua pihak. Penulis melakukan penelitian dengan membangun aplikasi yang bertema “Analisa Perancangan Sistem Informasi Perkembangan Desa Sridadi Kecamatan Wonosobo di Pemerintah Kabupaten Tanggamus”. Pengembangan sistem dilakukan berdasarkan pendekatan metode System Development Life Cycle (SDLC) yang meliputi tahapan-tahapan perencanaan, analisis, desain, dan implementasi sistem. Metode pengumpulan data dilakukan dengan cara observasi,wawancara dan studi Pustaka, Sistem informasi yang akan penulis bangun berbasis web dengan bahasa pemprograman PHP, aplikasi dan database terpusat di server dan dapat diakses langsung dari desa.","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2022-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80135944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Implementasi Speech Recognition untuk Asisten Virtual dengan Python

IF 1 3区数学

Random Structures & Algorithms Pub Date : 2022-09-15 DOI: 10.31253/algor.v4i1.1545

Y. Setyawan, Yo Ceng Giap

引用次数: 0