相关论文: A switching identity for cable-graph loop soups an…
Given any two forests (pseudoforests) with the same degree sequence, we show that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests…
Continuous phase transitions in spin systems can be formulated as percolation of suitably defined clusters. We review this equivalence and then discuss how in a similar way, the color deconfinement transition in SU(2) gauge theory can be…
It has been recently shown that, under appropriate hypotheses, the $\omega$-limit sets of a dynamical system are characterized by internal chain transitivity. In this paper, we examine generalizations of these ideas in the context of the…
Tensor networks are often used to accurately represent ground states of quantum spin chains. Two popular choices of such tensor network representations can be seen to implement linear maps that correspond, respectively, to euclidean time…
Working within the Nonequilibrium Green's Function (NEGF) formalism, a formula for the two-time current correlation function is derived for the case of transport through a nanojunction in response to an arbitrary time-dependent bias. The…
We show that if a graph $G$ involves a certain square grid graph as a full subgraph, then a certain operation on it yields a simplicial suspension of the independence complex of $G$. This generalizes a result of Csorba. As a corollary, we…
In previous work, empirical evidence indicated that a time-varying network could propagate sufficient information to allow synchronization of the sometimes coupled oscillators, despite an instantaneously disconnected topology. We prove here…
We study a semi-local Abelian Higgs sigma model with $\mathbb{CP}^2$-valued scalar fields coupled to gravity. We establish the conditions needed for self-duality in this system and obtain cosmic strings, both of self-dual character and out…
We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on…
We extend results of Brewster and Graves for switching $m$-edge coloured graphs with respect to a cyclic group to switching $(m, n)$-mixed graphs with respect to an Abelian group. In particular, we establish the existence of a $(m,…
We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…
We generalize the framework of spurion analysis to a class of selection rules arising from non-invertible fusion algebras in perturbation theory. As a first step toward systematic applications to particle physics, we analyze the near-group…
We consider the tributary structure of Howard's drainage model studied by Gangopadhyay et. al. Conditional on the event that the tributary survives up to time $n$, we show that, as a sequence of random metric spaces, scaled tributary…
We show that the scaling limit of the random walk loop soup on suitable planar graphs is the Brownian loop soup, under a topology on multisets of unrooted, unparameterized, and macroscopic loops. The result holds assuming only convergence…
Distribution of a Brownian motion conditioned to start from the boundary of an open set $G$ and to stay in $G$ for a finite period of time is studied. Characterizations of such distributions in terms of certain singular stochastic…
We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…
The formation of triangles in complex networks is an important network property that has received tremendous attention. The formation of triangles is often studied through the clustering coefficient. The closure coefficient or transitivity…
We consider the critical and off-critical properties at the boundary of the random transverse-field Ising spin chain when the distribution of the couplings and/or transverse fields, at a distance $l$ from the surface, deviates from its…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
The tree-loop duality relation is used as a starting point to derive the constraints of causality and unitarity. Specifically, the Bogoliubov causality condition is ab initio derived at the individual graph level. It leads to a…