Related papers: The upper critical dimension of the negative-weigh…
Loop models have been widely studied in physics and mathematics, in problems ranging from polymers to topological quantum computation to Schramm-Loewner evolution. I present new loop models which have critical points described by conformal…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
In this thesis we consider four dimensional N=2 superconformal field theories, in presence of line defects such as Wilson loops. In this set up, using supersymmetric localization, we compute many observables, such as the vacuum expectation…
Determining the universality class of a system exhibiting critical phenomena is one of the central problems in physics. There are several methods to determine this universality class from data. As methods performing collapse plots onto…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
We investigated two-dimensional brittle fragmentation with a flat impact experimentally, focusing on the low impact energy region near the fragmentation-critical point. We found that the universality class of fragmentation transition…
We study the densest subgraph problem and give algorithms via multiplicative weights update and area convexity that converge in $O\left(\frac{\log m}{\epsilon^{2}}\right)$ and $O\left(\frac{\log m}{\epsilon}\right)$ iterations,…
In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on the d-dimensional hyper cubic lattice having long finite-range connections, above their upper critical dimensions d=4…
Three-dimensional quantum percolation problems are studied by analyzing energy level statistics of electrons on maximally connected percolating clusters. The quantum percolation threshold $\pq$, which is larger than the classical…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
We investigate through direct molecular mechanics calculations the geometrical properties of hydrocarbon mantles subjected to percolation disorder. We show that the structures of mantles generated at the critical percolation point have a…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
We describe the component sizes in critical independent p-bond percolation on a random d-regular graph on n vertices, where d \geq 3 is fixed and n grows. We prove mean-field behavior around the critical probability p_c=1/(d-1). In…
We study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome…
This is a comprehensive report on the phase transition between two turbulent states of electroconvection in nematic liquid crystals, which was recently found by the authors to be in the directed percolation (DP) universality class [K. A.…