中文
相关论文

相关论文: Transfer current and pattern fields in spanning tr…

200 篇论文

Electronic structure calculations are routinely carried out within the framework of density-functional theory, often with great success. For electrons in reduced dimensions, however, there is still a need for better approximations to the…

强关联电子 · 物理学 2009-09-22 S. Pittalis , E. Rasanen , E. K. U. Gross

We experimentally and numerically examine stress-dependent electrical transport in granular materials to elucidate the origins of their universal dielectric response. The ac responses of granular systems under varied compressive loadings…

无序系统与神经网络 · 物理学 2019-10-25 Chongpu Zhai , Dorian Hanaor , Gwénaëlle Proust , Yixiang Gan

Let $G$ be an infinite graph such that each tree in the wired uniform spanning forest on $G$ has one end almost surely. On such graphs $G$, we give a family of continuous, measure preserving, almost one-to-one mappings from the wired…

概率论 · 数学 2014-12-19 Samuel L. Gamlin , Antal A. Járai

We extend recent remarkable progress in the comparison of the dynamical energy spectrum of rotating closed strings in AdS_5xS^5 and the scaling weights of the corresponding non-near-BPS operators in planar N=4 supersymmetric gauge theory.…

高能物理 - 理论 · 物理学 2009-09-29 N. Beisert , S. Frolov , M. Staudacher , A. A. Tseytlin

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

组合数学 · 数学 2007-05-23 Richard W. Kenyon , James G. Propp , David B. Wilson

D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…

概率论 · 数学 2018-08-29 L. Avena , F. Castell , A. Gaudilliere , C. Melot

Let $G$ be a graph with a spanning subgraph $F$, let $m$ be a positive integer, and let $f$ be a positive integer-valued function on $V(G)$. In this paper, we show that if for all $S\subseteq V(G)$, $$\Omega_m(G\setminus S)\le \sum_{v\in…

组合数学 · 数学 2024-08-23 Morteza Hasanvand

We attempt to shed new light on the notion of 'tree-like' metric spaces by focusing on an approach that does not use the four-point condition. Our key question is: Given metric space $M$ on $n$ points, when does a fully labelled…

组合数学 · 数学 2015-12-08 Momoko Hayamizu , Kenji Fukumizu

We study four-dimensional conformal field theories (CFTs) with an abelian $U(1)$ global symmetry using the conformal bootstrap approach. We obtain numerical bounds on the scaling dimensions of low-lying operators, the stress-tensor central…

高能物理 - 理论 · 物理学 2025-12-25 Denis Karateev , Petr Kravchuk , Andrea Manenti , Marten Reehorst , Alessandro Vichi

Transport in undoped graphene is related to percolating current patterns in the networks of {\em N-} and {\em P}-type regions reflecting the strong bipolar charge density fluctuations. Transmissions of the {\em P-N} junctions, though small,…

介观与纳米尺度物理 · 物理学 2009-11-13 V. V. Cheianov , V. I. Falko , B. L. Altshuler , I. L. Aleiner

This review describes in detail the essential techniques used in microscopic theories on spintronics. We have investigated the domain wall dynamics induced by electric current based on the $s$-$d$ exchange model. The domain wall is treated…

介观与纳米尺度物理 · 物理学 2008-11-07 Gen Tatara , Hiroshi Kohno , Junya Shibata

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and…

概率论 · 数学 2021-06-01 Louigi Addario-Berry , Sanchayan Sen

In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

组合数学 · 数学 2023-01-31 Ron Rosenthal , Lior Tenenbaum

In a transparent three-terminal Josephson junction, modeling nonequilibrium transport is numerically challenging, owing to the interplay between multiple Andreev reflection (MAR) thresholds and multipair resonances in the pair current. An…

介观与纳米尺度物理 · 物理学 2016-08-06 Régis Mélin , Denis Feinberg , Benoît Douçot

This paper focuses on spectral graph convolutional neural networks (ConvNets), where filters are defined as elementwise multiplication in the frequency domain of a graph. In machine learning settings where the dataset consists of signals…

机器学习 · 计算机科学 2021-06-15 Ron Levie , Wei Huang , Lorenzo Bucci , Michael M. Bronstein , Gitta Kutyniok

Graph neural networks (GNNs) achieve strong performance on graph learning tasks, but training on large-scale networks remains computationally challenging. Transferability results show that GNNs with fixed weights can generalize from smaller…

信号处理 · 电气工程与系统科学 2026-04-17 Haoyu Wang , Renyuan Ma , Gonzalo Mateos , Luana Ruiz

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

信息论 · 计算机科学 2015-11-20 Ayşe Ünsal , Raymond Knopp

Based on a tight-binding model for the electron system, we investigate the transfer of energy, momentum, and angular momentum mediated by electromagnetic fields among buckminsterfullerene (C$_{60}$) and graphene nano-strips. Our…

介观与纳米尺度物理 · 物理学 2024-03-14 Jian-Sheng Wang , Mauro Antezza

We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…

数据结构与算法 · 计算机科学 2024-12-20 Takehiro Ito , Naonori Kakimura , Naoyuki Kamiyama , Yusuke Kobayashi , Yoshio Okamoto