Results 41 to 50 of about 1,141 (244)
On the Entropy of a Two Step Random Fibonacci Substitution
Entropy, 2013 We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, a → baa and b → ab, with probability , and → ba, with probability 1 – p for 0 < p < 1, and where the random rule is
Johan Nilsson
doaj +1 more source
Complex martingales and asymptotic enumeration
Random Structures & Algorithms, 2017 AbstractMany enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high‐dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic behavior of such integrals, we establish explicit bounds on the exponentials of complex martingales. Those bounds
Mikhail Isaev, Brendan D. McKay
openaire +4 more sources
On the asymptotic enumeration of Cayley graphs [PDF]
Annali di Matematica Pura ed Applicata (1923 -), 2021 AbstractIn this paper, we are interested in the asymptotic enumeration of Cayley graphs. It has previously been shown that almost every Cayley digraph has the smallest possible automorphism group: that is, it is a digraphical regular representation (DRR). In this paper, we approach the corresponding question for undirected Cayley graphs.
Morris J., Moscatiello M., Spiga P.
openaire +3 more sources
Approximate Voronoi cells for lattices, revisited
Journal of Mathematical Cryptology, 2020 We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis–Laarhoven–De Weger [PQCrypto, 2019] of determining exact ...
Laarhoven Thijs
doaj +1 more source
Optimized Entanglement Purification [PDF]
Quantum, 2019 We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is ...
Stefan Krastanov +2 more
doaj +1 more source
Paradigm of nonstochastic approach to system identification
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2023 The concept of a complex system in this work is understood as a large set of dynamic interconnected systems, the exact mathematical model of which is not known or has a very large dimension. In such situation the use of standard methods for synthesizing
Вʼячеслав Федорович Губарев +2 more
doaj +1 more source
On the enumeration and asymptotic growth of free quasigroup words [PDF]
International Journal of Algebra and Computation, 2020 This paper counts the number of reduced quasigroup words of a particular length in a certain number of generators. Taking account of the relationship with the Catalan numbers, counting words in a free magma, we introduce the term peri-Catalan number for the free quasigroup word counts.
Jonathan D. H. Smith, Stefanie G. Wang
openaire +3 more sources
Asymptotic properties of some minor-closed classes of graphs (conference version) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Let $\mathcal{A}$ be a minor-closed class of labelled graphs, and let $G_n$ be a random graph sampled uniformly from the set of n-vertex graphs of $\mathcal{A}$. When $n$ is large, what is the probability that $G_n$ is connected? How many components does
Mireille Bousquet-Mélou, Kerstin Weller
doaj +1 more source
Asymptotic enumeration of Minimal Automata
CoRR, 2011 12+5 pages, 2 figures, submitted to STACS ...
Bassino, Frédérique +2 more
openaire +4 more sources
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs [PDF]
The Electronic Journal of Combinatorics, 2007 We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number $g_{n}$ of unlabeled outerplanar graphs on $n$ vertices can be computed in polynomial time, and $g_{n}$ is asymptotically $g\, n^{-5/2}\rho^{-n}$, where $g\approx0.00909941$ and $\rho^{-1}\approx7.50360$ can be approximated. Using our enumerative results we
Manuel Bodirsky +3 more
openaire +2 more sources