Related papers: Heaven & Hell II: Scale Laws and Robustness in One…
For sufficiently smooth targets of product form it is known that the variance of a single coordinate of the proposal in RWM (Random walk Metropolis) and MALA (Metropolis adjusted Langevin algorithm) should optimally scale as $n^{-1}$ and as…
We study the fundamental communication limits of information-theoretic secure aggregation in a hierarchical network consisting of a server, multiple relays, and multiple users per relay. Communication proceeds over two rounds and two hops,…
Understanding what governs collective robustness and how it can be enhanced remains a central pursuit in network science. This paper investigates the robustness of multi-agent consensus networks, quantified by the $H_2$ performance metric,…
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…
We study convergence properties of a randomized consensus algorithm over a graph with both attractive and repulsive links. At each time instant, a node is randomly selected to interact with a random neighbor. Depending on if the link…
We study the vacuum behavior at one loop level in extended Higgs sectors with two doublets (2HDM), where $U(1)$ and $Z_{2}$ symmetries are considered to protect the $CP$ symmetry in the Higgs potential and to avoid Flavor Changing Neutral…
In the real world, the stable operation of a network is usually inseparable from the mutual support of other networks. In such an interdependent network, a node in one layer may depend on multiple nodes in another layer, forming a complex…
A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…
We establish the geometric ergodicity of the preconditioned Hamiltonian Monte Carlo (HMC) algorithm defined on an infinite-dimensional Hilbert space, as developed in [Beskos et al., Stochastic Process. Appl., 2011]. This algorithm can be…
The one-dimensional (1D) tight binding model with random nearest neighbor hopping is known to have a singularity of the density of states and of the localization length at the band center. We study numerically the effects of random long…
A cornerstone of numerical homogenization is the equivalence of the microscopic and the macroscopic energy densities, which is referred to as Hill-Mandel condition. Among these coupling conditions, the cases of periodic, linear displacement…
In this paper the geometric entanglement (GE) of systems in one spatial dimension (1D) and in the thermodynamic limit is analyzed focusing on two aspects. First, we reexamine the calculation of the GE for translation-invariant matrix…
We analyze the scalar potential of the Simplest Little Higgs (SLH) model in an approach consistent with the spirit of continuum effective field theory (CEFT). By requiring correct electroweak symmetry breaking (EWSB) with the…
We show that it is possible to achieve one step gauge coupling unification in a general class of non supersymmetric models which at low energies have only the standard particle content and extra Higgs fields doublets. The constraints are…
We investigate how the graph topology influences the robustness to noise in undirected linear consensus networks. We measure the structural robustness by using the smallest possible value of steady state population variance of states under…
Most cloud services and distributed applications rely on hashing algorithms that allow dynamic scaling of a robust and efficient hash table. Examples include AWS, Google Cloud and BitTorrent. Consistent and rendezvous hashing are algorithms…
The determination of the Hubble constant has been a central goal in observational astrophysics for nearly 100 years. Extraordinary progress has occurred in recent years on two fronts: the cosmic distance ladder measurements at low redshift…
High-dimensional limit theorems have been shown useful to derive tuning rules for finding the optimal scaling in random-walk Metropolis algorithms. The assumptions under which weak convergence results are proved are however restrictive: the…
Quantum coherence is a fundamental manifestation of the quantum superposition principle. Recently, Baumgratz \emph{et al}. [Phys. Rev. Lett. \textbf{113}, 140401 (2014)] presented a rigorous framework to quantify coherence from the view of…
We study the performance of discrete-time consensus protocols in the presence of additive noise. When the consensus dynamic corresponds to a reversible Markov chain, we give an exact expression for a weighted version of steady-state…