Related papers: Comment on `Monte Carlo simulation study of the tw…
The mechanism of second thresholds observed in several experiments is theoretically revealed by studying the BEC-BCS-laser crossover in exciton-polariton systems. We found that there are two different types for the second thresholds; one is…
The identification of phase transition points, beta_c, with the percolation thresholds of suitably defined clusters of spins has proved immensely fruitful in many areas of statistical mechanics. Some time ago Kertesz suggested that such…
An extensive Quantum Monte Carlo calculation is performed for the two-leg Hubbard ladder model to clarify whether the singlet pairing correlation decays slowly, which is predicted from the weak-coupling theory but controversial from…
In this paper, we consider the notion of \emph{special treewidth}, recently introduced by Courcelle\cite{Courcelle2012}. In a special tree decomposition, for each vertex $v$ in a given graph, the bags containing $v$ form a rooted path. We…
We perform a nonperturbative lattice study of the electroweak phase transition in the real singlet scalar extension of the Standard Model.We consider both the heavy and light singlet-like scalar regimes at non-zero singlet-doublet mixing…
We develop Entanglement Perturbation Theory (EPT) for infinite Quasi-1D quantum systems. The spin 1/2 Heisenberg chain with ferromagnetic nearest neighbor (NN) and antiferromagnetic next nearest neighbor (NNN) interactions with an…
We investigate the BCS-BEC crossover in a bilayer system of fermionic dipoles at zero temperature using the fixed-node diffusion Monte Carlo technique. The dipoles are confined on two parallel planes separated by a distance $\lambda$ and…
A graph $G = (V,E)$ is a double-threshold graph if there exist a vertex-weight function $w \colon V \to \mathbb{R}$ and two real numbers $\mathtt{lb}, \mathtt{ub} \in \mathbb{R}$ such that $uv \in E$ if and only if $\mathtt{lb} \le…
Using a recently introduced algorithm for simulating percolation in microcanonical (fixed-occupancy) samples, we study the convergence with increasing system size of a number of estimates for the percolation threshold for an open system…
Quantum Monte Carlo is used to investigate the possibility of d_{x^2-y^2} superconductivity in the two-dimensional repulsive Hubbard model. A small energy scale relevant to possible pairing requires a care (i.e., sufficiently small level…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
We study living neural networks by measuring the neurons' response to a global electrical stimulation. Neural connectivity is lowered by reducing the synaptic strength, chemically blocking neurotransmitter receptors. We use a…
Percolation is a fundamental concept that brought new understanding on the robustness properties of complex systems. Here we consider percolation on weakly interacting networks, that is, network layers coupled together by much less…
We consider different methods, that do not rely on numerical simulations of the percolation process, to approximate percolation thresholds in networks. We perform a systematic analysis on synthetic graphs and a collection of 109 real…
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…
We extend the model of a 2$d$ solid to include a line of defects. Neighboring atoms on the defect line are connected by ?springs? of different strength and different cohesive energy with respect to the rest of the system. Using the…
We consider Bernoulli bond percolation on the product graph of a regular tree and a line. We show that the triangle condition does not hold at the uniqueness threshold.
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
Popular Monte-Carlo tree search (MCTS) algorithms for online planning, such as epsilon-greedy tree search and UCT, aim at rapidly identifying a reasonably good action, but provide rather poor worst-case guarantees on performance improvement…
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…