Related papers: A Cheeger Inequality for Size-Specific Conductance
We investigate the effect of the well-known Mycielski construction on the Shannon capacity of graphs and on one of its most prominent upper bounds, the (complementary) Lov\'asz theta number. We prove that if the Shannon capacity of a graph,…
We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The…
Let $G = (V,E)$ be an undirected graph with maximum degree $\Delta$ and vertex conductance $\Psi^*(G)$. We show that there exists a symmetric, stochastic matrix $P$, with off-diagonal entries supported on $E$, whose spectral gap…
We study the problem of extracting a selective connector for a given set of query vertices $Q \subseteq V$ in a graph $G = (V,E)$. A selective connector is a subgraph of $G$ which exhibits some cohesiveness property, and contains the query…
Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander…
This paper introduces an order proximity on a collection of objects induced by a partial order using the Smirnov closeness measure on a Sz\'{a}z relator space. A Sz\'{a}z relator is a nonempty family of relations defined on a nonvoid set…
Using the Landauer formula and a random matrix model, we investigate the autocorrelation function of the conductance versus magnetic field strength for ballistic electron transport through few-channel microstructures with the shape of a…
A new non-linear optimization approach is proposed for the sparse reconstruction of log-conductivities in current density impedance imaging. This framework comprises of minimizing an objective functional involving a least squares fit of the…
$\mu$ being a nonnegative measure satisfying some log-Sobolev inequality, we give conditions on F for the measure $\nu=e^{-2F} \mu$ to also satisfy some log-Sobolev inequality. Explicit examples are studied.
Unimodular sequences with low autocorrelations are desired in many applications, especially in the area of radar and code-division multiple access (CDMA). In this paper, we propose a new algorithm to design unimodular sequences with low…
Logarithmic voltage profile characteristic to two-dimensional current flows has been reported for several semiconductor surfaces. We analyse this phenomenon within a simple model of accumulation and inversion layers. Prompted by numerical…
A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph $G$, starting from a specified vertex. For the algorithm to be local, its complexity…
We study the problem of controlling how a limited communication bandwidth budget is allocated across heterogeneously quantized sensor measurements. The performance criterion is the trace of the error covariance matrix of the linear minimum…
Numerical simulation of superconducting devices is a powerful tool for understanding the principles of their work and improving their design. We present a new pseudospectral method for two-dimensional magnetization and transport current…
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…
We calculate the optical conductivity, $\sigma(\omega)$, in the normal state fullerene superconductors by self-consistently including the impurity scatterings, the electron-phonon and electron-electron Coulomb interactions. The finite…
We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence. We give a simple combinatorial characterization of…
We propose a simple approach to study the conductance through an array of $N$ interacting quantum dots, weakly coupled to metallic leads. Using a mapping to an effective site which describes the low-lying excitations and a slave-boson…
We give new, improved bounds for approximating the sparsest cut value or in other words the conductance $\phi$ of a graph in the CONGEST model. As our main result, we present an algorithm running in $O(\log^2 n/\phi)$ rounds in which every…
Recently, a secrecy measure based on list-reconstruction has been proposed [2], in which a wiretapper is allowed to produce a list of $2^{mR_{L}}$ reconstruction sequences and the secrecy is measured by the minimum distortion over the…