University of Victoria

I will present a coupling between a massive planar Gaussian free field (GFF) and a random curve in which the curve can be interpreted as the level of the field. This coupling is constructed by reweighting the law of the standard GFF-SLE_4 coupling. I...

Spin glasses are disordered statistical physics system with both ferromagnetic and anti-ferromagnetic spin interactions. The Gibbs measure belongs to the exponential family with parameters, such as inverse temperature $\beta>0$ and external field $h...

A network of interacting qubits (usually subatomic particles) can be modelled by a connected weighted undirected graph $G$. The vertices and edges of $G$ represent the qubits and their interactions in the network, respectively. Quantum mechanics...

In the talk exchangeability appears in two different meanings. In the first part, the determination of the phase diagram of the Curie-Weiss model relies on De Finetti’s Theorem. The Curie-Weiss distribution will be expressed as a random mixture of...

Double dimers are superimposition of two perfect matchings. Such superimpositions can be decomposed into disjoint simple loops. The question we address is: as the graphs become large, in a 'typical' double dimer sample, do some of the loops diverge...

We show that \((n,d,\lambda)\)-graphs with \(\lambda=O(d/log^3n)\) are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang, and makes progress towards a problem of...

A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation is quasirandom if and only if the pattern density of each of the...

A geometric graph $G$ is a graph $G$ whose vertices are drawn in the plane such that no three vertices are collinear, and each edge of G is a straight line segment. A geometric homomorphism from geometric graph $G$ to geometric graph $H$ is a...

Strong cocomparability graphs are the reflexive graphs whose adjacency matrix can be rearranged by a simultaneous row and column permutation to avoid the submatrix with rows 01, 10. Strong cocomparability graphs form a subclass of cocomparability...

The boxicity of a graph G is a key graph parameter introduced by Roberts in 1969. It represents the minimum dimension d such that G can be realized as the intersection graph of a family of axis-parallel boxes in R^d. Boxicity is an important measure...