Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDeducing Vertex Weights from Empirical Occupation Times
126
0
0.0
(
0
)
Authors
Joshua N. Cooper
Ask ChatGPT about the research
No Arabic abstract
We consider the following problem arising from the study of human problem solving: Let $G$ be a vertex-weighted graph with marked in and out vertices. Suppose a random walker begins at the in-vertex, steps to neighbors of vertices with probability proportional to their weights, and stops upon reaching the out-vertex. Could one deduce the weights from the paths that many such walkers take? We analyze an iterative numerical solution to this reconstruction problem, in particular, given the empirical mean occupation times of the walkers. In the process, a result concerning the differentiation of a matrix pseudoinverse is given, which may be of independent interest. We then consider the existence of a choice of weights for the given occupation times, formulating a natural conjecture to the effect that -- barring obvious obstructions -- a solution always exists. It is shown that the conjecture holds for a class of graphs that includes all trees and complete graphs. Several open problems are discussed.
rate research
Read More
In this paper, we derive the joint Laplace transforms of occupation times until its last passage times as well as its positions. Motivated by Baurdoux [2], the last times before an independent exponential variable are studied. By applying dual arguments, explicit formulas are derived in terms of new analytical identities from Loeffen et al. [12].
We present a detailed probabilistic and structural analysis of the set of weighted homomorphisms from the discrete torus $mathbb{Z}_m^n$, where $m$ is even, to any fixed graph: we show that the corresponding probability distribution on such homomorphisms is close to a distribution defined constructively as a certain random perturbation of some dominant phase. This has several consequences, including solutions (in a strong form) to conjectures of Engbers and Galvin and a conjecture of Kahn and Park. Special cases include sharp asymptotics for the number of independent sets and the number of proper $q$-colourings of $mathbb{Z}_m^n$ (so in particular, the discrete hypercube). We give further applications to the study of height functions and (generalised) rank functions on the discrete hypercube and disprove a conjecture of Kahn and Lawrenz. For the proof we combine methods from statistical physics, entropy and graph containers and exploit isoperimetric and algebraic properties of the torus.
We study one loop quantum gravitational corrections to the long range force induced by the exchange of a massless scalar between two massive scalars. The various diagrams contributing to the flat space S-matrix are evaluated in a general covariant gauge and we show that dependence on the gauge parameters cancels at a point considerably {it before} forming the full S-matrix, which is unobservable in cosmology. It is possible to interpret our computation as a solution to the effective field equations --- which could be done even in cosmology --- but taking account of quantum gravitational corrections from the source and from the observer.
We investigate a class of weighted voting games for which weights are randomly distributed over the standard probability simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th largest player under the uniform distribution. We analyze the average voting power of the $k$-th largest player and its dependence on the quota, obtaining analytical and numerical results for small values of $n$ and a general theorem about the functional form of the relation between the average Penrose--Banzhaf power index and the quota for the uniform measure on the simplex. We also analyze the power of a collectivity to act (Coleman efficiency index) of random weighted voting games, obtaining analytical upper bounds therefor.
Almost twenty years ago, E.R. Fernholz introduced portfolio generating functions which can be used to construct a variety of portfolios, solely in the terms of the individual companies market weights. I. Karatzas and J. Ruf recently developed another methodology for the functional construction of portfolios, which leads to very simple conditions for strong relative arbitrage with respect to the market. In this paper, both of these notions of functional portfolio generation are generalized in a pathwise, probability-free setting; portfolio generating functions are substituted by path-dependent functionals, which involve the current market weights, as well as additional bounded-variation functions of past and present market weights. This generalization leads to a wider class of functionally-generated portfolios than was heretofore possible, and yields improved conditions for outperforming the market portfolio over suitable time-horizons.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
