19 citations · 98 across the 40 of their papers we have counts for
45 papers
Planar site percolation on semi-transitive graphs
Zhongyang Li
Semi-transitive graphs, defined in \cite{hps98} as examples where ``uniform percolation" holds whenever , are a large class of graphs more general than quasi-transitive grap…
Tree embeddings and nonuniqueness in site percolation
Zhongyang Li
We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs (graphs that can be embedded into $\RR^2$ with no accumulation points), and we ob…
Doubly Free-Boundary Rail-Yard Dimers and Annular Gaussian Fluctuations
Zhongyang Li
We study rail-yard dimer measures with free boundary conditions at both the left and the right boundary. The double free-boundary geometry produces an infinite family of reflected…
Exact Recovery of Community Detection in dependent Gaussian Mixture Models
Zhongyang Li, Sichen Yang
We study exact recovery for community detection in a Gaussian mixture model with dependent and heterogeneous Gaussian noise. The noise covariance matrix may be non-diagonal and…
Percolation critical probabilities of matching lattice-pairs
Geoffrey R. Grimmett, Zhongyang Li
A necessary and sufficient condition is established for the strict inequality between the critical probabilities of site percolation on a quasi-transitive, plane…
Hyperbolic site percolation
Geoffrey R. Grimmett, Zhongyang Li
Several results are presented for site percolation on quasi-transitive, planar graphs with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1…
Asymptotics of pure dimer coverings on rail-yard graphs
Zhongyang Li, Mirjana Vuletić
We study asymptotic limit of random pure dimer coverings on rail yardgraphs when the mesh sizes of the graphs go to 0. Each pure dimer covering correspondsto a sequence of interlac…
Limit shape of perfect matchings on rail-yard graphs
Zhongyang Li
We obtain limit shape of perfect matchings on a large class of rail-yard graphs with right boundary condition given by the empty partition, and left boundary condition given by eit…
Matchings on Random Regular Hypergraphs
Zhongyang Li
We study the monomer--dimer partition function on the configuration model of random -regular, -uniform hypergraphs. For fixed , we prove quenched free-energy limits…
Gabor single-frame and multi-frame multipliers in any given dimension
Yuanan Diao, Deguang Han, Zhongyan Li
Functional Gabor single-frame or multi-frame generator multipliers are the matrices of function entries that preserve Parseval Gabor single-frame or multi-frame generators. An inte…
On the coercivity condition in the learning of interacting particle systems
Zhongyang Li, Fei Lu
In the learning of systems of interacting particles or agents, coercivity condition ensures identifiability of the interaction functions, providing the foundation of learning by no…
Limit shape of perfect matchings on contracting bipartite graphs
Zhongyang Li
We consider random perfect matchings on a general class of contracting bipartite graphs by letting certain edge weights be 0 on the contracting square-hexagon lattice in a periodic…
Brownian snails with removal: epidemics in diffusing populations
Geoffrey R. Grimmett, Zhongyang Li
Two stochastic models of susceptible/infected/removed (SIR) type are introduced for the spread of infection through a spatially-distributed population. Individuals are initially di…
Exact Recovery of Community Detection in k-Community Gaussian Mixture Model
Zhongyang Li
We study the community detection problem on a Gaussian mixture model, in which vertices are divided into distinct communities. The major difference in our model is that t…
Asymptotics of Schur functions on almost staircase partitions
Zhongyang Li
We study the asymptotics of Schur polynomials with partitions which are almost staircase; more precisely, partitions that differ from b…
Gabor Functional Multiplier in the Higher Dimensions
Zhongyan Li, Yuanan Diao
For two given full-rank lattices and in , where and are nonsingular real matrices, a funct…
Ising Percolation on Nonamenable Planar Graphs
Zhongyang Li
We study infinite ``'' or ``'' clusters for an Ising model on an connected, transitive, non-amenable, planar, one-ended graph with finite vertex degree. If the critical p…
Site Percolation on Planar Graphs
Zhongyang Li
We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1…
On the identifiability of interaction functions in systems of interacting particles
Zhongyang Li, Fei Lu, Mauro Maggioni +2
We address a fundamental issue in the nonparametric inference for systems of interacting particles: the identifiability of the interaction functions. We prove that the interaction…
Exact Recovery of Community Detection in k-partite Graph Models
Zhongyang Li
We study the vertex classification problem on a graph whose vertices are in different communities, edges are only allowed between distinct communities, and the numbe…
Fluctuations of dimer heights on contracting square-hexagon lattices
Zhongyang Li
We study perfect matchings on the square-hexagon lattice with periodic edge weights such that the boundary condition is given by either (1) each remaining vertex on the…
Schur function at generic points and limit shape of perfect matchings on contracting square hexagon lattices with piecewise boundary conditions
Zhongyang Li
We obtain a new formula to relate the value of a Schur polynomial with variables with values of Schur polynomials at . This allows to study the lim…
Weighted self-avoiding walks
Geoffrey R. Grimmett, Zhongyang Li
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indica…
Limit shape and height fluctuations of random perfect matchings on square-hexagon lattices
Cédric Boutillier, Zhongyang Li
We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square gr…