Related papers: KMS states, conformal measures and ends in digraph…
We consider random conformally invariant paths in the complex plane (SLEs). Using the Coulomb gas method in conformal field theory, we rederive the mixed multifractal exponents associated with both the harmonic measure and winding (rotation…
We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…
Hypergraph states are a special kind of multipartite states encoded by hypergraphs relevant in quantum error correction, measurement--based quantum computation, quantum non locality and entanglement. In a series of two papers, we introduce…
Starting with a $W^{*}$-algebra $M$ we use the inverse system obtained by cutting down $M$ by its (central) projections to define an inverse limit of $W^{*}$-algebras, and show that how this pro-$W^{*}$-algebra encodes the local structure…
Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
Given a topologically free action of a countable group $G$ on a compact metric space $X$, there is a canonical correspondence between continuous 1-cocycles for this group action and diagonal 1-parameter groups of automorphisms of the…
This paper introduces new efficient algorithms for two problems: sampling conditional on vertex degrees in unweighted graphs, and sampling conditional on vertex strengths in weighted graphs. The algorithms can sample conditional on the…
We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…
We continue the study of isomorphisms of tensor algebras associated to a C*-correspondences in the sense of Muhly and Solel. Inspired by by recent work of Davidson, Ramsey and Shalit, we solve isomorphism problems for tensor algebras…
We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph…
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…
Graphity models are characterized by configuration spaces in which states correspond to graphs and Hamiltonians that depend on local properties of graphs such as the degrees of vertices and numbers of short cycles. As statistical systems,…
In \cite{PSMA}, Pal et al. introduced some weighted means and gave some related inequalities by using an approach for operator monotone functions. This paper discusses the construction of these weighted means in a simple and nice setting…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…
Inspired by Franks' classification of irreducible shifts of finite type we provide a short list of allowed moves on graphs that preserves the stable isomorphism class of the associated C*-algebras. We show that if two graphs have stably…
This paper introduces some tools from graph theory and distributed consensus algorithms to construct an optimal, yet robust, hierarchical information sharing structure for large-scale decision making and control problems. The proposed…
This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints. Edges in this graph may disappear and reappear…