相关论文: Cluster capacity functionals and isomorphism theor…

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

Let G be a compact Lie group. By work of Chataur and Menichi, the homology of the space of free loops in the classifying space of G is known to be the value on the circle in a homological conformal field theory. This means in particular…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…

We show that if $G$ is a non-archimedean, Roelcke precompact, Polish group, then $G$ has Kazhdan's property (T). Moreover, if $G$ has a smallest open subgroup of finite index, then $G$ has a finite Kazhdan set. Examples of such $G$ include…

We show that if an interlacing particle system in a two-dimensional lattice is a determinantal point process, and the correlation kernel can be expressed as a double integral with certain technical assumptions, then the moments of the…

We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…

We consider canonical determinantal random point processes with N particles on a compact Riemann surface X defined with respect to the constant curvature metric. In the higher genus (hyperbolic) cases these point processes may be defined in…

Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…

Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…

We consider a family of dense $G_{\delta}$ subsets of $[0,1]$, defined as intersections of unions of small uniformly distributed intervals, and study their capacity. Changing the speed at which the lengths of generating intervals decrease,…

Over the years a number of topologies for the set of laws of stochastic processes have been proposed. Building on the weak topology they all aim to capture more accurately the temporal structure of the processes. In a parallel paper we show…

Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…

We consider the density of two-dimensional critical percolation clusters, constrained to touch one or both boundaries, in infinite strips, half-infinite strips, and squares, as well as several related quantities for the infinite strip. Our…

Let $\mathbb{G}=\left(\mathbb{V},\mathbb{E}\right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $\mathbb{Z}$. We choose a collection $\mathcal{C}$ of finite…

The latent space approach to complex networks has revealed fundamental principles and symmetries, enabling geometric methods. However, the conditions under which network topology implies geometricity remain unclear. We provide a…

For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…

We study families of dependent site percolation models on the triangular lattice ${\mathbb T}$ and hexagonal lattice ${\mathbb H}$ that arise by applying certain cellular automata to independent percolation configurations. We analyze the…

We consider geometrical characteristics of monopole clusters of the lattice SU(2) gluodynamics. We argue that the polymer approach to the field theory is an adequate means to describe the monopole clusters. Both finite-size and the…

The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…

This paper's major purpose is to continue the work of Zhu and Ma[1]. To begin, the $\mathbf{g}$-almost product property, more general irregular and regular sets, and some new notions of the Banach upper density recurrent points and…