相关论文: Semi-random process without replacement
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
In this paper, we study Maker-Breaker games on the random hypergraph $H_{n,s,p}$, obtained from the complete $s$-graph by keeping every edge independently with probability $p$. We determine the threshold probability for the property of…
The $q$-voter model with independence is generalized to signed random graphs and studied by means of Monte Carlo simulations and theoretically using the mean field approximation and different forms of the pair approximation. In the signed…
We give a simple and natural (probabilistic) construction of hypergraph regularization. It is done just by taking a constant-bounded number of random vertex samplings only one time (thus, iteration-free). It is independent from the…
An $r$-sunflower is a collection of $r$ sets such that the intersection of any two sets in the collection is identical. We analyze a random process which constructs a $w$-uniform $r$-sunflower free family starting with an empty family and…
Web crawlers are used by internet search engines to gather information about the web graph. In this paper we investigate a simple process which models such software by walking around the vertices of a graph. Once initial random vertex…
The concept of a random process has been recently extended to graph signals, whereby random graph processes are a class of multivariate stochastic processes whose coefficients are matrices with a \textit{graph-topological} structure. The…
We consider estimation in a particular semiparametric regression model for the mean of a counting process with ``panel count'' data. The basic model assumption is that the conditional mean function of the counting process is of the form…
We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…
For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…
We propose a novel unsupervised image segmentation algorithm, which aims to segment an image into several coherent parts. It requires no user input, no supervised learning phase and assumes an unknown number of segments. It achieves this by…
The generation of a random triangle-saturated graph via the triangle-free process has been studied extensively. In this short note our aim is to introduce an analogous process in the hypercube. Specifically, we consider the $Q_2$-free…
We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…
In this paper we introduce a new class of partially filled arrays that, as Heffter arrays, are related to difference families, graph decompositions and biembeddings. A non-zero sum Heffter array $\mathrm{N}\mathrm{H}(m,n; h,k)$ is an $m…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
Semiautomata form a rich class of sequence-processing algorithms with applications in natural language processing, robotics, computational biology, and data mining. We establish the first Statistical Query hardness result for semiautomata…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
A specific family of point processes are introduced that allow to select samples for the purpose of estimating the mean or the integral of a function of a real variable. These processes, called quasi-systematic processes, depend on a tuning…