منابع مشابه
Interlacings for Random Walks on Weighted Graphs and the Interchange Process
Abstract. We study Aldous’ conjecture that the spectral gap of the interchange process on a weighted undirected graph equals the spectral gap of the random walk on this graph. We present a conjecture in the form of an inequality, and prove that this inequality implies Aldous’ conjecture by combining an interlacing result for Laplacians of random walks on weighted graphs with representation theo...
متن کاملRule Interchange on the Web
Rules play an increasingly important role in a variety of Semantic Web applications as well as in traditional IT systems. As a universal medium for publishing information, the Web is envisioned to become the place for publishing, distributing, and exchanging rule-based knowledge. Realizing the importance and the promise of this vision, the W3C has created the Rule Interchange Format Working Gro...
متن کاملTransparent Knowledge Interchange on the Semantic Web
In spite of a large development of semantic web technologies and a deployment of the first complex applications, the semantic web is still not being widely accepted by the web community and its current potential is not full recognised. One vision of the semantic web is to create a platform for automatic and transparent knowledge sharing. In this paper we discuss a model that uses basic semantic...
متن کاملOn the Representation of Bloom's Revised Taxonomy in Interchange Coursebooks
This study intends to evaluate Interchange series (2005), which are still fundamental coursebooks in the EFL curriculum settings, in terms of learning objectives in Bloom’s Revised Taxonomy (2001) to see which levels of Bloom's Revised Taxonomy were more emphasized in these coursebooks. For this purpose, the contents of Interchange textbooks were codified based on a coding scheme designed by th...
متن کاملOn Barycentric-Magic Graphs
Let $A$ be an abelian group. A graph $G=(V,E)$ is said to be $A$-barycentric-magic if there exists a labeling $l:E(G)longrightarrow Asetminuslbrace{0}rbrace$ such that the induced vertex set labeling $l^{+}:V(G)longrightarrow A$ defined by $l^{+}(v)=sum_{uvin E(G)}l(uv)$ is a constant map and also satisfies that $l^{+}(v)=deg(v)l(u_{v}v)$ for all $v in V$, and for some vertex $u_{v}$ adjacent t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1968
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1968.27.393