相关论文: Zero-one laws for binary random fields

The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is…

Let each vertex of a graph G = (V(G), E(G)) be given one of two colors, say, "black" and "white". Let Z denote the (initial) set of black vertices of G. The color-change rule converts the color of a vertex from white to black if the white…

Zero forcing in graphs is a coloring process where a colored vertex can force its unique uncolored neighbor to be colored. A zero forcing set is a set of initially colored vertices capable of eventually coloring all vertices of the graph.…

We investigate spectral properties of periodic quantum graphs in the form of a kagome or a triangular lattice in the situation when the condition matching the wave functions at the lattice vertices is chosen of a particular form violating…

We conjecture an approximate expression for the free energy in the thermodynamic limit of the classical square lattice Ising model in a uniform (real) magnetic field. The zero-field result is well known due to Onsager for more than eighty…

The zero-temperature random-field Ising model is solved analytically for magnetisation vs external field for a bi-layered Bethe lattice. The mechanisms of infinite avalanches which are observed for small values of disorder are established.…

We study an asymptotic behavior of the probabilities of first-order properties of random graph G(N,p) in the article. We conider p such that lnp=-alnN, a>0. We find values of parameter a from (1-exp(ln2(1-k)),1) such that the random graph…

Consider the empirical spectral distribution of complex random $n\times n$ matrix whose entries are independent and identically distributed random variables with mean zero and variance $1/n$. In this paper, via applying potential theory in…

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence…

We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…

We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…

Zero forcing is a combinatorial game played on a graph with a goal of turning all of the vertices of the graph black while having to use as few "unforced" moves as possible. This leads to a parameter known as the zero forcing number which…

Probabilistic zero forcing is a coloring game played on a graph where the goal is to color every vertex blue starting with an initial blue vertex set. As long as the graph is connected, if at least one vertex is blue then eventually all of…

A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.

Coloured probability tree models are statistical models coding conditional independence between events depicted in a tree graph. They are more general than the very important class of context-specific Bayesian networks. In this paper, we…

We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…

We give a framework for dealing with 0-1 laws (for first order logic) such that expanding by further random structure tend to give us another case of the framework. From another perspective we deal with 0-1 laws when the number of solutions…

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…

We study logical limit laws for preferential attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $1$, we start with vertices $0,1$ and $m$ edges between them. At step $n+1$ the vertex…