相关论文: DOP and FCP in generic structures
After the main gap theorem was proved (see [Sh:c]), in discussion, Harrington expressed a desire for a finer structure - of finitary character (when we have a structure theorem at all). I point out that the logic L_{infty,aleph_0}(d.q.)…
A wide variety of complex networks (social, biological, information etc.) exhibit local clustering with substantial variation in the clustering coefficient (the probability of neighbors being connected). Existing models of large graphs…
We prove the following generalization of the classical Shephard-Todd-Chevalley Theorem. Let $G$ be a finite group of graded algebra automorphisms of a skew polynomial ring $A:=k_{p_{ij}}[x_1,...,x_n]$. Then the fixed subring $A^G$ has…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
An asymptotic behavior of the probabilities of first-order properties of Erdos-Renyi random graph G(N,p), lnp=-alnN, is studied in the article. We prove the covergence law for formulae with quantifier depth bounded by k when a=1/(k-2).
Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex…
In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to…
The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of large independent sets, of size matching the best-known…
We say that a Hopf algebra has the Chevalley property if the tensor product of any two simple modules over this Hopf algebra is semisimple. In this paper we classify finite dimensional triangular Hopf algebras with the Chevalley property,…
Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…
We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…
Complex networks are everywhere. They appear for example in the form of biological networks, social networks, or computer networks and have been studied extensively. Efficient algorithms to solve problems on complex networks play a central…
Large knowledge graphs combine human knowledge garnered from projects ranging from academia and institutions to enterprises and crowdsourcing. Within such graphs, each relationship between two nodes represents a basic fact involving these…
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along…
We consider global analogues of model-theoretic tree properties. The main objects of study are the invariants related to Shelah's tree property $\kappa_{\text{cdt}}(T)$, $\kappa_{\text{sct}}(T)$, and $\kappa_{\text{inp}}(T)$ and the…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
We consider Blanchet, Habegger, Masbaum and Vogel's universal construction of topological theories in dimension two, using it to produce interesting theories that do not satisfy the usual two-dimensional TQFT axioms. Kronecker's…
In this paper ideas of different types of convergence of a sequence of random variables in probability, namely, statistical convergence of order $\alpha$ in probability, strong $p$-Ces$\grave{\mbox{a}}$ro summability of order $\alpha$ in…
A celebrated conjecture of Zs. Tuza says that in any (finite) graph, the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. Resolving a recent question of Bennett, Dudek, and…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…