相关论文: Hitting properties of a random string

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e.,…

For a symmetric, homogeneous and irreducible random walk on d-dimensional integer lattice Z^d, having zero mean and a finite variance of jumps, we study the passage times (with possible infinite values) determined by the starting point x,…

Tipping points characterize situations where a regulated system may experience a sudden and irreversible change and are generally associated with a random state of the system below which the change materializes. In this paper, we study a…

We study the problem nonparametric classification with repeated observations. Let $\bX$ be the $d$ dimensional feature vector and let $Y$ denote the label taking values in $\{1,\dots ,M\}$. In contrast to usual setup with large sample size…

We discuss supersymmetry breaking mechanisms at the level of low energy N=1 effective heterotic superstring actions that exhibit $SL(2,Z)_T$ target space modular duality or $SL(2,Z)_S$ strong-weak coupling duality. The allowed…

We analyze patterns of remnant discrete symmetries that arise from U(1)^N theories by spontaneous breaking. We describe a simple, geometrical way to understand these patterns and provide methods for identifying the discrete symmetries and…

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…

Multidimensional record patterns are random sets of lattice points defined by means of a recursive stochastic construction. The patterns thus generated owe their richness to the fact that the construction is not based on a total order,…

The Huge Object model of property testing [Goldreich and Ron, TheoretiCS 23] concerns properties of distributions supported on $\{0,1\}^n$, where $n$ is so large that even reading a single sampled string is unrealistic. Instead, query…

The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…

We consider a system of asymmetric independent random walks on $\mathbb{Z}^d$, denoted by $\{\eta_t,t\in{\mathbb{R}}\}$, stationary under the product Poisson measure $\nu_{\rho}$ of marginal density $\rho>0$. We fix a pattern $\mathcal{A}$,…

We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…

We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…

We consider properties of confining strings in 2+1 dimensional SU(2) nonabelian gauge theory with the Higgs field in adjoint representation. The analysis is carried out in the context of effective dual Lagrangian which describes the…

String theory in d dimensions has n+1=11-d parameters that may be thought of as being inherited from the geometry of an n+1 torus which may be used to construct the theory using dimensional reduction from eleven dimensions. We give the…

Low-scale string models are phenomenological models in String Theory, in which the string scale M_s is of the order of TeV. String excited states which are characteristic modes in low-scale string models can be observed as resonances in…

We study a string-inspired classical 2-D effective field theory with {\it nonsingular} black holes as well as Witten's black hole among its static solutions. By a dimensional reduction, the static solutions are related to the…

In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…

Have you also been wondering what is this thing with double robustness and nuisance parameters estimated at rate n^(1/4)? It turns out that to understand this phenomenon one just needs the Middle Value Theorem (or a Taylor expansion) and…

We establish limit theorems for U-statistics indexed by a random walk on Z^d and we express the limit in terms of some Levy sheet Z(s,t). Under some hypotheses, we prove that the limit process is Z(t,t) if the random walk is transient or…