Related papers: Properties of maximum Lempel-Ziv complexity string…
Composite likelihoods are a class of alternatives to the full likelihood which are widely used in many situations in which the likelihood itself is intractable. A composite likelihood may be computed without the need to specify the full…
In the last years, researchers have realized the difficulties of fitting power-law distributions properly. These difficulties are higher in Zipf's systems, due to the discreteness of the variables and to the existence of two representations…
Model selection is central to statistics, and many learning problems can be formulated as model selection problems. In this paper, we treat the problem of selecting a maximum entropy model given various feature subsets and their moments, as…
The Levenshtein distance is an important tool for the comparison of symbolic sequences, with many appearances in genome research, linguistics and other areas. For efficient applications, an approximation by a distance of smaller…
It has been shown recently that the toroidally compactified type IIB string effective action possesses an SL(2, R) invariance. Using this symmetry we construct an infinite family of macroscopic string-like solutions permuted by SL(2, Z)…
Recently, a new framework for solving the hierarchy problem has been proposed which does not rely on low energy supersymmetry or technicolor. The gravitational and gauge interactions unite at the electroweak scale, and the observed weakness…
A guessing wiretapper's performance on a Shannon cipher system is analyzed for a source with memory. Close relationships between guessing functions and length functions are first established. Subsequently, asymptotically optimal encryption…
In this paper we study the spectrum of bosonic string theory on AdS_3. We study classical solutions of the SL(2,R) WZW model, including solutions for long strings with non-zero winding number. We show that the model has a symmetry relating…
The paper proposes an improved error-resilient Lempel-Ziv'77 (LZ'77) algorithm employing an adaptive amount of parity bits for error protection. It is a modified version of error resilient algorithm LZRS'77, proposed recently, which uses a…
G. Edelman, O. Sporns, and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were…
We present an algorithm that computes the Lempel-Ziv decomposition in $O(n(\log\sigma + \log\log n))$ time and $n\log\sigma + \epsilon n$ bits of space, where $\epsilon$ is a constant rational parameter, $n$ is the length of the input…
String processing, which mainly involves the analysis and manipulation of strings, is a fundamental component of modern computing. Despite the significant advancements of large language models (LLMs) in various natural language processing…
In contrast to the old heterotic string case, the (weakly coupled) type I brane framework allows to have all, part or none of the standard model gauge group factors propagating in large extra--dimensions of TeV$^{-1}$ size. We investigate…
We study various properties of closed relativistic strings. In particular, we characterize their closure under uniform convergence, extending a previous result by Y. Brenier on graph-like unbounded strings, and we discuss some related…
Complex networks obtained from the real-world networks are often characterized by incompleteness and noise, consequences of limited sampling as well as artifacts in the acquisition process. Because the characterization, analysis and…
There are many conceivable possibilities of embedding the MSSM in string theory. These proceedings describe an approach which is based on grand unification in higher dimensions. This allows one to obtain global string-derived models with…
These lectures present some topics of string phenomenology and contain two parts. In the first part, I review the possibility of lowering the string scale in the TeV region, that provides a theoretical framework for solving the mass…
The spectral properties of the spinless fermion model with nearest-neighbor repulsive interactions on a one-dimensional lattice are investigated using the Bethe ansatz. Although its bulk quantities are exactly the same as those of the…